Mining cyclically repeated patterns

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2114, Issue , 2001, Pages 83-92

  Toroslu, Ismail H ^a   Kantarcioglu, Murat ^b  

^a University of Central Florida   (United States)

^b Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; DATA WAREHOUSES; WAREHOUSES;

CUSTOMER SUPPORT; MINING TECHNIQUES; RELATED ALGORITHMS; REPEATED PATTERNS; SEQUENTIAL PATTERNS; SEQUENTIAL-PATTERN MINING; TRANSACTION DATABASE; USEFUL PATTERNS;

SALES;

EID: 34748893853     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44801-2_9     Document Type: Conference Paper

References (12)

1. R. Agrawal, C. Faloutsos, A. Swami: “Efficient similarity search in sequence databases”, Proc. of the 4th Int’l Conference on Foundations of Data Organization and Algorithms, Chicago, Oct. 1993, Also in Lecture Notes in Computer Science 730, Springer Verlag, pp. 69-84, 1993.
2. R. Agrawal, T. Imielinski, and A. Swami, “Mining association rules between sets of items in large databases”, Proc. of the ACM SIGMOD Conference on Management of Data, pp. 207-216, Washington D.C., May 1993.
3. R. Agrawal, R. Srikant, “Mining sequential patterns”, Proc. of the Int’l Conference on Data Engineering (ICDE), pp. 3-14, Taipei, Taiwan, March 1995.
4. C. Bettini, X. S. Wang, S. Jajodia, “Mining temporal relationships with multiple granularities in time sequences”, Data Engineering Bulletin, Vol. 21, pp. 32-38, 1998.
5. T. G. Dietterich, R.S. Michalski, “Discovering patterns in sequence of events”, Artificial Intelligence, vol. 25, pp. 187-232, 1985.
6. J. Han, “Data mining”, Encyclopedia of Distributed Computing, Eds. J. Urban and P. Dasgupta, Kluwer Academic Publishers, 1999.
7. J. Han, J. Pei, B. Mortazavi-Asl, Q. Chen, U. Dayal, M-C. Hsu, Freespan: Frequent pattern-projected sequential pattern mining”, In Proc. 2000 Int. Conf. Knowledge Discovery and Data Mining (KDD’00), pp. 355-359, Boston, MA, Aug. 2000.
8. J. Han, J. Pei, Y. Yin, “Mining frequent patterns without candidate generation”, In Proc. 2000 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD’00), pp. 1-12, Dallas, TX, May 2000.
9. M. Garofolakis, R. Rastogi, K. Shim, “Spirit: Sequential pattern mining with regular expression constraints”, In Proc. 1999 Int. Conf. Very Large Data Bases (VLDB’99), pp. 223-224, Edinburgh, UK, Sept. 1999.
10. R. Srikant, R. Agrawal, “Mining sequential patterns: generalizations and performance improvements”. pp. 3-17, Proc. of the Fifth Int’l Conference on Extending Database Technology (EDBT), Avignon, France, March 1996.
11. S. Wu, U. Manber, “Fast text searching allowing errors”, Communications of the ACM, vol. 35, no. 10, pp. 83-91, Oct. 1992.
12. M. J. Zaki, “Efficient Enumeration of Frequent Sequences”, 7th International Conference on Information and Knowledge Management, pp 68-75, Washington DC, November 1998.