000			03224nam a22003737a 4500
999			_c91238 _d91244
003			MY-KuUP
005			20251125105432.0
006			a|||||r|||| 000 0
007			ta
008			191119t20192019my a|||| |m|| 000 0 eng d
020			_aTHE0008292(Local)
040			_aUMP _beng _cUMP _erda
090			_aFSKKP .G65 2019 r Thesis
100	1		_aRabby, Gollam, _eauthor.
245	1	2	_aA tree based keyphrase extraction technique for academic literature / _cGollam Rabby
264		1	_aKuantan, Pahang : _bUMP, _c2019
264		4	_a© 2019
300			_axii, 102 pages : _billustrations (some color) ; _c30 cm. + _e1 CD-ROM
336			_2rdacontent _atext
336			_2rdacontent _atext
337			_2rdamedia _aunmediated
337			_2rdamedia _acomputer
338			_2rdacarrier _avolume
338			_2rdacarrier _acomputer disc
347			_2rda _atext file _bPDF
500			_aFaculty of Computer Systems and Software Engineering
502			_aThesis (Master of Science) -- Universiti Malaysia Pahang – 2019
504			_aIncludes bibliographical references
520	3		_aAutomatic keyphrase extraction techniques aim to extract quality keyphrases to summarize a document at a higher level. Among the existing techniques some of them are domain-specific and require application domain knowledge, some of them are based on higher-order statistical methods and are computationally expensive, and some of them require large train data which are rare for many applications. Overcoming these issues, this thesis proposes a new unsupervised automatic keyphrase extraction technique, named TeKET or Tree-based Keyphrase Extraction Technique, which is domain-independent, employs limited statistical knowledge, and requires no train data. The proposed technique also introduces a new variant of the binary tree, called KeyPhrase Extraction (KePhEx) tree to extract final keyphrases from candidate keyphrases. Depending on the candidate keyphrases the KePhEx tree structure is either expanded or shrunk or maintained. In addition, a measure, called Cohesiveness Index or CI, is derived that denotes the degree of cohesiveness of a given node with respect to the root which is used in extracting final keyphrases from a resultant tree in a flexible manner and is utilized in ranking keyphrases alongside Term Frequency. The effectiveness of the proposed technique is evaluated using an experimental evaluation on a benchmark corpus, called SemEval-2010 with total 244 train and test articles, and compared with other relevant unsupervised techniques by taking the representatives from both statistical (such as Term Frequency-Inverse Document Frequency and YAKE) and graph-based techniques (PositionRank, CollabRank (SingleRank), TopicRank, and MultipartiteRank) into account. Three evaluation metrics, namely precision, recall and F1 score are taken into consideration during the experiments. The obtained results demonstrate the improved performance of the proposed technique over other similar techniques in terms of precision, recall, and F1 scores.
610	2	0	_aFaculty of Computer Systems and Software Engineering
650		0	_aDisertations _xUniversities and colleges
650		0	_aTheses
942			_2lcc _cTHESIS