Clustering Boolean tensors

Data Mining and Knowledge Discovery

Volumn 29, Issue 5, 2015, Pages 1343-1373

  Metzler, Saskia ^a   Miettinen, Pauli ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Approximation; Boolean algebra; Clustering; Decomposition; Tensors

Indexed keywords

ALGEBRA; ALGORITHMS; APPROXIMATION ALGORITHMS; BINS; BOOLEAN ALGEBRA; COMPLEX NETWORKS; DECOMPOSITION; FACTORIZATION; MATRIX ALGEBRA; TENSORS; VIRTUAL REALITY;

APPROXIMATION; BINARY FACTORIZATION; CLUSTERING; CLUSTERING PROBLEMS; FRIENDSHIP NETWORKS; MATRIX FACTORIZATIONS; OVERLAPPING COMPONENTS; TENSOR FACTORIZATION;

CLUSTERING ALGORITHMS;

EID: 84939566798     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-015-0420-3     Document Type: Article

References (38)

1. Alon N, Sudakov B (1999) On two segmentation problems. J Algorithm 33:173–184
2. Bělohlávek R, Glodeanu C, Vychodil V (2012) Optimal factorization of three-way binary data using triadic concepts. Order 30(2):437–454
3. Cantador I, Brusilovsky P, Kuflik T (2011) 2nd Workshop on Information Heterogeneity and Fusion in Recommender Systems (HetRec ’11). In: 5th ACM Conference on Recommender Systems (RecSys’11)
4. Carroll JD, Chang JJ (1970) Analysis of individual differences in multidimensional scaling via an N-way generalization of “Eckart-Young” decomposition. Psychometrika 35(3):283–319
5. Cerf L, Besson J, Robardet C, Boulicaut JF (2009) Closed patterns meet n-ary relations. ACM Trans Knowl Discov Data 3(1):1
6. Cerf L, Besson J, Nguyen KNT, Boulicaut JF (2013) Closed and noise-tolerant patterns in n-ary relations. Data Min Knowl Discov 26(3):574–619
7. Chi EC, Kolda TG (2012) On tensors, sparsity, and nonnegative factorizations. SIAM J Matrix Anal Appl 33(4):1272–1299
8. Dagum L, Menon R (1998) OpenMP: an industry standard API for shared-memory programming. IEEE Comput Sci Eng Mag 5(1):46–55
9. Erdős D, Miettinen P (2013a) Discovering facts with boolean tensor tucker decomposition. In: 22nd ACM International Conference on Information & Knowledge Management (CIKM ’13), pp 1569–1572
10. Erdős D, Miettinen P (2013b) Walk’n’Merge: a scalable algorithm for Boolean tensor factorization. In: 13th IEEE International Conference on Data Mining (ICDM ’13), pp 1037–1042
11. Harshman RA (1970) Foundations of the PARAFAC procedure: models and conditions for an “explanatory” multimodal factor analysis. Tech. Rep. 16, UCLA Working Papers in Phonetics
12. Huang H, Ding C, Luo D, Li T (2008) Simultaneous tensor subspace selection and clustering: the equivalence of high order SVD and k-means clustering. In: 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD ’08), pp 327–335
13. Ignatov DI, Kuznetsov SO, Magizov RA, Zhukov LE (2011) From triconcepts to triclusters. In: 13th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing (RSFDGrC ’11), pp 257–264
14. Jegelka S, Sra S, Banerjee A (2009) Approximation algorithms for tensor clustering. In: International Conference on Algorithmic Learning Theory (ALT ’09), pp 368–383
15. Jiang P (2014) Pattern extraction and clustering for high-dimensional discrete data. PhD thesis, University of Illinois at Urbana-Champaign
16. Kim M, Candan KS (2011) Approximate tensor decomposition within a tensor-relational algebraic framework. In: 20th ACM International Conference on Information & Knowledge Management (CIKM ’11), pp 1737–1742
17. Kim M, Candan KS (2012) Decomposition-by-normalization (DBN): leveraging approximate functional dependencies for efficient tensor decomposition. In: 21st ACM International Conference on Information & Knowledge Management (CIKM ’12), pp 355–364
18. Kim M, Candan KS (2014) Pushing-down tensor decompositions over unions to promote reuse of materialized decompositions. In: European Conference on Machine Learning and Knowledge Discovery in Databases (ECML PKDD ’14), pp 688–704
19. Kleinberg J, Papadimitriou C, Raghavan P (1998) A microeconomic view of data mining. Data Min Knowl Discov 2(4):311–324
20. Kleinberg JM, Papadimitriou CH, Raghavan P (2004) Segmentation problems. J ACM 51(2):263–280
21. Kolda TG, Bader BW (2009) Tensor decompositions and applications. SIAM Rev 51(3):455–500
22. Leenen I, Van Mechelen I, De Boeck P, Rosenberg S (1999) INDCLAS: a three-way hierarchical classes model. Psychometrika 64(1):9–24
23. Liu X, De Lathauwer L, Janssens F, De Moor B (2010) Hybrid clustering of multiple information sources via HOSVD. In: 7th International Conference on Advances in Neural Networks—Part II (ISNN ’10), pp 337–345
24. Miettinen P (2009) Matrix Decomposition methods for data mining: computational complexity and algorithms. PhD thesis, Department of Computer Science, University of Helsinki
25. Miettinen P (2010) Sparse Boolean matrix factorizations. In: 10th IEEE International Conference on Data Mining (ICDM ’10), pp 935–940
26. Miettinen P (2011) Boolean tensor factorizations. In: 11th IEEE International Conference on Data Mining (ICDM ’11), pp 447–456
27. Miettinen P, Vreeken J (2014) MDL4BMF: minimum description length for Boolean matrix factorization. ACM Trans Knowl Discov Data 8(4):18
28. Miettinen P, Mielikäinen T, Gionis A, Das G, Mannila H (2008) The discrete basis problem. IEEE Trans Knowl Data Eng 20(10):1348–1362
29. Papadimitriou CH, Steiglitz K (1998) Combinatorial optimization: algorithms and complexity. Dover Publications, Mineola
30. Papalexakis EE, Faloutsos C, Sidiropoulos ND (2012) ParCube: sparse parallelizable tensor decompositions. In: European Conference on Machine Learning and Knowledge Discovery in Databases (ECML PKDD ’12), pp 521–536
31. Papalexakis EE, Sidiropoulos N, Bro R (2013) From K-means to higher-way co-clustering: multilinear decomposition with sparse latent factors. IEEE Trans Signal Process 61(2):493–506
32. Rissanen J (1978) Modeling by shortest data description. Automatica 14(5):465–471
33. Seppänen JK (2005) Upper bound for the approximation ratio of a class of hypercube segmentation algorithms. Inform Process Lett 93(3):139–141
34. Suchanek FM, Kasneci G, Weikum G (2007) Yago: a core of semantic knowledge. In: 16th International Conference on World Wide Web (WWW ’07), pp 697–706
35. Tucker LR (1966) Some mathematical notes on three-mode factor analysis. Psychometrika 31(3):279–311
36. Viswanath B, Mislove A, Cha M, Gummadi KP (2009) On the evolution of user interaction in Facebook. In: 2nd ACM Workshop on Online Social Networks (WOSN ’09), pp 37–42
37. Yates A, Etzioni O (2009) Unsupervised methods for determining object and relation synonyms on the web. J Artif Intell Res 34:255–296
38. Zhao L, Zaki MJ (2005) TRICLUSTER: an effective algorithm for mining coherent clusters in 3D microarray data. In: ACM SIGMOD International Conference on Management of Data (SIGMOD ’05), pp 694–705