Fragments of order

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

Volumn , Issue , 2003, Pages 129-136

  Gionis, Aristides ^a   Kujala, Teija ^b   Mannila, Heikki ^b  

^a Stanford University   (United States)

^b UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Consecutive ones property; Discovering hidden orderings; Novel data mining algorithms; Spectral analysis of data

Indexed keywords

CONSECUTIVE ONES PROBLEM; CONSECUTIVE ONES PROPERTY; DATA COLLECTION; DATA MINING ALGORITHM; DATA SETS; HIGH-DIMENSIONAL; NOISE LEVELS; OBSERVED DATA; PARTIAL ORDER; REAL DATA SETS; SIMPLE AND EFFICIENT ALGORITHMS; SPECTRAL ALGORITHM; SPECTRAL ANALYSIS;

ALGORITHMS; DATA MINING; SPECTRUM ANALYSIS; SPECTRUM ANALYZERS;

DATA HANDLING;

EID: 33745037411     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/956750.956768     Document Type: Conference Paper

References (20)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In P. Buneman and S. Jajodia, editors, Proceedings of ACM SIGMOD Conference on Management of Data (SIGMOD'93), pages 207-216, Washington, D. C., USA, May 1993. ACM.
2. R. Agrawal and R. Srikant. Mining sequential patterns. In Proceedings of the Eleventh International Conference on Data Engineering (ICDE'95), pages 3-14, Taipei, Taiwan, Mar. 1995.
3. J. E. Atkins, E. G. Boman, and B. Hendrickson. A spectral algorithm for seriation and the consecutive ones problem. SIAM Journal on Computing, 28 (1):297-310, Feb. 1999.
4. K. S. Booth and G. S. Lueker. Linear algorithms to recognize interval graphs and test for the consecutive ones property. In ACM, editor, Conference record of Seventh Annual ACM Symposium on Theory of Computing: papers presented at the Symposium, Albuquerque, New Mexico, May 5-May 7, 1975, pages 255-265, New York, NY, USA, 1975. ACM Press.
5. K. S. Booth and G. S. Lueker. Testing for the consecutive ones property, interval graphs, and graph planarity using P-Q tree algorithms. J. of Comp. and Syst. Sci., 13:335-379, 1976.
6. T. F. Chan and D. C. Resasco. A framework for the analysis and construction of domain decomposition preconditioners. Technical Report CAM-87-09, UCLA, 1987.
7. F. R. K. Chung. Spectral Graph Theory. CBMS Regional Conference Series in Mathematics, 1997.
8. R. Durbin, S. Eddy, A. Krogh, and G. Mitchison. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, Cambridge, 1998.
9. M. Fortelius. Private communication. 2003.
10. J. Han and M. Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann, 2000.
11. Hsu. A simple test for the consecutive ones property. Journal of Algorithms, 43, 2002.
12. J. Jernvall and M. Fortelius. Common mammals drive the evolutionary increase of hypsodonty in the neogene. Nature, 417:538-540, 2002.
13. Y. Koren and D. Harel. Multi-scale algorithm for the linear arrangement problem. Technical Report MCS02-04, Faculty of Mathematics and Computer Science, The Weizmann Institute of Science, 2002.
14. H. Mannila and C. Meek. Global partial orders from sequential data. In Proceedings of the sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), Boston, MA, pages 161-168. ACM Press, 2000.
15. H. Mannila, H. Toivonen, and A. I. Verkamo. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery, 1 (3):259-289, Nov. 1997. (Pubitemid 127721244)
16. A. Ng, M. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In In Advances in Neural Information Processing Systems, 2001.
17. A. Popescul, G. W. Flake, S. Lawrence, L. H. Ungar, and C. L. Giles. Clustering and identifying temporal trends in document databases. In ADL 2000, pages 173-182, 2000.
18. A. Pothen, H. Simon, and L. Wang. Spectral nested dissection. Technical Report CS-92-01, Pennsylvania State University, Department of Computer Science, 1992.
19. R. Ramakrishnan and J. Gehrke. Database Management Systems (2nd ed.). McGraw-Hill, 2001.
20. H. D. Simon. Partitioning of unstructured mesh problems for parallel processing. Computing Systems in Engineering, 2, 1991.