Open Access Open Access  Restricted Access Subscription or Fee Access

Compressed Theory for Mining Frequent Patterns Using Graphical Technique

Pradeep Chouksey, Fiona Jain

Abstract


Exploring association rules, correlations, clusters and many more theories that make out interactions amongst set of items is frequently studied in data mining research, involves complications in mining the data. Mining from the scratch is the most time consuming operation in this discovery process in the computation of the frequency of occurrences of subset of items in the database of transaction, since the size of each set of transaction may be massive that it makes difficult to perform traditional data mining tasks. This research intends to propose a graph structure that captures only those itemsets that needs to define a sufficiently immense dataset into a submatrix representing important weights and does not give any chance to outliers. We have devised a strategy that covers significant facets of data by drilling down the large data into a succinct form of an Adjacency Matrix at different stages of mining process. The graph structure is so designed that it can be easily maintained and the trade off in compressing the large data values is reduced. This proposed research is an explorative way for regular frequent itemsets with fewer scans.


Keywords


Adjacency Matrix, Directed Graph, Multi level Frequent Patterns, Concept Taxonomy

Full Text:

PDF

References


Han J. and Kamber M., Data mining: concepts and techniques, Morgan. Kaufmann Publishers, San Francisco, CA, 2001.

Fayyad U., Piatetsky-Shapiro G., and Smyth P. Knowledge discovery and data mining: toward a unifying framework. In Proc. 2nd International Conference on Knowledge Discovery and Data Mining (KDD), pages:3-8, Aug. 1996.

Fayyad U., Piatetsky-Shapiro G., Smyth P., and Uthrusamy R. (Eds.).Advances in Knowledge Discovery and Data Mining. AAAI Press, Menlo Park, CA, ISBN:0-262-56097-6, pages: 611, 1996.

[4] M. Zaki, J. Wang, H. Toivonen, BIOKDD 2002: Recent Advances in Data Mining for Bioinformatics, SIGKDD Explorations, Volume 3,Issue 2, pp 71-73, January 2002.

J. Srivastava et al., “Web Usage Mining: Discovery and Applications of Usage Patterns from Web Data,” SIGKDD Explorations, vol. 1, no. 2,2000, pp. 12-23.

M. Xu, L. Wu, Research on Remote Sensing Image Data Mining Prototype System and the RSIDMM-DTM, 0-7803-8742-2/04/$20.00 (C) 2004 IEEE

Zhao P., Di L. Semantic Web Service Based Geospatial Knowledge Discovery. Proceedings of 2006 IEEE International Geoscience and Remote Sensing Symposium. July 31- August 04,2006. Denver,Colorado, USA.

H. Chen, Intelligence and Security Informatics for National Security:Information Sharing and Data Mining, to be published, Springer, 2005.

E. P. Xing, A. Y. Ng, M. I. Jordan, and S. Russell. Distance metric learning, with application to clustering with side-information. In NIPS-15,2003

Brin S., Motwani R., and Silverstein C. Beyond market baskets: generalizing association rules to correlations. In Proc. SIGMOD, pages 265-276, May 1997.

Brin S., Motwani R., Ullman J., and Tsur S. Dynamic itemset counting and implication rules for market basket data. In Proc. SIGMOD, pages 255-264, May 1997.

Gunopulos D., Mannila H., and Saluja S. Discovering all most specific sentences by randomized algorithm. In Proc. International Conference of Database Theory (ICDT), pages 215-229, Jan. 1997.

Han J.and Fu Y. Discovery of multiple-level association rules from large databases. In Proc. 21st VLDB, Sept. pages: 420-431, 1995.

Mannila H. and Toivonen H. Discovering frequent episodes in sequences. In Proc. 1st International Conference on Knowledge Discovery and Data Mining (KDD), pages 210-215, Aug. 1995.

Mannila H.and Toivonen H. Discovering generalized episodes using minimal occurrences. In Proc. 2nd International Conference on Knowledge Discovery and Data Mining (KDD), pages 146-151, Aug.1996.

J. Salazar, M. Robinson, and M. R. Azimi-Sadjadi. A hybrid hmmneural network with gradient descent parameter training. Proceedings IJCNN03,2003.

Ozden B., Ramaswamy S. and Silberschatz A. Cyclic Association Rules. In Proc. 14th International Conference on Data Engineering (ICDE),pages 412-421, Feb.1998.

M. Zhang, B. Kao, D. W. Cheung, and K. Y. Yip. Mining periodic patterns with gap requirement from sequences. SIGMOD, pages June 2005..

P. Felzenszwalb, D. Huttenlocher, and J. Kleinberg. Fast algorithms for large-state-space hmms with applications to web usage analysis. In Advances in Neural Information Processing Systems, 2003.

R.S. Thakur, R.C. Jain, K.R. Pardasani, Graph Theoretic Based Algorithm for Mining Frequent Patterns. In Proc. IEEE World Congress on Computational Intelligence, Hong Kong, pages 629-633, June 2008.


Refbacks

  • There are currently no refbacks.


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