Global partial orders from sequential data

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Global partial orders from sequential data

Full text

Pdf (200 KB)

Source

International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining table of contents

Boston, Massachusetts, United States

Pages: 161 - 168

Year of Publication: 2000

ISBN:1-58113-233-6

Authors

Heikki Mannila	Nokia Research Center, PO Box 407, FIN-00045 Nokia Group, Finland
Christopher Meek	Microsoft Research, One Microsoft Way, Redmond, WA

Sponsors

SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
AAAI : Am Assoc for Artifical Intelligence
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 13, Downloads (12 Months): 75, Citation Count: 13

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/347090.347122 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Rakesh Agrawal , Ramakrishnan Srikant, Mining Sequential Patterns, Proceedings of the Eleventh International Conference on Data Engineering, p.3-14, March 06-10, 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	Christos Faloutsos , M. Ranganathan , Yannis Manolopoulos, Fast subsequence matching in time-series databases, Proceedings of the 1994 ACM SIGMOD international conference on Management of data, p.419-429, May 24-27, 1994, Minneapolis, Minnesota, United States
	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	Heikki Mannila , Hannu Toivonen , A. Inkeri Verkamo, Discovery of Frequent Episodes in Event Sequences, Data Mining and Knowledge Discovery, v.1 n.3, p.259-289, 1997 [doi>10.1023/A:1009748302351]
	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	Ramakrishnan Srikant , Rakesh Agrawal, Mining Sequential Patterns: Generalizations and Performance Improvements, Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology, p.3-17, March 25-29, 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. Lawler. 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 shuling markov chains. Technical report, Microsoft Research, 1999.

CITED BY 13

	Aristides Gionis , Teija Kujala , Heikki Mannila, Fragments of order, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, August 24-27, 2003, Washington, D.C.
	Antti Ukkonen , Mikael Fortelius , Heikki Mannila, Finding partial orders from unordered 0-1 data, Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, August 21-24, 2005, Chicago, Illinois, USA
	Chen Wang , Ming-Sheng Hong , Wei Wang , Bai-Le Shi, Chopper: efficient algorithm for tree mining, Journal of Computer Science and Technology, v.19 n.3, p.309-319, May 2004
	Li Yang, Pruning and Visualizing Generalized Association Rules in Parallel Coordinates, IEEE Transactions on Knowledge and Data Engineering, v.17 n.1, p.60-70, January 2005
	Toshihiro Kamishima , Shotaro Akaho, Supervised ordering by regression combined with Thurstone's model, Artificial Intelligence Review, v.25 n.3, p.231-246, May 2006
	Aristides Gionis , Heikki Mannila , Kai Puolamäki , Antti Ukkonen, Algorithms for discovering bucket orders from data, Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, August 20-23, 2006, Philadelphia, PA, USA
	José L. Balcázar , Gemma C. Garriga, Horn axiomatizations for sequential data, Theoretical Computer Science, v.371 n.3, p.247-264, March, 2007
	Jiong Yang , Wei Wang , Philip S. Yu, Mining Surprising Periodic Patterns, Data Mining and Knowledge Discovery, v.9 n.2, p.189-216, September 2004
	Karel De Loof , Hans De Meyer , Bernard De Baets, Exploiting the Lattice of Ideals Representation of a Poset, Fundamenta Informaticae, v.71 n.2,3, p.309-321, August 2006
	Fabian Mörchen, Unsupervised pattern mining from symbolic temporal data, ACM SIGKDD Explorations Newsletter, v.9 n.1, p.41-55, June 2007
	Jian Pei , Haixun Wang , Jian Liu , Ke Wang , Jianyong Wang , Philip S. Yu, Discovering Frequent Closed Partial Orders from Strings, IEEE Transactions on Knowledge and Data Engineering, v.18 n.11, p.1467-1481, November 2006
	Zhenglu Yang , Lin Li , Botao Wang , Masaru Kitsuregawa, Towards efficient dominant relationship exploration of the product items on the web, Proceedings of the 22nd national conference on Artificial intelligence, p.1483-1488, July 22-26, 2007, Vancouver, British Columbia, Canada
	Stijn Goedertier , David Martens , Jan Vanthienen , Bart Baesens, Robust Process Discovery with Artificial Negative Events, The Journal of Machine Learning Research, 10, p.1305-1340, June 2009