Multi-way set enumeration in weight tensors

Machine Learning

Volumn 82, Issue 2, 2011, Pages 123-155

  Georgii, Elisabeth ^a,b   Tsuda, Koji ^c,d   Schölkopf, Bernhard ^a  

^a MAX PLANCK INSTITUTE FOR BIOLOGICAL CYBERNETICS   (Germany)

^b FRIEDRICH MIESCHER LABORATORY OF THE MAX PLANCK SOCIETY   (Germany)

^c NATIONAL INSTITUTE OF ADVANCED INDUSTRIAL SCIENCE AND TECHNOLOGY AIST   (Japan)

^d JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

Dense pattern enumeration; Graph mining; Multi way set; N ary relation; Quasi hyper clique; Tensor

Indexed keywords

DENSE PATTERNS; GRAPH MINING; MULTI-WAY SET; N-ARY RELATION; QUASI-HYPER-CLIQUE;

TENSORS;

EID: 79851510909     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-010-5210-y     Document Type: Article

References (53)

1. E. Acar C. Aykut-Bingol H. Bingol R. Bro B. Yener 20 (Pubitemid 47244381)
2. Acar, E., Çamtepe, S., & Yener, B. (2006). Collective sampling and analysis of high order tensors for chatroom communications. In Intelligence and security informatics (pp. 213-224). Berlin: Springer. (Pubitemid 44045570)
3. Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules in large databases. In VLDB '94: Proceedings of the 20th international conference on very large data bases (pp. 487-499). San Mateo: Morgan Kaufmann.
4. Y. Asahiro K. Iwama H. Tamaki T. Tokuyama 2000 Greedily finding a dense subgraph Journal of Algorithms 34 2 203 221 0958.68132 10.1006/jagm.1999.1062 1734799
5. M. Ashburner C. A. Ball J. A. Blake D. Botstein H. Butler J. M. Cherry A. P. Davis K. Dolinski S. S. Dwight J. T. Eppig M. A. Harris D. P. Hill L. Issel-Tarver A. Kasarskis S. Lewis J. C. Matese J. E. Richardson M. Ringwald G. M. Rubin G. Sherlock 2000 Gene ontology: tool for the unification of biology Nature Genetics 25 1 25 29 10.1038/75556 (Pubitemid 30257031)
6. D. Avis K. Fukuda 1996 Reverse search for enumeration Discrete Applied Mathematics 65 21 46 0854.68070 10.1016/0166-218X(95)00026-N 1380066 (Pubitemid 126386259)
7. G. D. Bader C. W. Hogue 2003 An automated method for finding molecular complexes in large protein interaction networks BMC Bioinformatics 4 2 10.1186/1471-2105-4-2 (Pubitemid 38751268)
8. S. E. Baranzini P. Mousavi J. Rio S. J. Caillier A. Stillman P. Villoslada M. M. Wyatt M. Comabella L. D. Greller R. Somogyi X. Montalban J. R. Oksenberg 2004 Transcription-based prediction of response to IFNβ using supervised computational methods PLoS Biology 3 1 e2 10.1371/journal.pbio. 0030002
9. C. F. Beckmann S. M. Smith 2005 Tensorial extensions of independent component analysis for multisubject FMRI analysis Neuroimage 25 1 294 311 10.1016/j.neuroimage.2004.10.043 (Pubitemid 40289157)
10. G. Bejerano N. Friedman N. Tishby 2004 Efficient exact p-value computation for small sample, sparse, and surprising categorical data Journal of Computational Biology 11 5 867 886 (Pubitemid 39488541)
11. Besson, J., Robardet, C., De Raedt, L., & Boulicaut, J. F. (2006). Mining bi-sets in numerical data. In Lecture notes in computer science : Vol. 4747. KDID '06: Knowledge discovery in inductive databases, fifth international workshop (pp. 11-23). Berlin: Springer.
12. Borgwardt, K. M., Kriegel, H. P., & Wackersreuther, P. (2006). Pattern mining in frequent dynamic subgraphs. In ICDM '06: Proceedings of the sixth international conference on data mining (pp. 818-822). Los Alamitos: IEEE Comput. Soc.
13. Cerf, L., Besson, J., Robardet, C., & Boulicaut, J. F. (2008). Data peeler: contraint-based closed pattern mining in n-ary relations. In SDM '08: Proceedings of the SIAM international conference on data mining (pp. 37-48).
14. A. C. Culhane T. Schwarzl R. Sultana K. C. Picard S. C. Picard T. H. Lu K. R. Franklin S. J. French G. Papenhausen M. Correll J. Quackenbush 2010 GeneSigDB-a curated database of gene expression signatures Nucleic Acids Research 38 suppl 1 D716 D725 10.1093/nar/gkp1015
15. L. Everett L. S. Wang S. Hannenhalli 2006 Dense subgraph computation via stochastic search: application to detect transcriptional modules Bioinformatics 22 14 e117 e123 10.1093/bioinformatics/btl260 (Pubitemid 44288279)
16. I. J. Farkas D. Abel G. Palla T. Vicsek 2007 Weighted network modules New Journal of Physics 9 180 10.1088/1367-2630/9/6/180 (Pubitemid 47159637)
17. A. P. Gasch P. T. Spellman C. M. Kao O. Carmel-Harel M. B. Eisen G. Storz D. Botstein P. O. Brown 2000 Genomic expression programs in the response of yeast cells to environmental changes Molecular Biology of the Cell 11 12 4241 4257
18. E. Georgii S. Dietmann T. Uno P. Pagel K. Tsuda 2009 Enumeration of condition-dependent dense modules in protein interaction networks Bioinformatics 25 7 933 940 10.1093/bioinformatics/btp080
19. Georgii, E., Tsuda, K., & Schölkopf, B. (2009b). Multi-way set enumeration in real-valued tensors. In DMMT '09: Proceedings of the second workshop on data mining using matrices and tensors (pp. 32-41). New York: ACM.
20. L. A. Goldberg 1992 Efficient algorithms for listing unlabeled graphs Journal of Algorithms 13 1 128 143 0770.68059 10.1016/0196-6774(92)90009-2 1146336
21. Han, J., & Kamber, M. (2006). The Morgan Kaufmann series data management systems. Data mining: concepts and techniques. San Mateo: Morgan Kaufmann.
22. Haraguchi, M., & Okubo, Y. (2006). A method for pinpoint clustering of web pages with pseudo-clique search. In Lecture notes in computer science : Vol. 3847. Federation over the Web (pp. 59-78). Berlin: Springer. (Pubitemid 43900805)
23. Höppner, F., Klawonn, F., Kruse, R., & Runkler, T. (1999). Fuzzy cluster analysis: methods for classification, data analysis and image recognition. New York: Wiley.
24. H. Hu X. Yan Y. Huang J. Han X. J. Zhou 2005 Mining coherent dense subgraphs across massive biological networks for functional discovery Bioinformatics 21 suppl-1 i213 i221 10.1093/bioinformatics/bti1049 (Pubitemid 41794492)
25. Jaschke, R., Hotho, A., Schmitz, C., Ganter, B., & Stumme, G. (2006). TRIAS-an algorithm for mining iceberg tri-lattices. In ICDM '06: Proceedings of the sixth international conference on data mining (pp. 907-911). Los Alamitos: IEEE Comput. Soc.
26. Jegelka, S., Sra, S., & Banerjee, A. (2009). Approximation algorithms for tensor clustering. In Algorithmic learning theory (pp. 368-383).
27. L. Ji K. L. Tan A. K. H. Tung 2006 Mining frequent closed cubes in 3D datasets VLDB '06: Proceedings of the thirty-second international conference on very large data bases VLDB Endowment/ACM New York 811 822 http://portal.acm.org/ citation.cfm?id=1164197, http://dblp.uni-trier.de/rec/bibtex/conf/vldb/JiTT06
28. D. Jiang J. Pei 2009 Mining frequent cross-graph quasi-cliques ACM Transactions on Knowledge Discovery Data 2 4 1 42 10.1145/1460797.1460799 2547084
29. Kemp, C., Tenenbaum, J. B., Griffiths, T. L., Yamada, T., & Ueda, N. (2006). Learning systems of concepts with an infinite relational model. In AAAI '06: Proceedings of the twenty-first national conference on artificial intelligence (pp. 381-388). Menlo Park: AAAI Press. (Pubitemid 44705314)
30. Klimt, B., & Yang, Y. (2004). The Enron corpus: a new dataset for email classification research. In ECML '04: Proceedings of the 15th european conference on machine learning (pp. 217-226). Berlin: Springer. (Pubitemid 41050094)
31. Kolda, T. G., & Bader, B. W. (2007). Tensor decompositions and applications. Technical Report SAND2007-6702, Sandia National Laboratories.
32. Kolda, T. G., Bader, B. W., & Kenny, J. P. (2005). Higher-order web link analysis using multilinear algebra. In ICDM '05: Proceedings of the fifth IEEE international conference on data mining (pp. 242-249). Los Alamitos: IEEE Comput. Soc. (Pubitemid 47385699)
33. Kolda, T. G., & Sun, J. (2008). Scalable tensor decompositions for multi-aspect data mining. In ICDM '08: Proceedings of the eighth IEEE international conference on data mining (pp. 363-372).
34. M. Koyutürk W. Szpankowski A. Grama 2007 Assessing significance of connectivity and conservation in protein interaction networks Journal of Computational Biology 14 6 747 764 10.1089/cmb.2007.R014 2347290 (Pubitemid 47221815)
35. S. C. Madeira A. L. Oliveira 2004 Biclustering algorithms for biological data analysis: a survey IEEE/ACM Transactions on Computational Biology of Bioinformatics 1 1 24 45 10.1109/TCBB.2004.2
36. N. Mishra D. Ron R. Swaminathan 2004 A new conceptual clustering framework Machine Learning 56 1-3 115 151 1093.68101 10.1023/B:MACH.0000033117. 77257.41
37. M. E. Newman 2006 Modularity and community structure in networks Proceedings of the National Academy of Sciences of United States of America 103 23 8577 8582 10.1073/pnas.0601602103 (Pubitemid 43878062)
38. G. Palla I. Derenyi I. Farkas T. Vicsek 2005 Uncovering the overlapping community structure of complex networks in nature and society Nature 435 7043 814 818 10.1038/nature03607 (Pubitemid 40839731)
39. Robardet, C. (2009). Constraint-based pattern mining in dynamic graphs. In ICDM '09: Proceedings of the ninth IEEE international conference on data mining (pp. 950-955). Los Alamitos: IEEE Comput. Soc.
40. Rymon, R. (1992). Search through systematic set enumeration. In Proceedings of the third international conference on principles of knowledge representation and reasoning (pp. 539-550).
41. S. E. Schaeffer 2007 Graph clustering Computer Science Review 1 1 27 64 10.1016/j.cosrev.2007.05.001 2302548
42. R. Shamir A. Maron-Katz A. Tanay C. Linhart I. Steinfeld R. Sharan Y. Shiloh R. Elkon 2005 EXPANDER-an integrative program suite for microarray data analysis BMC Bioinformatics 6 1 232 10.1186/1471-2105-6-232 (Pubitemid 41548723)
43. V. Spirin L. A. Mirny 2003 Protein complexes and functional modules in molecular networks Proceedings of the National Academy of Sciences of United States of America 100 21 12123 12128 10.1073/pnas.2032324100 (Pubitemid 37271525)
44. Sun, J., Tao, D., & Faloutsos, C. (2006). Beyond streams and graphs: dynamic tensor analysis. In KDD '06: Proceedings of the twelfth ACM SIGKDD international conference on knowledge discovery and data mining (pp. 374-383). New York: ACM. (Pubitemid 44535534)
45. A. Tanay R. Sharan R. Shamir 2002 Discovering statistically significant biclusters in gene expression data Bioinformatics 18 Suppl 1 S136 S144
46. I. Ulitsky R. Shamir 2009 Identifying functional modules using expression profiles and confidence-scored protein interactions Bioinformatics 25 9 1158 1164 10.1093/bioinformatics/btp118
47. Uno, T. (2007). An efficient algorithm for enumerating pseudo cliques. In ISAAC '07: Algorithms and computation, eighteenth international symposium (pp. 402-414).
48. C. Yan J. G. Burleigh O. Eulenstein 2005 Identifying optimal incomplete phylogenetic data sets from sequence databases Molecular Phylogenetics and Evolution 35 3 528 535 10.1016/j.ympev.2005.02.008 (Pubitemid 40607947)
49. Yan, X., & Han, J. (2002). gSpan: graph-based substructure pattern mining. In ICDM '02: Proceedings of the second IEEE international conference on data mining (pp. 721-724). Los Alamitos: IEEE Comput. Soc.
50. Yan, X., Zhou, X. J., & Han, J. (2005). Mining closed relational graphs with connectivity constraints. In KDD '05: Proceedings of the eleventh ACM SIGKDD international conference on knowledge discovery and data mining (pp. 324-333). New York: ACM. (Pubitemid 43218294)
51. Zeng, Z., Wang, J., Zhou, L., & Karypis, G. (2006). Coherent closed quasi-clique discovery from large dense graph databases. In KDD '06: Proceedings of the twelfth ACM SIGKDD international conference on knowledge discovery and data mining (pp. 797-802). New York: ACM. (Pubitemid 44535593)
52. Zhao, L., & Zaki, M. J. (2005). TRICLUSTER: an effective algorithm for mining coherent clusters in 3D microarray data. In SIGMOD '05: Proceedings of the 2005 ACM SIGMOD international conference on management of data (pp. 694-705). New York: ACM. (Pubitemid 43038968)
53. Zhu, F., Yan, X., Han, J., & Yu, P. S. (2007). gPrune: a constraint pushing framework for graph pattern mining. In PAKDD '07: Proceedings of the eleventh Pacific-Asia conference on advances in knowledge discovery and data mining (pp. 388-400). Berlin: Springer.