Please use this identifier to cite or link to this item: https://idr.l2.nitk.ac.in/jspui/handle/123456789/12190
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKanimozhi, K.V.
dc.contributor.authorRajakumarkrishnan
dc.contributor.authorVenkatesan, M.
dc.date.accessioned2020-03-31T08:38:46Z-
dc.date.available2020-03-31T08:38:46Z-
dc.date.issued2019
dc.identifier.citationInternational Journal of Recent Technology and Engineering, 2019, Vol.8, 2 Special Issue 11, pp.3970-3975en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/12190-
dc.description.abstractDue to fast growth of internet and continuous expansion of World Wide Web like digital libraries, online news contributes to massive amount of electronic unstructured text documents on the web. Although lot traditional techniques are available to extract the knowledge from large collection of text documents, still to improve precision of the web search retrieval and to find most appropriate documents from huge text collections proficiently is a big challenge. Clustering techniques helps the search engine to retrieve the documents. The proposed system overcomes existing problems using bivariate n-gram frequent item clustering algorithm by concept of maximum frequent set which maintain the sequence and meaning of sentence in order to reduce huge dimension and and frequent item sets finds similarity. Then based on maximum document occurrence we cluster the documents. Thus our method obtains quality of clusters when compared with existing methodologies and improves the efficiency. The experiment is shown for sample Newsgroup dataset for existing K-Mean and FICMDO (Frequent item clustering method based on maximum document occurrence) and proved the f-measure is higher for our algorithm. Since the f-measure increases, obtains efficient clusters. Hence it is faster and efficient big data method which improves the performance when compared with vector space model like K-Means algorithm. BEIESP.en_US
dc.titleMaximum frequent item set based clustering algorithm for big text dataen_US
dc.typeArticleen_US
Appears in Collections:1. Journal Articles

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.