Frequent pattern sub-space clustering optimisation algorithm for data mining from large database Online publication date: Thu, 07-Dec-2017
by T. Sheik Yousuf; M. Indra Devi
International Journal of Business Intelligence and Data Mining (IJBIDM), Vol. 13, No. 1/2/3, 2018
Abstract: Data mining environment gives a quick response to the user by fast and correctly pick-out the item from the large database is a very challenging task. Previously, multiple algorithms were proposed to identify the frequent item since they are scanning database at multiple times. To overcome those problems, we proposed Rehashing based Apriori Technique in which hashing technology is used to store the data in horizontal and vertical formats. Rehash Based Apriori uses hashing function to reduce the size of candidate item set and scanning of database, eliminate non-frequent items and avoid hash collision. After finding frequent item sets, perform level wise subspace clustering. We instigate generalised self organised tree based (GSTB) mechanism to adaptively selecting root to construct the path from the cluster head to neighbours when constructing the tree. Our experimental results show that our proposed mechanisms reduce the computational time of overall process.
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
Our Blog 
Follow us on Twitter 
Visit us on Facebook