Mining discrete patterns via binary matrix factorization

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2009, Pages 757-765

  Shen, Bao Hong ^a   Ji, Shuiwang ^a   Ye, Jieping ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

Binary matrix factorization; Integer linear program; Maximum flow; Minimum cut; Rank one; Regularization

Indexed keywords

BINARY MATRIX FACTORIZATION; INTEGER LINEAR PROGRAM; MAXIMUM FLOW; MINIMUM CUT; RANK-ONE; REGULARIZATION;

ALGORITHMS; FACTORIZATION; INTEGER PROGRAMMING; LIGHT MEASUREMENT; LINEAR PROGRAMMING;

MATRIX ALGEBRA;

EID: 70350623326     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1557019.1557103     Document Type: Conference Paper

References (18)

1. Y. Boykov and V. Kolmogorov. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE TPAMI, Sep 2004.
2. G. Dantzig. Maximization of a linear function of variables subject to linear inequalities. In Activity Analysis of Production and Allocation. Wiley, 1951.
3. A. V. Goldberg and R. E. Tarjan. A new approach to the maximum-flow problem. J. ACM, 35(4):921-940, 1988.
4. G. H. Golub and C. F. Van Loan. Matrix Computations. The Johns Hopkins University Press, Baltimore, MD, USA, 3rd edition, 1996.
5. I. Heller and C. B. Tompkins. An extension of a theorem of Dantzig's. Ann. of Math. Stud., no. 38, pages 247-254. 1956.
6. D. S. Hochbaum and A. Pathria. Forest harvesting and minimum cuts: a new approach to handling spatial constraints. Forest Science, 43(4):544-554, 1997.
7. A. J. Hoffman and J. B. Kruskal. Integral boundary points of convex polyhedra. Annals of Mathematics Studies, no. 38, pages 223{246. Princeton University Press, 1956.
8. I. T. Jolliffe. Principal Component Analysis. Springer-Verlag, New York, 1986.
9. J. A. Kelner and D. A. Spielman. A randomized polynomial-time simplex algorithm for linear programming. In ACM STOC 2006, pages 51-60, 2006.
10. L. G. Khachiyan. A polynomial algorithm in linear programming [in russian]. Doklady Akademii Nauk SSSR,244:1093-1096, 1979. English translation: Soviet Mathematics Doklady 20 (1979), 191-194.
11. V. Klee and G. J. Minty. How good is the simplex algorithm? In Inequalities, III, pages 159-175. Academic Press, New York, 1972.
12. T. G. Kolda and D. P. O'Leary. A semidiscrete matrix decomposition for latent semantic indexing information retrieval. ACM Trans. Inf. Syst., 16(4):322-346, 1998.
13. M. Koyutürk and A. Grama. PROXIMUS: a framework for analyzing very high dimensional discrete-attributed datasets. In ACM SIGKDD, pages 147-156, 2003.
14. M. Koyutürk, A. Grama, and N. Ramakrishnan. Compression, clustering, and pattern discovery in very high-dimensional discrete-attribute data sets. IEEE TKDE, 17(4):447-461, April 2005.
15. M. Koyuturk, A. Grama, and N. Ramakrishnan. Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis. ACM Trans. Math. Softw., 32(1):33-69, 2006.
16. K. Nishino, Y. Sato, and K. Ikeuchi. Eigen-texture method: appearance compression based on 3d model. In IEEE CVPR 1999, pages 618-624, 1999.
17. D. A. Spielman and S.-H. Teng. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. Journal of ACM, 51(3):385-463, 2004.
18. M. Turk and A. Pentland. Eigenfaces for recognition. Journal of Cognitive Neuroscience, 3(1):71-86, 1991.