A correspondence between maximal complete bipartite subgraphs and closed patterns

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3721 LNAI, Issue , 2005, Pages 146-156

  Li, Jinyan ^a   Li, Haiquan ^a   Soh, Donny ^a   Wong, Limsoon ^a  

^a INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA MINING; MATHEMATICAL TECHNIQUES; MATRIX ALGEBRA; PATTERN RECOGNITION;

BIPARTITE SUBGRAPHS; CLOSED PATTERNS; VERTEX SETS;

GRAPH THEORY;

EID: 33646425029     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564126_18     Document Type: Conference Paper

References (20)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM-SIGMOD International Conference on Management of Data, pages 207-216, Washington, D.C., May 1993. ACM Press.
2. Yves Bastide, Nicolas Pasquier, Rafik Taouil, Gerd Stumme, and Lotfi Lakhal. Mining minimal non-redundant association rules using frequent closed itemsets. Computational Logic, pages 972-986, 2000.
3. B. J. Breitkreutz, C. Stark, and M. Tyers. The grid: The general repository for interaction datasets. Genome Biology, 4(3):R23, 2003.
4. Andrei Z. Broder, Ravi Kumar, Farzin Maghoul, Prabhakar Raghavan, Sridhar Rajagopalan, Raymie Stata, Andrew Tomkins, and Janet L. Wiener. Graph structure in the web. Computer Networks, 33(1-6):309-320, 2000.
5. David Eppstein. Arboricity and bipartite subgraph listing algorithms. Information Processing Letters, 51:207-211, 1994.
6. Bart Goethals and Mohanned J. Zaki. FIMI'03: Workshop on frequent itemset mining implementations. In Third IEEE International Conference on Data Mining Workshop on Frequent Itemset Mining Implementations, pages 1-13, 2003.
7. Gosta Grahne and Jianfei Zhu. Efficiently using prefix-trees in mining frequent itemsets. In Proceedings of FIMI'03: Workshop on Frequent Itemset Mining Implementations, 2003.
8. Jonathan L. Gross and Jay Yellen. Handbook of Graph Theory. CRC Press, 2004.
9. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, and Andrew Tomkins. Trawling the web for emerging cyber-communities. Computer Networks, 31(11-16):1481-1493, 1999.
10. Kazuhisa Makino and Takeaki Uno. New algorithms for enumerating all maximal cliques. In Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT 2004), pages 260-272. Springer-Verlag, 2004.
11. Sergei Maslov and Kim Sneppen. Specificity and stability in topology of protein networks. Science, 296:910-913, 2002.
12. Tsuyoshi Murata. Discovery of user communities from web audience measurement data. In Proceedings of The 2004 IEEE/WIC/ACM International Conference on Web Intelligence (WI 2004), pages 673-676, 2004.
13. Nicolas Pasquier, Yves Bastide, Rafik Taouil, and Lotfi Lakhal. Discovering frequent closed itemsets for association rules. In Proceedings of the 7th International Conference on Database Theory (ICDT), pages 398-416, 1999.
14. D. J. Reiss and B. Schwikowski. Predicting protein-peptide interactions via a network-based motif sampler. Bioinformatics (ISMB 2004 Proceedings), 20 (suppl.):i274-i282, 2004.
15. A. H. Tong, B. Drees, G Nardelli, G. D. Bader, B. Brannetti, L. Castagnoli, M. Evangelista, S. Ferracuti, B. Nelson, S. Paoluzi, M. Quondam, A. Zucconi, C. W. Hogue, S. Fields, C. Boone, and G. Cesareni. A combined experimental and computational strategy to define protein interaction networks for peptide recognition modules. Science, 295:321-324, 2002.
16. Takiake Uno, Masashi Kiyomi, and Hiroaki Arimura. LCM ver.2: Efficient mining algorithms for frequent/closed/maximal itemsets. In IEEE ICDM'04 Workshop FIMI'04 (International Conference on Data Mining, Frequent Itemset Mining Implementations), 2004.
17. J. Wang, Jiawei Han, and Jian Pei. CLOSET+: Searching for the best strategies for mining frequent closed itemsets. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'03), Washington, DC, USA, pages 236-245, 2003.
18. Takashi Washio and Hiroshi Motoda. State of the art of graph-based data mining. SIGKDD Explorations, 5(1):59-68, 2003.
19. Mohammed Javeed Zaki and Ching-Jiu Hsiao. CHARM: An efficient algorithm for closed itemset mining. In Proceedings of the Second SIAM International Conference on Data Mining, 2002.
20. Mohammed Javeed Zaki and Mitsunori Ogihara. Theoretical foundations of association rules. In Proc. 3rd SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 1998.