{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T20:51:33Z","timestamp":1649019093588},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Info. Know. Mgmt."],"published-print":{"date-parts":[[2006,9]]},"abstract":"<jats:p> The importance of text mining stems from the availability of huge volumes of text databases holding a wealth of valuable information that needs to be mined. Text mining is a coarse area encompassing many finer branches one of which is text categorisation or text classification. Text categorisation is the process of assigning class labels to documents based entirely on their textual contents where we are given a document d, and asked to find its subject matter or class label, C<jats:sub>i<\/jats:sub>. <\/jats:p><jats:p> In this paper, an optimised k-Nearest Neighbours classifier that uses discretisation, the P-tree technology, and dimensionality reduction to achieve a high degree of accuracy, space utilisation and time efficiency is proposed. One of the fundamental contributions of this work is that as new samples arrive, the proposed classifier can find the k nearest neighbours to the new sample from the training space without a single database scan. <\/jats:p>","DOI":"10.1142\/s021964920600144x","type":"journal-article","created":{"date-parts":[[2006,9,18]],"date-time":"2006-09-18T08:04:43Z","timestamp":1158566683000},"page":"211-222","source":"Crossref","is-referenced-by-count":0,"title":["Efficiency Considerations for Vertical kNN Text Categorisation"],"prefix":"10.1142","volume":"05","author":[{"given":"Imad","family":"Rahal","sequence":"first","affiliation":[{"name":"211, Peter Engel Science Center, Computer Science Department, College of St. Benedict and St. John's University, Collegeville, MN 56321, USA"}]},{"given":"Hassan","family":"Najadat","sequence":"additional","affiliation":[{"name":"Computer Information Systems Department, Jordan University of Science and Technology, P.O. Box 3030 Irbid, 22110, Jordan"}]},{"given":"William","family":"Perrizo","sequence":"additional","affiliation":[{"name":"IACC 258 A15, Computer Science Department, North Dakota State University, Fargo, ND 58105, USA"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","volume-title":"Introduction to Support Vector Machines","author":"Cristianini N.","year":"2002"},{"key":"rf3","volume-title":"Data Mining: Concepts and Techniques","author":"Han J.","year":"2006"},{"key":"rf5","first-page":"419","volume":"2","author":"Lodhi H.","journal-title":"Journal of Machine Learning Research"},{"key":"rf8","first-page":"262","volume":"11","author":"Rahal I.","journal-title":"ISCA International Journal of Computers and Their Applications (IJCTA)"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(88)90021-0"},{"key":"rf10","volume-title":"Introduction to Modern Information Retrieval","author":"Salton G.","year":"1983"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1145\/361219.361220"}],"container-title":["Journal of Information &amp; Knowledge Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S021964920600144X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T23:28:33Z","timestamp":1565134113000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S021964920600144X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9]]},"references-count":7,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2006,9]]}},"alternative-id":["10.1142\/S021964920600144X"],"URL":"https:\/\/doi.org\/10.1142\/s021964920600144x","relation":{},"ISSN":["0219-6492","1793-6926"],"issn-type":[{"value":"0219-6492","type":"print"},{"value":"1793-6926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,9]]}}}