Multi-way set enumeration in real-valued tensors

Proceedings of the 2009 Workshop on Data Mining using Matrices and Tensors, DMMT'09 in Conjunction with the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, SIGKDD 2009

Volumn , Issue , 2009, Pages

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

^a MAX PLANCK INSTITUTE FOR BIOLOGICAL CYBERNETICS   (Germany)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

Algorithms

Indexed keywords

ALGORITHMS; MATRIX ALGEBRA; TENSORS;

DIFFERENT DOMAINS; MISSING OBSERVATIONS; REAL-WORLD; REVERSE SEARCH; SEARCH SPACES; SOCIAL STUDY; SPECIFIC SUBSET; WEB MINING;

DATA MINING;

EID: 70549098841     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1581114.1581118     Document Type: Conference Paper

References (24)

1. M. Ashburner, C. A. Ball, J. A. Blake, D. Botstein et al., Gene ontology: tool for the unification of biology. the gene ontology consortium. Nat Genet, 25(1):25-29, 2000.
2. D. Avis and K. Fukuda. Reverse search for enumeration. Discrete Appl. Math., 65:21-46, 1996.
3. G. Bejerano, N. Friedman, and N. Tishby. Efficient exact p-value computation for small sample, sparse, and surprising categorical data. J Comput Biol, 11(5):867-86, 2004.
4. J. Besson, C. Robardet, L. D. Raedt, and J.-F. Boulicaut. Mining bi-sets in numerical data. In S. Dzeroski and J. Struyf, editors, KDID, volume 4747 of Lecture Notes in Computer Science, pages 11-23. Springer, 2006.
5. K. M. Borgwardt, H.-P. Kriegel, and P. Wackersreuther. Pattern mining in frequent dynamic subgraphs. In ICDM 2006, pages 818-822, Washington, DC, USA, 2006. IEEE Computer Society.
6. L. Cerf, J. Besson, C. Robardet, and J.-F. Boulicaut. Data peeler: Contraint-based closed pattern mining in n-ary relations. In SDM, pages 37-48, 2008.
7. A. P. Gasch, P. T. Spellman, C. M. Kao, O. Carmel-Harel, M. B. Eisen, G. Storz, D. Botstein, and P. O. Brown. Genomic Expression Programs in the Response of Yeast Cells to Environmental Changes. Mol. Biol. Cell, 11(12):4241-4257, 2000.
8. E. Georgii, S. Dietmann, T. Uno, P. Pagel, and K. Tsuda. Enumeration of condition-dependent dense modules in protein interaction networks. Bioinformatics, 25(7):933-940, 2009.
9. J. Han and M. Kamber. Data Mining: Concepts and Techniques. The Morgan Kaufmann Series in Data Management Systems. Morgan Kaufmann Publishers, San Francisco, CA, 2nd edition, 2006.
10. H. Hu, X. Yan, Y. Huang, J. Han, and X. J. Zhou. Mining coherent dense subgraphs across massive biological networks for functional discovery. Bioinformatics, 21(suppl 1): i213-221, 2005.
11. R. Jaschke, A. Hotho, C. Schmitz, B. Ganter, and G. Stumme. Trias-an algorithm for mining iceberg tri-lattices. In ICDM 2006, pages 907-911, Washington, DC, USA, 2006. IEEE Computer Society.
12. L. Ji, K.-L. Tan, and A. K. H. Tung. Mining frequent closed cubes in 3d datasets. In VLDB '06, pages 811-822. VLDB Endowment, 2006.
13. D. Jiang and J. Pei. Mining frequent cross-graph quasi-cliques. ACM Trans. Knowl. Discov. Data, 2(4): 1-42, 2009.
14. B. Klimt and Y. Yang. The enron corpus: A new dataset for email classification research. In Machine Learning: ECML 2004, pages 217-226. Springer, 2004.
15. T. G. Kolda and B. W. Bader. Tensor decompositions and applications. Technical Report SAND2007-6702, Sandia National Laboratories, Albuquerque, NM and Livermore, CA, 2007.
16. T. G. Kolda and J. Sun. Scalable tensor decompositions for multi-aspect data mining. In ICDM 2008, pages 363-372, 2008.
17. M. Koyuturk, W. Szpankowski, and A. Grama. Assessing significance of connectivity and conservation in protein interaction networks. J Comput Biol, 14(6):747-64, 2007.
18. S. C. Madeira and A. L. Oliveira. Biclustering algorithms for biological data analysis: A survey. IEEE/ACM Trans. Comput. Biol. Bioinformatics, 1(1):24-45, 2004.
19. R. Shamir, A. Maron-Katz, A. Tanay, C. Linhart et al. Expander - an integrative program suite for microarray data analysis. BMC Bioinformatics, 6(1):232, 2005.
20. J. Sun, D. Tao, and C. Faloutsos. Beyond streams and graphs: dynamic tensor analysis. In KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 374-383, New York, NY, USA, 2006. ACM.
21. T. Uno. An efficient algorithm for enumerating pseudo cliques. In Proceedings of ISAAC 2007, pages 402-414, 2007.
22. X. Yan, X. J. Zhou, and J. Han. Mining closed relational graphs with connectivity constraints. In KDD '05: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, pages 324-333, New York, NY, USA, 2005. ACM.
23. Z. Zeng, J. Wang, L. Zhou, and G. Karypis. Coherent closed quasi-clique discovery from large dense graph databases. In KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 797-802, New York, NY, USA, 2006. ACM.
24. L. Zhao and M. J. Zaki. Tricluster: an effective algorithm for mining coherent clusters in 3d microarray data. In SIGMOD '05, pages 694-705, New York, NY, USA, 2005. ACM.