On probabilistic models for uncertain sequential pattern mining

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

Volumn 6440 LNAI, Issue PART 1, 2010, Pages 60-72

  Muzammal, Muhammad ^a   Raman, Rajeev ^a  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

Mining Uncertain Data; Novel Algorithms for Mining; Probabilistic Databases; Sequential Pattern Mining; Theoretical Foundations of Data Mining

Indexed keywords

NOVEL ALGORITHM; PROBABILISTIC DATABASE; SEQUENTIAL-PATTERN MINING; THEORETICAL FOUNDATIONS; UNCERTAIN DATAS; MINING UNCERTAIN DATUM; THEORETICAL FOUNDATIONS OF DATA MININGS;

ALGORITHMS; DATABASE SYSTEMS; POLYNOMIAL APPROXIMATION; SEMANTICS; ALUMINUM;

DATA MINING;

EID: 78650184230     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17316-5_6     Document Type: Conference Paper

References (24)

1. Aggarwal, C.C. (ed.): Managing and Mining Uncertain Data. Springer, Heidelberg (2009)
2. Aggarwal, C.C., Li, Y., Wang, J., Wang, J.: Frequent pattern mining with uncertain data. In: KDD, pp. 29-38 (2009)
3. Agrawal, R., Srikant, R.: Mining sequential patterns. In: ICDE, pp. 3-14 (1995)
4. Ayres, J., Flannick, J., Gehrke, J., Yiu, T.: Sequential pattern mining using a bitmap representation. In: KDD, pp. 429-435 (2002)
5. Bernecker, T., Kriegel, H.-P., Renz, M., Verhein, F., Züfle, A.: Probabilistic frequent itemset mining in uncertain databases. In: KDD, pp. 119-128 (2009)
6. Chui, C.K., Kao, B., Hung, E.: Mining frequent itemsets from uncertain data. In: Zhou, Z.-H., Li, H., Yang, Q. (eds.) PAKDD 2007. LNCS (LNAI), vol. 4426, pp. 47-58. Springer, Heidelberg (2007)
7. Cormode, G., Li, F., Yi, K.: Semantics of ranking queries for probabilistic data and expected ranks. In: ICDE, pp. 305-316 (2009)
8. Dalvi, N.N., Suciu, D.: The dichotomy of conjunctive queries on probabilistic structures. In: PODS, pp. 293-302 (2007)
9. El-Ramly, M., Stroulia, E., Sorenson, P.G.: From run-time behavior to usage scenarios: an interaction-pattern mining approach. In: KDD, pp. 315-324 (2002)
10. Gunopulos, D., Khardon, R., Mannila, H., Saluja, S., Toivonen, H., Sharm, R.S.: Discovering all most specific sentences. ACM ToDS 28(2), 140-174 (2003)
11. Hassanzadeh, O., Miller, R.J.: Creating probabilistic databases from duplicated data. The VLDB Journal 18(5), 1141-1166 (2009)
12. Hua, M., Pei, J., Zhang, W., Lin, X.: Ranking queries on uncertain data: a probabilistic threshold approach. In: SIGMOD Conference, pp. 673-686 (2008)
13. Khoussainova, N., Balazinska, M., Suciu, D.: Probabilistic event extraction from rfid data. In: ICDE, pp. 1480-1482 (2008)
14. Muzammal, M., Raman, R.: Mining sequential patterns from probabilistic databases. Tech. Rep. CS-10-002, Dept. of Computer Science, Univ. of Leicester (2010), http://www.cs.le.ac.uk/people/mm386/pSPM.pdf
15. Pei, J., Han, J., Mortazavi-Asl, B., Wang, J., Pinto, H., Chen, Q., Dayal, U., Hsu, M.: Mining sequential patterns by pattern-growth: The prefixspan approach. IEEE Trans. Knowl. Data Eng. 16(11), 1424-1440 (2004)
16. Srikant, R., Agrawal, R.: Mining sequential patterns: Generalizations and performance improvements. In: Apers, P.M.G., Bouzeghoub, M., Gardarin, G. (eds.) EDBT 1996. LNCS, vol. 1057, pp. 3-17. Springer, Heidelberg (1996)
17. Suciu, D., Dalvi, N.N.: Foundations of probabilistic answers to queries. In: SIGMOD Conference, p. 963 (2005)
18. Sun, X., Orlowska, M.E., Li, X.: Introducing uncertainty into pattern discovery in temporal event sequences. In: ICDM, pp. 299-306 (2003)
19. Valiant, L.G.: The complexity of computing the permanent. Theor. Comput. Sci. 8, 189-201 (1979)
20. Wang, K., Xu, Y., Yu, J.X.: Scalable sequential pattern mining for biological sequences. In: CIKM, pp. 178-187 (2004)
21. Wikipedia: http://en.wikipedia.org/wiki/anpr - Wikipedia, the free encyclopedia (2010), http://en.wikipedia.org/wiki/ANPR (Online; accessed April 30, 2010)
22. Yang, J., Wang, W., Yu, P.S., Han, J.: Mining long sequential patterns in a noisy environment. In: SIGMOD Conference, pp. 406-417 (2002)
23. Zaki, M.J.: Spade: An efficient algorithm for mining frequent sequences. Machine Learning 42(1/2), 31-60 (2001)
24. Zhang, Q., Li, F., Yi, K.: Finding frequent items in probabilistic data. In: SIGMOD Conference, pp. 819-832 (2008)