Summary
We propose a new search algorithm for a special type of subspace clusters, called maximal 1-complete regions, from high dimensional binary valued datasets. Our algorithm is suitable for dense datasets, where the number of maximal 1-complete regions is much larger than the number of objects in the datasets. Unlike other algorithms that find clusters only in relatively dense subspaces, our algorithm finds clusters in all subspaces. We introduce the concept of weighted density in order to find interesting clusters in relatively sparse subspaces. Experimental results show that our algorithm is very efficient, and uses much less memory than other algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications, Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data (SIGMOD’98), ACM, New York, June 1998, 94–105.
Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules Between Sets of Items in Large Databases, Proceedings of the 1993 ACM SIGMOD International Conference on Management of data (SIGMOD’93), ACM, New York, May 1993, 207–216.
Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules, Morgan Kaufmann, Los Altos, CA, 1998, 580–592.
Blake, C., Merz, C.: UCI Repository of machine learning databases, http://www.ics.uci.edu/~mlearn/MLRepository.html, 1998.
Ganter, B., Kuznetsov, S.O.: Stepwise Construction of the Dedekind–MacNeille Completion, Proceedings of Sixth International Conference on Conceptual Structures (ICCS’98), August 1998, 295–302.
Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations, Springer, Berlin Heidelberg New York, 1999.
Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering Frequent Closed Itemsets for Association Rules, Proceeding of the Seventh International Conference on Database Theory (ICDT’99), Springer, Berlin Heidelberg New York, January 1999, 398–416.
Peeters, R.: The maximum edge biclique problem is NP-complete, Discrete Applied Mathematics, 131, 2003, 651–654.
Pei, J., Han, J., Mao, R.: CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets, ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, May 2000, 21–30.
Roman, T., Natalie, F., et al.: The COG database: an updated version includes eukaryotes, BMC Bioinformatics, 4, September 2003.
Wang, J., Han, J., Pei, J.: CLOSET+: Searching for the Best Strategies for Mining Frequent Closed Itemsets, Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD’03), ACM, New York, 2003, 236–245.
Zaki, M.J., Hsiao, C.J.: Charm: an Efficient Algorithm for Closed Itemset Mining, Proceedings of the Second SIAM International Conference on Data Mining (SDM’04), April 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bian, H., Bhatnagar, R. (2008). An Algorithm for Mining Weighted Dense Maximal 1-Complete Regions. In: Lin, T.Y., Xie, Y., Wasilewska, A., Liau, CJ. (eds) Data Mining: Foundations and Practice. Studies in Computational Intelligence, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78488-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-78488-3_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78487-6
Online ISBN: 978-3-540-78488-3
eBook Packages: EngineeringEngineering (R0)