2013 RedundancyAwareMaximalCliques
- (Wang et al., 2013) ⇒ Jia Wang, James Cheng, and Ada Wai-Chee Fu. (2013). “Redundancy-aware Maximal Cliques.” In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ISBN:978-1-4503-2174-7 doi:10.1145/2487575.2487689
Subject Headings:
Notes
Cited By
- http://scholar.google.com/scholar?q=%222013%22+Redundancy-aware+Maximal+Cliques
- http://dl.acm.org/citation.cfm?id=2487575.2487689&preflayout=flat#citedby
Quotes
Author Keywords
- Clique concise representation; clique summarization; data mining; graph algorithms; maximal clique enumeration
Abstract
Recent research efforts have made notable progress in improving the performance of (exhaustive) maximal clique enumeration (MCE). However, existing algorithms still suffer from exploring the huge search space of MCE. Furthermore, their results are often undesirable as many of the returned maximal cliques have large overlapping parts. This redundancy leads to problems in both computational efficiency and usefulness of MCE.
In this paper, we aim at providing a concise and complete summary of the set of maximal cliques, which is useful to many applications. We propose the notion of Ï - [[visible MCE to achieve this goal and design algorithms to realize the notion. Based on the refined output space, we further consider applications including an efficient computation of the top - k results with diversity and an interactive clique exploration process. Our experimental results demonstrate that our approach is capable of producing output of high usability and our algorithms achieve superior efficiency over classic MCE algorithms.
References
;
| Author | volume | Date Value | title | type | journal | titleUrl | doi | note | year | |
|---|---|---|---|---|---|---|---|---|---|---|
| 2013 RedundancyAwareMaximalCliques | Ada Wai-Chee Fu James Cheng Jia Wang | Redundancy-aware Maximal Cliques | 10.1145/2487575.2487689 | 2013 |