Global partial orders from sequential data

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

Volumn , Issue , 2000, Pages 161-168

  Mannila, Heikki ^b   Meek, Christopher ^a  

^a MICROSOFT RESEARCH   (United States)

^b NONE

Author keywords

Mixture models; Partial orders; Sequence analysis; Time series analysis

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DATABASE SYSTEMS; LEARNING SYSTEMS; TIME SERIES ANALYSIS; WORLD WIDE WEB;

SEQUENTIAL DATA;

DATA MINING;

EID: 0034592758     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/347090.347122     Document Type: Conference Paper

References (18)

1. 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.
2. G. Brightwell and P. Winkler. Counting linear extensions is #p-complete. Order, 8:225-242, 1991.
3. R. Bubley and M. Dyer. Faster random generation of linear extensions. Technical Report 97.41, University of Leeds, Scool of Computer Studies, Research Report Series, August 1997.
4. G. Das, K.-I. Lin, H. Mannila, G. Renganathan, and P. Smyth. Rule discovery from time series. In R. Agrawal, P. Stolorz, and G. Piatetsky-Shapiro, editors, Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD'98), pages 16 - 22, New York, NY, USA, Aug. 1998. AAAI Press.
5. A. Dempster, N. Laird, and D. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, B 39:1-38, 1977.
6. C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in time-series databases. In Proceedings of ACM SIGMOD Conference on Management of Data (SIGMOD'94), pages 419 - 429, May 1994.
7. C. Fraley and A. Raftery. How many clusters? Which clustering method? Answers via model-based cluster analysis. Computer Journal, 41:578-588, 1998.
8. H. Mannila, H. Toivonen, and A. I. Verkamo. Discovering frequent episodes in sequences. In U. M. Fayyad and R. Uthurusamy, editors, Proceedings of the First International Conference on Knowledge Discovery and Data Mining (KDD'95), pages 210 - 215, Montreal, Canada, Aug. 1995. AAAI Press.
9. H. Mannila, H. Toivonen, and A. I. Verkamo. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery, 1(3):259 - 289, 1997.
10. G. McLachlan and K. Basford. Mixture Models: Inference and Applications to Clustering. Marcel Dekker, 1988.
11. T. Oates and P. R. Cohen. Searching for structure in multiple streams of data. In Proceedings of the Thirteenth International Conference on Machine Learning (ICML '96), pages 346 - 354, San Francisco, CA, July 1996. Morgan Kaufmann.
12. L. Rabiner, C. Lee, B. Juang, and L. Wilpon. Hmm clustering for connected word recognition. In Proceedings of the International Conference on Acoustics, Speech, and Signal Processing. IEEE Press 1989.
13. P. Smyth. Clustering sequences using hidden Markov models. In M. Mozer, M. Jordan, and T. Petsche, editors, Advances in Neural Information Processing Systems 9, pages 648-654. MIT Press, 1997.
14. P. Smyth. Probabilistic model-based clustering of multivariate and sequential data. In Proceedings of Seventh International Workshop on Artificial Intelligence and Statistics, Ft. Lauderdale, Florida. Morgan Kaufmann, January 1999.
15. R. Srikant and R. Agrawal. Mining sequential patterns: Generalizations and performance improvements. In Advances in Database Technology-5th International Conference on Extending Database Technology (EDBT'96), pages 3 - 17, Avignon, France, Mar. 1996.
16. D. Titterington, A. Smith, and U. Makov. Statistical analysis of finite mixture distributions. John Wiley and Sons, 1985.
17. J. Valdes, R. E. Tarjan, and E. L. Lawlor. The recognition of series parallel digraphs. SIAM Journal on Computing, 11(2):298-313, May 1982.
18. D. Wilson. Mixing times of lozenge tiling and card shuffling markov chains. Technical report, Microsoft Research, 1999.