An optimal record retrieval technique in text mining using GSO-based prefix span algorithm and improved K-means Online publication date: Sun, 29-Jan-2017
by Arumugam Rajesh Kumar; R. Sasikala; A.M. Kalpana
International Journal of Business Intelligence and Data Mining (IJBIDM), Vol. 11, No. 3, 2016
Abstract: The data mining, nowadays, has surfaced as an investigative procedure devoted to the exploration of the data in the hunt for the reliable patterns or methodical associations between the variables. In the current investigation, an earnest effort made to employ an effective hybrid clustering approach to cluster the record and regain the record in accordance with the pattern mining. The novel technique consists of two vital steps such as the training and testing stages. In the training stage, the closed itemsets of each record are extorted by means of the support values, paving the way for the incredible decrease in the error making items. In the testing stage, the records having identical or approximately identical weights are clustered by means of the hybrid K-means-GSO clustering algorithm. Consequently, records at the apex of rank list are regained from the testing stage. The epoch-making technique is performed in the Java platform.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Business Intelligence and Data Mining (IJBIDM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com