Mining quantitative maximal hyperclique patterns: A summary of results

6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Hyperclique patterns are groups of objects which are strongly related to each other. Indeed, the objects in a hyperclique pattern have a guaranteed level of global pairwise similarity to one another as measured by uncentered Pearson's correlation coefficient. Recent literature has provided the approach to discovering hyperclique patterns over data sets with binary attributes. In this paper, we introduce algorithms for mining maximal hyperclique patterns in large data sets containing quantitative attributes. An intuitive and simple solution is to partition quantitative attributes into binary attributes. However, there is potential information loss due to partitioning. Instead, our approach is based on a normalization scheme and can directly work on quantitative attributes. In addition, we adopt the algorithm structures of three popular association pattern mining algorithms and add a critical clique pruning technique. Finally, we compare the performance of these algorithms for finding quantitative maximal hyperclique patterns using some real-world data sets. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Huang, Y., Xiong, H., Wu, W., & Sung, S. Y. (2006). Mining quantitative maximal hyperclique patterns: A summary of results. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3918 LNAI, pp. 552–556). https://doi.org/10.1007/11731139_65

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free