Banded structure in binary matrices

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

Volumn , Issue , 2008, Pages 292-300

  Garriga, Gemma C ^a   Junttila, Esa ^b   Mannila, Heikki ^b  

^a HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

^b UNIVERSITY OF HELSINKI   (Finland)

Author keywords

0 1 data; Banded matrices; Consecutive ones property

Indexed keywords

0-1 DATA; ALGORITHMIC PROBLEMS; BANDED MATRICES; BANDED STRUCTURES; BINARY MATRICES; CONSECUTIVE ONES PROPERTY; FORMAL DEFINITIONS; HUMAN GENOMES; IN NETWORKS; MATRIXES; OTHER APPLICATIONS; OVERLAPPING COMMUNITIES; PHYSICAL MAPPINGS; REAL DATA SETS; SHORT DISTANCES; SUBMATRIX;

INFORMATION MANAGEMENT; MINING;

MATRIX ALGEBRA;

EID: 65449172918     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1401890.1401929     Document Type: Conference Paper

References (22)

1. R. Agrawal, T. Imieliński, and A.Swami. Mining association rules between sets of items in large databases. In SIGMOD '93, pages 207-216, 1993.
2. F. Alizadeh, R. M. Karp, L. A. Newberg, and D. K. Weisser. Physical mapping of chromosomes: A combinatorial problem in molecular biology. Algorithmica, 13(1/2) :52-76, 1995.
3. J. Atkins, E. Boman, and B. Hendrickson. A spectral algorithm for seriation and the consecutive ones problem. SIAM J. Comput, 28(1):297-310, 1999.
4. C. Aykanat, A. Pinar, and U. Çatalyürek. Permuting sparse rectangular matrices into block-diagonal form. SIAM J. Sci. Comput., 25(6):1860-1879, 2004.
5. R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison Wesley, 1999.
6. A. Banerjee, C. Krumpelman, J. Ghosh, S. Basu, and R. Mooney. Model-based overlapping clustering. In KDD '05, pages 532-537, 2005.
7. K. S. Booth. PQ-tree algorithms. PhD thesis, 1975.
8. P. Burzyn, F. Bonomo, and G. Durán. NP-completeness results for edge modification
9. problems. Disc. Appl. Math., 154(13):1824-1844, 2006.
10. T. Cormen, C. Leiserson, and R. Rivest. Introduction to algorithms. MIT Press and McGraw-Hill, 1990.
11. E. Cuthill and J. McKee. Reducing the bandwidth of sparse symmetric matrices. In Proceedings of the 1969 24th national conference, pages 157-172, 1969.
12. M. Fortelius. Neogene of the old world database of fossil mammals (NOW). http://www.helsinki.fi/science/now/, 2008.
13. K. K. Puolamäki, M. Fortelius, and H. Mannila. Seriation in paleontological data using Markov chain Monte Carlo methods. PLoS Comput Biol, 2, 2006.
14. I.-J. Lin and D. B. West. Interval digraphs that are indifference digraphs. In Graph theory, Combinatorics, and Algorithms, pages 751-765, 1992.
15. H. Mannila and E. Terzi. Nestedness and segmented nestedness. In KDD '07, pages 480-489, 2007.
16. R. M. McConnell. A certifying algorithm for the consecutive-ones property. In SODA '04, pages 768-777, 2004.
17. S. Myllykangas, J. Himberg, T. Böhling, B. Nagy, J. Hollmén, and S. Knuutila. Dna copy number amplification profiling of human neoplasms. Oncogene, 25:7324-7332, 2006.
18. C. H. Papadimitriou. The NP-completeness of the bandwidth minimization problem. Computing, 16:263-270, 1976.
19. F. S. Roberts. Indifference graphs. In Proof Techniques in Graph Theory, pages 139-146, 1969.
20. R. Rosen. Matrix bandwidth minimization. In ACM national conference, pages 585-595, 1968.
21. M. Sen and B. K. Sanyal. Indifference digraphs: A generalization of indifference graphs and semiorders. SIAM J. Discret. Math., 7(2):157-165, 1994.
22. A. Tucker. A structure theorem for the consecutive 1's property. Journal of Combinatorial Theory, Series B, 12(2):153-162, 1972.