Mining uncertain data

Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery

Volumn 1, Issue 4, 2011, Pages 316-329

  Leun, Carson Kai Sang ^a  

^a UNIVERSITY OF MANITOBA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATION RULES; DATABASE SYSTEMS;

DATA MINING AND KNOWLEDGE DISCOVERY; FREQUENT PATTERN MINING; MARKET BASKET; MINING UNCERTAIN DATUM; PROBABILISTIC DATABASE; RULE MINING; TRANSACTION DATABASE; UNCERTAIN DATAS;

DATA MINING;

EID: 80052323535     PISSN: 19424787     EISSN: 19424795     Source Type: Journal    
DOI: 10.1002/widm.31     Document Type: Article

References (56)

1. Frawley WJ, Piatetsky-Shapiro G, Matheus CJ. Knowledge discovery in databases: an overview. In: Frawley WJ, Piatetsky-Shapiro G, eds. Knowledge Discovery in Databases. Cambridge, MA: AAAI/MIT Press; 1991, 1-30.
2. Prabhakar S, Cheng R. Data uncertainty management in sensor networks. In: Liu L, ö zsu MT, eds. Encyclopedia of Database Systems. New York, NY: Springer; 2009, 647-651.
3. Suciu D. Probabilistic databases. In: Liu L, ö zsu MT, eds. Encyclopedia of Database Systems. New York, NY: Springer; 2009, 2150-2155.
4. Wasserkrug S. Uncertainty in events. In: Liu L, ö zsu MT, eds. Encyclopedia of Database Systems. New York, NY: Springer; 2009, 3221-3225.
5. Dalvi N. Uncertainty management in scientific database systems. In: Liu L, ö zsu MT, eds. Encyclopedia of Database Systems. New York, NY: Springer; 2009, 3225-3231.
6. Kriegel HP, Pfeifle M. Density-based clustering of uncertain data. In: Grossman R, Bayardo RJ, Bennett KP, eds. Proceedings of the KDD. New York, NY: ACM Press; 2005, 672-677.
7. Cormode G, McGregor A. Approximation algorithms for clustering uncertain data. In: Lenzerini M, Lembo D, eds. Proceedings of the ACM PODS. New York, NY: ACM Press; 2008, 191-200.
8. Kao B, Lee SD, Lee FKF, Cheung DW, HoWS. Clustering uncertain data using Voronoi diagrams and R-tree index. IEEE Trans Knowl Data Eng 2010, 22: 1219-1233. doi:10.1109/TKDE.2010.82.
9. Ren J, Lee SD, Chen X, Kao B, Cheng R, Cheung D. Naive Bayes classification of uncertain data. In: Wang W, Kargupta H, Ranka S, Yu PS, Wu X, eds. Proceedings of the IEEE ICDM. Los Alamitos, CA: IEEE Computer Society; 2009, 944-949.
10. Qin B, Xia Y, Li F. A Bayesian classifier for uncertain data. In: Shin D, ed. Proceedings of the ACM SAC. New York, NY: ACM Press; 2010, 1010-1014.
11. Aggarwal CC, Yu PS. Outlier detection with uncertain data. In: Wang W, ed. Proceedings of the SDM. Philadelphia, PA: SIAM; 2008, 483-493.
12. Agrawal R, Imielinski T, Swami A. Mining association rules between sets of items in large databases. In: Buneman P, Jajodia S, eds. Proceedings of the ACM SIGMOD. New York, NY: ACM Press; 1993, 207-216.
13. Pei J. Association rules. In: Liu L, ö zsu MT, eds. Encyclopedia of Database Systems. New York, NY: Springer; 2009, 140-141.
14. Cheng H, Han J. Frequent itemsets and association rules. In: Liu L, ö zsu MT, eds. Encyclopedia of Database Systems. New York, NY: Springer; 2009, 1184-1187.
15. Abiteboul S, Kanellakis P, Grahne G. On the representation and querying of sets of possibleworlds. In: Dayal U, Traiger IL, eds. Proceedings of the ACM SIGMOD. New York, NY: ACM Press; 1987, 34-48.
16. Green T, Tannen V. Models for incomplete and probabilistic information. In: Grust T, Höpfner H, Illarramendi A, Jablonski S, Mesiti M, Müller S, Patranjan PL, Sattler KU, Spiliopoulou M, Wijsen J, eds. Proceedings of the EDBT Workshops. LNCS, Vol. 4254. Berlin, Germany: Springer; 2006, 278-296.
17. Green T, Tannen V. Models for incomplete and probabilistic information. Bull Tech Committee Data Eng 2006, 29:17-24.
18. Dai X, Yiu ML, Mamoulis N, Tao Y, Vaitis M. Probabilistic spatial queries on existentially uncertain data. In: Medeiros CB, Egenhofer M, Bertino E, eds. Proceeding of the SSTD. LNCS, Vol. 3633. Berlin, Germany: Springer; 2005, 400-417.
19. Chui CK, Kao B, Hung E. Mining frequent itemsets from uncertain data. In: Zhou ZH, Li H, Yang Q, eds. Proceeding of the PAKDD. LNAI, Vol. 4426. Berlin, Germany: Springer; 2007, 47-58.
20. Agrawal R, Srikant R. Fast algorithms for mining association rules in large databases. In: Bocca JB, Jarke M, Zaniolo C, eds. Proceedings of the VLDB. San Francisco, CA: Morgan Kaufmann; 1994, 487-499.
21. Agrawal R, Mannila H, Srikant R, Toivonen H, Verkamo AI. Fast discovery of association rules. In: Fayyad UM, Piatetsky-Shapiro G, Smyth P, Uthurusamy R, eds. Advances in KnowledgeDiscovery and Data Mining. Menlo Park, CA: AAAI/MIT Press; 1996, 307-328.
22. Goethals B. Apriori property and breadth-first search algorithms. In: Liu L, ö zsu MT, eds. Encyclopedia of Database Systems. New York, NY: Springer; 2009, 124-127.
23. Chui CK, Kao B. A decremental approach for mining frequent itemsets from uncertain data. In: Washio T, Suzuki E, Ting KM, eds. Proceeding of the PAKDD. LNAI, Vol. 5012. Berlin, Germany: Springer; 2008, 64-75.
24. Leung CKS, Carmichael CL, Hao B. Efficient mining of frequent patterns from uncertain data. In: Tung AKH, Zhu Q, Ramakrishnan N, Zaïane OR, Shi Y, Clifton CW, Wu X, eds. Proceedings of the IEEE ICDM Workshops. Los Alamitos, CA: IEEE Computer Society; 2007, 489-494.
25. Han J, Pei J, Yin Y. Mining frequent patterns without candidate generation. In: ChenW, Naughton JF, Bernstein PA, eds. Proceeding of the ACM SIGMOD. New York, NY: ACM Press; 2000, 1-12.
26. Han J, Pei J, Yin Y, Mao R. Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min Knowl Discov 2004, 8:53-87. doi:10.1023/B:DAMI.0000005258.31418.83.
27. Leung CKS, Mateo MAF, Brajczuk DA. A tree-based approach for frequent pattern mining from uncertain data. In: Washio T, Suzuki E, Ting KM, Inokuchi A, eds. Proceedings of the PAKDD. LNAI, Vol. 5012. Berlin, Germany: Springer; 2008, 653-661.
28. Leung CKS. Frequent itemset mining with constraints. In: Liu L, ö zsu MT, eds. Encyclopedia of Database Systems. New York, NY: Springer; 2009, 1179-1183.
29. Ng RT, Lakshmanan LVS, Han J, Pang A. Exploratory mining and pruning optimizations of constrained associations rules. In: Haas LM, Tiwary A, eds. Proceeding of the ACM SIGMOD. New York, NY: ACM Press; 1998, 13-24.
30. Lakshmanan LVS, Leung CKS, Ng RT. Efficient dynamic mining of constrained frequent sets. ACM Trans Database Syst 2003, 28:337-389.
31. Leung CKS, Brajczuk DA. Efficient algorithms for mining constrained frequent patterns from uncertain data. In: Pei J, Getoor L, de Keijzer A, eds. Proceeding of the U. New York, NY: ACM Press; 2009, 9-18.
32. Leung CKS, Brajczuk DA. Efficient algorithms for the mining of constrained frequent patterns from uncertain data. SIGKDD Explor 2009, 11:123-130. doi:10.1145/1809400.1809425.
33. Leung CKS, Hao B, Brajczuk DA. Mining uncertain data for frequent itemsets that satisfy aggregate constraints. In: Shin D, ed. Proceedings of the ACM SAC. New York, NY: ACM Press; 2010, 1034-1038.
34. Leung CKS. Succinct constraints. In: Liu L, ö zsu MT, eds. Encyclopedia of Database Systems. New York, NY: Springer; 2009, 2876.
35. Leung CKS, Lakshmanan LVS, Ng RT. Exploiting succinct constraints using FP-trees. SIGKDD Explor 2002, 4:40-49. doi:10.1145/568574.568581.
36. Leung CKS. Convertible constraints. In: Liu L, ö zsu MT, eds. Encyclopedia of Database Systems. New York, NY: Springer; 2009, 494-495.
37. Pei J, Han J, Lakshmanan LVS. Mining frequent itemsets with convertible constraints. In: Buchmann A, Georgakopoulos D, eds. Proceedings of the IEEE ICDE. Los Alamitos, CA: IEEE Computer Society; 2001, 433-442.
38. Pei J, Han J, Lakshmanan LVS. Pushing convertible constraints in frequent itemset mining. Data Min Knowl Discov 2004, 8:227-252.
39. Giannella C, Han J, Pei J, Yan X, Yu PS. Mining frequent patterns in data streams at multiple time granularities. In: Kargupta H, Joshi A, Sivakumar K, Yesha Y, eds. Data Mining: Next Generation Challenges and Future Directions. Menlo Park, CA: AAAI/MIT Press; 2004, 105-124.
40. Gaber MM, Zaslavsky AB, Krishnaswamy S. Mining data streams: a review. SIGMOD Rec 2005, 34:18-26. doi:10.1145/1083784.1083789.
41. Leung CKS, Khan QI. DSTree: a tree structure for the mining of frequent sets from data streams. In: Clifton CW, Zhong N, Liu J, Wah BW, WuX, eds. Proceedings of the IEEE ICDM. Los Alamitos, CA: IEEE Computer Society; 2006, 928-933.
42. Cormode G, Hadjieleftheriou M. Finding frequent items in data streams. In: Buneman P, Ooi BC, Ross K, Rastogi R, Milo T, Markl V, eds. Proceedings of the VLDB. New York, NY: VLDB Endowment; 2008, 1530-1541.
43. Yu PS, Chi Y. Association rule mining on streams. In: Liu L, ö zsu MT, eds. Encyclopedia of Database Systems. New York, NY: Springer; 2009, 136-140.
44. Metwally A. Frequent items on streams. In: Liu L, ö zsu MT, eds. Encyclopedia of Database Systems. New York, NY: Springer; 2009, 1175-1179.
45. Han J, Ding B. Stream mining. In: Liu L, ö zsu MT, eds. Encyclopedia of Database Systems. New York, NY: Springer; 2009, 2831-2834.
46. Leung CKS, Hao B. Mining of frequent itemsets from streams of uncertain data. In: Hristidis V, Yu S, eds. Proceedings of the IEEE ICDE. Los Alamitos, CA: IEEE Computer Society; 2009, 1663-1670.
47. Pei J, Han J, Lu H, Nishio S, Tang S, Yang D. HMine: hyper-structure mining of frequent patterns in large databases. In: Cercone N, Lin TY, Wu X, eds. Proceedings of the IEEE ICDM. Los Alamitos, CA: IEEE Computer Society; 2001, 441-448.
48. Pei J, Han J, Lu H, Nishio S, Tang S, Yang D. HMine: fast and space-preserving frequent pattern mining in large databases. IIE Trans 2007, 39:593-605. doi:10.1080/07408170600897460.
49. Aggarwal CC, Li Y, Wang J, Wang J. Frequent pattern mining with uncertain data. In: Melli G, ed. Proceedings of the KDD. New York, NY: ACM Press; 2009, 29-37.
50. Aggarwal CC, Li Y, Wang J, Wang J. Frequent pattern mining algorithms with uncertain data. In: Aggarwal CC, ed. Managing and Mining Uncertain Data. New York, NY: Springer; 2009, 427-459.
51. Calders T, Garboni C, Goethals B. Efficient pattern mining of uncertain data with sampling. In: Zaki MJ, Yu JX, Ravindran B, Pudi V, eds. Proceedings of the PAKDD. LNAI, Vol. 6118. Berlin, Germany: Springer; 2010, 480-487.
52. Zaki MJ, Parthasarathy S, Ogihara M, Li W. New algorithms for fast discovery of association rules. In: Heckerman D, Mannila H, Pregibon D, eds. Proceedings of the KDD. Menlo Park, CA: AAAI Press; 1997, 283-286.
53. Zhang Q, Li F, Yi K. Finding frequent items in probabilistic data. In: Wang J, ed. Proceedings of the ACM SIGMOD. New York, NY: ACM Press; 2008, 819-832.
54. Dalvi N, Suciu D. Efficient query evaluation on probabilistic databases. In: Nascimento MA, ö zsu MT, Kossmann D, Miller RJ, Blakeley JA, Schiefer KB, eds. Proceedings of the VLDB. San Francisco, CA: Morgan Kaufmann; 2004, 864-875.
55. Bernecker T, Kriegel H-P, Renz M, Verhein F, Zuefle A. Probabilistic frequent itemset mining in uncertain databases. In: Melli G, ed. Proceedings of the KDD. New York, NY: ACM Press; 2009, 119-127.
56. Sun L, Cheng R, Cheung DW, Cheng J. Mining uncertain data with probabilistic guarantees. In: Rao B, Krishnapuram B, Tomkins A, Yang Q, eds. Proceedings of the KDD. New York, NY: ACM Press; 2010, 273-282.