Open Access Open Access  Restricted Access Subscription or Fee Access

Quality Depth-First Closed Itemsets (DCI_Closure) Associator

M. Sakthi Ganesh, Dr. C. Kalairasan, R. Shalini, Dr. V. D. Mytri

Abstract


The objective of this thesis work is to design an efficient Data Mining algorithm to extract the data efficiently from the transactional database. There are different algorithms available to mine the data from databases. We propose a new Data Mining Algorithm named DCI_CLOSURE ALGORITHM using Association rules for discovering closed frequent Itemsets. DCI_CLOSURE Algorithm is an extension of DCI_CLOSED Algorithm with Association Rules, Efficient Lattices and Hash Map. This algorithm adopts several optimization techniques to save the storage space as well as extraction time in computing itemset closures and their support value. The proposed algorithm, which unlike other previous proposals does not scan the whole data set. We are going to eliminate single Itemsets by the purpose we need only pair of items so we reduce the single itemset and calculate number of itemset through the formula 2n – (n+1).


Keywords


Depth-First, DCI Closure Associator Algorithm, Lattice Structure.

Full Text:

PDF

References


R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules,” Proc. 20th Int’l Conf. Very Large Data Bases, Sept. 1994.

J.-F. Boulicaut, A. Bykowski, and C. Rigotti, “Approximation of Frequency Queries by Means of Free-Sets,”, Sept. 2000.

M.J. Zaki, “Mining Non-Redundant Association Rules,” Data Mining and Knowledge Discovery, vol. 9, no. 3, pp. 223-248, 2004.

M.J. Zaki and K. Gouda, “Fast Vertical Mining Using Diffsets,” Proc.Ninth ACM SIGKDD Int’l Conf. Knowledge Discovery and Data Mining,Aug. 2003.

M.J. Zaki and C.-J. Hsiao, “Charm: An Efficient Algorithm for Closed Itemsets Mining,” Proc. Second SIAM Int’l Conf. Data Mining, Apr. 2002.

G. Grahne and J. Zhu, “Efficiently Using Prefix-Trees in Mining Frequent Itemsets,” Proc. ICDM Workshop Frequent Itemset Mining Implementations, Dec. 2003.

A. Bykowski and C. Rigotti, “A Condensed Representation to Find Frequent Patterns,” Proc. 20th ACM Symp. Principles of Database Systems, May 2001.

T. Calders and B. Goethals, “Mining All Non-Derivable Frequent Itemsets,” Proc. Sixth European Conf. Principles and Practice of Knowledge Discovery in Databases, Aug. 2002.

B. Goethals and M.J. Zaki, “Advances in Frequent Itemset Mining Implementations: Report on Fimi ’03,” SIGKDD Explorations, 2004.

J. Han, J. Pei, and Y. Yin, “Mining Frequent Patterns without Candidate Generation,” Proc. 2000 ACM SIGMOD Int’l Conf., May 2000.

www.cs.rpi.edu/~Zaki/papers.html

www.icgst.com

www.cs.sfu.ca/~han


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.