An important aspect of big data: Data usability

Jisuanji Yanjiu yu Fazhan/Computer Research and Development

Volumn 50, Issue 6, 2013, Pages 1147-1162

  Li, Jianzhong ^a   Liu, Xianmin ^a  

^a HARBIN INSTITUTE OF TECHNOLOGY   (China)

Author keywords

Big data; Data accuracy; Data completeness; Data consistency; Data currency; Data usability; Entity identity

Indexed keywords

BIG DATUM; DATA ACCURACY; DATA COMPLETENESS; DATA CONSISTENCY; DATA CURRENCY; DATA USABILITY; ENTITY IDENTITY;

EMBEDDED SYSTEMS; INDUSTRIAL RESEARCH; INFORMATION TECHNOLOGY; INTERNET; SOCIAL NETWORKING (ONLINE);

USABILITY ENGINEERING;

EID: 84880000776     PISSN: 10001239     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (159)

1. Redman T. The impact of poor data quality on the typical enterprise [J]. Communications of the ACM, 1998, 41(2): 79-82
2. Miller D W, Yeast J D, Evans R L. Missing prenatal records at a birth center: A communication problem quantified [C]//Proc of AMIA Annual Symp Proceedings. Maryland: American Medical Informatics Association, 2005: 535-539
3. Swartz N. Gartner warns firms of 'dirty data' [J]. Information Management Journal, 2007, 41(3): 6
4. Kohn L T, Corrigan J M, Donaldson M S. To Err is Human: Building a Safer Health System [M]. Washington: National Academies Press, 2000
5. Eckerson W. Data Warehousing Special Report: Data quality and the bottom line [R]. Applications Development Trends, 2002
6. English L P. Improving Data Warehouse and Business Information Quality: Methods for Reducing Costs and Increasing Profits [M]. New York: Wiley, 1999
7. Woolsey B, Schulz M. Credit card statistics, industry facts, debt statistics [OL]. [2013-04-20]. http://www.creditcards.com/credit-card-news/credit-card-industry- facts-personal-debt-statistics-1276.php
8. Shilakes C, Tylman J. Enterprise information portals [R]. New York: Merrill Lynch, 1998
9. Rahm E, Do H H. Data cleaning: Problems and current approaches [J]. IEEE Data Engineering Bulletin, 2000, 23(4): 3-13
10. Dong X L, Berti-Equille L, Srivastava D. Integrating conflicting data: The role of source dependence [J]. Proceedings of the VLDB Endowment, 2009, 2(1): 550-561
11. Dong X L, Berti-Equille L, Srivastava D. Truth discovery and copying detection in a dynamic world [J]. Proceedings of the VLDB Endowment, 2009, 2(1): 562-573
12. Dong X L, Berti-Equille L, Hu Yifan, et al. Global detection of complex copying relationships between sources [J]. Proceedings of the VLDB Endowment, 2010, 3(1/2): 1358-1369
13. Dong X L, Berti-Equille L, Hu Yifan, et al. Solomon: Seeking the truth via copying detection [J]. Proceedings of the VLDB Endowment, 2010, 3(1/2): 1617-1620
14. Dong X L, Naumann F. Data fusion: resolving data conflicts for integration [J]. Proceedings of the VLDB Endowment, 2009, 2(2): 1654-1655
15. Cheng Siyao, Li Jianzhong. Sampling based (ε, δ)-approximate aggregation algorithm in sensor networks [C]//Proc of IEEE ICDCS'09. Piscataway, NJ: IEEE, 2009: 273-280
16. Li Jianzhong, Cheng Siyao. (ε, δ)-approximate aggregation algorithms in dynamic sensor networks [J]. IEEE Trans on Parallel and Distributed Systems, 2012, 23(3): 385-396
17. Cheng Siyao, Li Jianzhong, Cai Zhipeng. o(ε)-approximation to physical world by sensor networks [C]//Proc of IEEE INFOCOM'13. Piscataway, NJ: IEEE, 2013: 3184-3192
18. Cheng Siyao, Li Jianzhong, Liu Yu. Location aware peak value queries in sensor networks [C]//Proc of IEEE INFOCOM'12. Piscataway, NJ: IEEE, 2012: 486-494
19. Bohannon P, Fan Wenfei, Geerts F, et al. Conditional functional dependencies for data cleaning [C]//Proc of IEEE ICDE'07. Piscataway, NJ: IEEE, 2007: 746-755
20. Bravo L, Fan Wenfei, Ma Shuai. Extending dependencies with conditions [C]//Proc of the 33rd Int Conf on Very Large Databases. San Francisco, CA: Morgan Kaufmann, 2007: 243-254
21. Bravo L, Fan Wenfei, Geerts F, et al. Increasing the expressivity of conditional functional dependencies without extra complexity [C]//Proc of IEEE ICDE'08. Piscataway, NJ: IEEE, 2008: 516-525
22. Fan Wenfei, Ma Shuai, Hu Yanli, et al. Propagating functional dependencies with conditions [J]. Proceedings of the VLDB Endowment, 2008, 1(1): 391-407
23. Fan Wenfei. Dependencies revisited for improving data quality [C]//Proc of the 27th ACM SIGMOD-SIGACT-SIGART Symp on Principles of Database Systems. New York: ACM, 2008: 159-170
24. Golab L, Karloff H, Korn F, et al. Sequential dependencies [J]. Proceedings of the VLDB Endowment, 2009, 2(1): 574-585
25. Koudas N, Saha A, Srivastava D, et al. Metric functional dependencies [C]//Proc of IEEE ICDE'09. Piscataway, NJ: IEEE, 2009: 1275-1278
26. Chiang F, Miller R J. Discovering data quality rules [J]. Proceedings of the VLDB Endowment, 2008, 1(1): 1166-1177
27. Fan Wenfei, Geerts F, Li Jianzhong, et al. Discovering conditional functional dependencies [J]. IEEE Trans on Knowledge and Data Engineering, 2011, 23(5): 683-698
28. Korn F, Muthukrishnan S, Zhu Y. Checks and balances: Monitoring data quality problems in network traffic databases [C]//Proc of the 29th Int Conf on Very Large Databases. San Francisco, CA: Morgan Kaufmann, 2003: 536-547
29. Xiong Hui, Pandey G, Steinbach M, et al. Enhancing data analysis with noise removal [J]. IEEE Trans on Knowledge and Data Engineering, 2006, 18(3): 304-319
30. van der Meyden R. Logical Approaches to Incomplete Information: A Survey [M]. Berlin: Springer, 1998: 307-356
31. Grahne G. The Problem of Incomplete Information in Relational Databases [M]. Berlin: Springer, 1991
32. Imieliński T, Lipski Jr W. Incomplete information in relational databases [J]. Journal of the ACM (JACM), 1984, 31(4): 761-791
33. Vardi M. On the integrity of databases with incomplete information [C]//Proc of the 5th ACM SIGACT-SIGMOD Symp on Principles of Database Systems. New York: ACM, 1985: 252-266
34. Gottlob G, Zicari R. Closed world databases opened through null values [C]//Proc of the 14th Int Conf on Very Large Databases. San Francisco, CA: Morgan Kaufmann, 1988: 50-61
35. Fan Wenfei, Geerts F. Relative information completeness [C]//Proc of the 28th ACM SIGMOD-SIGACT-SIGART Symp on Principles of Database Systems. New York: ACM, 2009: 97-106
36. Fan Wenfei, Geerts F. Capturing missing tuples and missing values [C]//Proc of the 29th ACM SIGMOD-SIGACT-SIGART Symp on Principles of Database Systems. New York: ACM, 2010: 169-178
37. Abiteboul S, Segoufin L, Vianu V. Representing and querying XML with incomplete information [J]. ACM Trans on Database Systems (TODS), 2006, 31(1): 208-254
38. Barceló P, Libkin L, Poggi A, et al. XML with incomplete information [J]. Journal of the ACM (JACM), 2010, 58(1): 1-62
39. Cheng R, Chen J, Xie X. Cleaning uncertain data with quality guarantees [J]. Proceedings of the VLDB Endowment, 2008, 1(1): 722-735
40. Chomicki J, Marcinkowski J. Minimal-change integrity maintenance using tuple deletions [J]. Information and Computation, 2005, 197(1): 90-121
41. Schwalb E, Vila L. Temporal constraints: A survey [J]. Constraints, 1998, 3(2/3): 129-149
42. Zhang Haopeng, Diao Yanlei, Immerman N. Recognizing patterns in streams with imprecise timestamps [J]. Proceedings of the VLDB Endowment, 2010, 3(1): 244-255
43. Clifford J, Dyreson C, Isakowitz T, et al. On the semantics of "now" in databases [J]. ACM Trans on Database Systems (TODS), 1997, 22(2): 171-214
44. Fan Wenfei, Geerts F, Wijsen J. Determining the currency of data [J]. ACM Trans on Database Systems (TODS), 2012, 37(4): 1-46
45. Newcombe H B, Kennedy J M, Axford S J, et al. Automatic linkage of vital records [J]. Science, 1959, 130(3381): 954-959
46. Fellegi I P, Sunter A B. A theory for record linkage [J]. Journal of the American Statistical Association, 1969, 64(328): 1183-1210
47. Hernández M A, Stolfo S J. The merge/purge problem for large databases [J]. Proc of ACM SIGMOD Record, 1995, 24(2): 127-138
48. Hernández M A, Stolfo S J. Real-world data is dirty: Data cleansing and the merge/purge problem [J]. Data Mining and Knowledge Discovery, 1998, 2(1): 9-37
49. Elmagarmid A K, Ipeirotis P G, Verykios V S. Duplicate record detection: A survey [J]. IEEE Trans on Knowledge and Data Engineering, 2007, 19(1): 1-16
50. Brizan D G, Tansel A U. A survey of entity resolution and record linkage methodologies [J]. Communications of the IIMA, 2006, 6(3): 41-50
51. Koudas N, Sarawagi S, Srivastava D. Record linkage: Similarity measures and algorithms [C]//Proc of the 2006 ACM SIGMOD Int Conf on Management of Data. New York: ACM, 2006: 802-803
52. Lim E P, Srivastava J, Prabhakar S, et al. Entity identification in database integration [J]. Information Sciences, 1996, 89(1): 1-38
53. Arasu A, Chaudhuri S, Kaushik R. Transformation-based framework for record matching [C]//Proc of IEEE ICDE'08. Piscataway, NJ: IEEE, 2008: 40-49
54. Arasu A, Kaushik R. A grammar-based entity representation framework for data cleaning [C]//Proc of the 2009 ACM SIGMOD Int Conf on Management of Data. New York: ACM, 2009: 233-244
55. Arasu A, Chaudhuri S, Kaushik R. Learning string transformations from examples [J]. Proceedings of the VLDB Endowment, 2009, 2(1): 514-525
56. Arasu A, Ré C, Suciu D. Large-scale deduplication with constraints using dedupalog [C]//Proc of IEEE ICDE'09. Piscataway, NJ: IEEE, 2009: 952-963
57. Whang S E, Benjelloun O, Garcia-Molina H. Generic entity resolution with negative rules [J]. The International Journal on Very Large Databases, 2009, 18(6): 1261-1277
58. Chaudhuri S, Das Sarma A, Ganti V, et al. Leveraging aggregate constraints for deduplication [C]//Proc of the 2007 ACM SIGMOD Int Conf on Management of Data. New York: ACM, 2007: 437-448
59. Fan Wenfei, Jia Xibei, Li Jianzhong, et al. Reasoning about record matching rules [J]. Proceedings of the VLDB Endowment, 2009, 2(1): 407-418
60. Fan Wenfei, Gao Hong, Jia Xibei, et al. Dynamic constraints for record matching [J]. The VLDB Journal, 2011, 20(4): 495-520
61. Shen W, Li Xin, Doan A. Constraint-based entity matching [C]//Proc of the National Conf on Artificial Intelligence. Menlo Park, CA: AAAI Press, 2005: 862-867
62. Weis M, Naumann F. DogmatiX tracks down duplicates in XML [C]//Proc of the 2005 ACM SIGMOD Int Conf on Management of Data. New York: ACM, 2005: 431-442
63. Getoor L. Graph Identification [M]. Berlin: Springer, 2010
64. Fan Wenfei, Li Jianzhong, Ma Shuai, et al. Graph homomorphism revisited for graph matching [J]. Proceedings of the VLDB Endowment, 2010, 3(1/2): 1161-1172
65. Fan Wenfei, Li Jianzhong, Ma Shuai, et al. Graph pattern matching: from intractable to polynomial time [J]. Proceedings of the VLDB Endowment, 2010, 3(1/2): 264-275
66. Fan Wenfei, Li Jianzhong, Luo Jizhou, et al. Incremental graph pattern matching [C]//Proc of ACM SIGMOD. New York: ACM, 2011: 925-936
67. Fan Wenfei, Li Jianzhong, Wang Xin, et al. Query preserving graph compression [C]//Proc of the 2012 Int Conf on Management of Data. New York: ACM, 2012: 157-168
68. Monge A E, Elkan C. The field matching problem: Algorithms and applications [C]//Proc of the 2nd Int Conf on Knowledge Discovery and Data Mining. Menlo Park, CA: AAAI Press, 1996: 267-270
69. Monge A, Elkan C. An efficient domain-independent algorithm for detecting approximately duplicate database records [C]//Proc of Research Issues on Data Mining and Knowledge Discovery. Berlin: Springer, 1997: 1-7
70. Cohen W W. Data integration using similarity joins and a word-based information representation language [J]. ACM Trans on Information Systems (TOIS), 2000, 18(3): 288-321
71. Ananthakrishna R, Chaudhuri S, Ganti V. Eliminating fuzzy duplicates in data warehouses [C]//Proc of the 28th Int Conf on Very Large Databases. San Francisco, CA: Morgan Kaufmann, 2002: 586-597
72. Chaudhuri S, Ganti V, Motwani R. Robust identification of fuzzy duplicates [C]//Proc of IEEE ICDE'05. Piscataway, NJ: IEEE, 2005: 865-876
73. Guha S, Koudas N, Marathe A, et al. Merging the results of approximate match operations [C]//Proc of the 30th Int Conf on Very Large Databases. San Francisco, CA: Morgan Kaufmann, 2004: 636-647
74. Chen Z, Kalashnikov D V, Mehrotra S. Adaptive graphical approach to entity resolution [C]//Proc of the 7th ACM/IEEE-CS Joint Conf on Digital Libraries. New York: ACM, 2007: 204-213
75. Singla P, Domingos P. Entity resolution with markov logic [C]//Proc of IEEE ICDM'06. Piscataway, NJ: IEEE, 2006: 572-582
76. Augsten N, Bohlen M, Dyreson C, et al. Approximate joins for data-centric XML [C]//Proc of IEEE ICDE'08. Piscataway, NJ: IEEE, 2008: 814-823
77. Augsten N, Böhlen M, Gamper J. Approximate matching of hierarchical data using pq-grams [C]//Proc of the 31st Int Conf on Very Large Databases. San Francisco, CA: Morgan Kaufmann, 2005: 301-312
78. Wang Wei, Xiao Chuan, Lin Xuemin, et al. Efficient approximate entity extraction with edit distance constraints [C]//Proc of the 35th SIGMOD Int Conf on Management of Data. New York: ACM, 2009: 759-770
79. Ferreira Chaves L W, Buchmann E, Böhm K. Finding misplaced items in retail by clustering RFID data [C]//Proc of the 13th Int Conf on Extending Database Technology. New York: ACM, 2010: 501-512
80. Batini C, Scannapieca M. Data Quality [M]. Berlin: Springer, 2006
81. Fan Wenfei, Li Jianzhong, Ma Shuai, et al. Interaction between record matching and data repairing [C]//Proc of the 2011 Int Conf on Management of Data. New York: ACM, 2011: 469-480
82. Chen W, Fan W, Ma S. Analyses and validation of conditional dependencies with built-in predicates [C]//Proc of DEXA'09. Berlin: Springer, 2009: 576-591
83. Fan Wenfei, Geerts F, Jia Xibei, et al. Conditional functional dependencies for capturing data inconsistencies [J]. ACM Trans on Database Systems (TODS), 2008, 33(2): 1-48
84. Fan Wenfei, Geerts F, Ma Shuai, et al. Detecting inconsistencies in distributed data [C]//Proc of IEEE ICDE'10. Piscataway, NJ: IEEE, 2010: 64-75
85. Fan W, Li J, Tang N, et al. Incremental detection of inconsistencies in distributed data [C]//Proc of IEEE ICDE'10. Piscataway, NJ: IEEE, 2012: 318-329
86. Chaudhuri S, Ganti V, Xin D. Mining document collections to facilitate accurate approximate entity matching [J]. Proceedings of the VLDB Endowment, 2009, 2(1): 395-406
87. Shu Liangcai, Long Bo, Meng Weiyi. A latent topic model for complete entity resolution [C]//Proc of IEEE ICDE'09. Piscataway, NJ: IEEE, 2009: 880-891
88. Christen P. Automatic record linkage using seeded nearest neighbor and support vector machine classification [C]//Proc of the 14th ACM SIGKDD Int Conf on Knowledge Discovery and Data Mining. New York: ACM, 2008: 151-159
89. Dong X, Halevy A, Madhavan J. Reference reconciliation in complex information spaces [C]//Proc of the 2005 ACM SIGMOD Int Conf on Management of Data. New York: ACM, 2005: 85-96
90. Singla P, Domingos P. Collective object identification [C]//Proc of the 19th Int Joint Conf on Artificial Intelligence. San Francisco, CA: Morgan Kaufmann, 2005: 1636-1637
91. Rastogi V, Dalvi N, Garofalakis M. Large-scale collective entity matching [J]. Proceedings of the VLDB Endowment, 2011, 4(4): 208-218
92. McCallum A, Nigam K, Ungar L H. Efficient clustering of high-dimensional data sets with application to reference matching [C]//Proc of the 6th ACM SIGKDD Int Conf on Knowledge Discovery and Data Mining. New York: ACM, 2000: 169-178
93. Kim H, Lee D. HARRA: Fast iterative hashed record linkage for large-scale data collections [C]//Proc of the 13th Int Conf on Extending Database Technology. New York: ACM, 2010: 525-536
94. Kirsten T, Kolb L, Hartung M, et al. Data partitioning for parallel entity matching [J]. Proceedings of the VLDB Endowment, 2010, 3(2): 1-8
95. Bilenko M, Kamath B, Mooney R J. Adaptive blocking: Learning to scale up record linkage [C]//Proc of IEEE ICDM'06. Piscataway, NJ: IEEE, 2006: 87-96
96. Whang S E, Menestrina D, Koutrika G, et al. Entity resolution with iterative blocking [C]//Proc of the 35th SIGMOD Int Conf on Management of Data. New York: ACM, 2009: 219-232
97. Baxter R, Christen P, Churches T. A comparison of fast blocking methods for record linkage [C]//Proc of ACM SIGKDD Workshop. New York: ACM, 2003: 25-27
98. Vernica R, Carey M J, Li C. Efficient parallel set-similarity joins using MapReduce [C]//Proc of the 2010 Int Conf on Management of Data. New York: ACM, 2010: 495-506
99. Sarawagi S, Deshpande V S, Kasliwal S. Efficient top-k count queries over imprecise duplicates [C]//Proc of the 12th Int Conf on Extending Database Technology: Advances in Database Technology. New York: ACM, 2009: 450-461
100. Whang S E, Garcia-Molina H. Entity resolution with evolving rules [J]. Proceedings of the VLDB Endowment, 2010, 3(1/2): 1326-1337
101. Koudas N, Marathe A, Srivastava D. Flexible string matching against large databases in practice [C]//Proc of the 30th Int Conf on Very Large Databases. San Francisco, CA: Morgan Kaufmann, 2004: 1078-1086
102. Chaudhuri S, Ganti V, Kaushik R. A primitive operator for similarity joins in data cleaning [C]//Proc of IEEE ICDE'06. Piscataway, NJ: IEEE, 2006: 5-5
103. Behm A, Ji S, Li C, et al. Space-constrained gram-based indexing for efficient approximate string search [C]//Proc of IEEE ICDE'09. Piscataway, NJ: IEEE, 2009: 604-615
104. Xiao Chuan, Wang Wei, Lin Xuemin, et al. Efficient similarity joins for near-duplicate detection [J]. ACM Trans on Database Systems (TODS), 2011, 36(3): 15
105. Papapetrou P, Athitsos V, Kollios G, et al. Reference-based alignment in large sequence databases [J]. Proceedings of the VLDB Endowment, 2009, 2(1): 205-216
106. Yang Xiaochun, Wang Bin, Li Chen. Cost-based variable-length-gram selection for string collections to support approximate queries efficiently [C]//Proc of the 2008 ACM SIGMOD Int Conf on Management of Data. New York: ACM, 2008: 353-364
107. Li Chen, Wang Bin, Yang Xiaochun. VGRAM: Improving performance of approximate queries on string collections using variable-length grams [C]//Proc of the 33rd Int Conf on Very Large Databases. San Francisco, CA: Morgan Kaufmann, 2007: 303-314
108. Li Chen, Lu Jiaheng, Lu Yiming. Efficient merging and filtering algorithms for approximate string searches [C]//Proc of IEEE ICDE'08. Piscataway, NJ: IEEE, 2008: 257-266
109. Lieberman M D, Sankaranarayanan J, Samet H. A fast similarity join algorithm using graphics processing units [C]//Proc of IEEE ICDE'08. Piscataway, NJ: IEEE, 2008: 1111-1120
110. Flesca S, Manco G, Masciari E, et al. Fast detection of XML structural similarity [J]. IEEE Trans on Knowledge and Data Engineering, 2005, 17(2): 160-175
111. Tatikonda S, Parthasarathy S. Hashing tree-structured data: Methods and applications [C]//Proc of IEEE ICDE'10. Piscataway, NJ: IEEE, 2010: 429-440
112. Christen P. Development and user experiences of an open source data cleaning, deduplication and record linkage system [J]. ACM SIGKDD Explorations Newsletter, 2009, 11(1): 39-48
113. Benjelloun O, Garcia-Molina H, Menestrina D, et al. Swoosh: a generic approach to entity resolution [J]. The International Journal on Very Large Databases, 2009, 18(1): 255-276
114. Chaudhuri S, Chen B C, Ganti V, et al. Example-driven design of efficient record matching queries [C]//Proc of the 33rd Int Conf on Very Large Databases. San Francisco, CA: Morgan Kaufmann, 2007: 327-338
115. Chen Z, Kalashnikov D V, Mehrotra S. Exploiting context analysis for combining multiple entity resolution systems [C]//Proc of the 35th SIGMOD Int Conf on Management of Data. New York: ACM, 2009: 207-218
116. Cohen W W, Ravikumar P, Fienberg S E. A comparison of string distance metrics for name-matching tasks [C]//Proc of the IJCAI-2003 Workshop on Information Integration on the Web. 2003: 73-78
117. Neiling M, Jurk S, Lenz H J, et al. Object identification quality [C]//Proc of the Int Workshop on Data Quality in Cooperative Information Systsems (DQCIS). Berlin: Springer, 2003: 1-10
118. Weis M, Naumann F, Brosy F. A duplicate detection benchmark for XML (and relational) data [C]//Proc of Workshop on Information Quality for Information Systems (IQIS). New York: VLDB Endowment, 2006: 1-19
119. Köpcke H, Thor A, Rahm E. Evaluation of entity resolution approaches on real-world match problems [J]. Proceedings of the VLDB Endowment, 2010, 3(1/2): 484-493
120. Köpcke H, Thor A, Rahm E. Comparative evaluation of entity resolution approaches with FEVER [J]. Proceedings of the VLDB Endowment, 2009, 2(2): 1574-1577
121. Köpcke H, Rahm E. Frameworks for entity matching: A comparison [J]. Data & Knowledge Engineering, 2010, 69(2): 197-210
122. Menestrina D, Whang S E, Garcia-Molina H. Evaluating entity resolution results [J]. Proceedings of the VLDB Endowment, 2010, 3(1/2): 208-219
123. Bohannon P, Fan Wenfei, Flaster M, et al. A cost-based model and effective heuristic for repairing constraints by value modification [C]//Proc of the 2005 ACM SIGMOD Int Conf on Management of Data. New York: ACM, 2005: 143-154
124. Cong Gao, Fan Wenfei, Geerts F, et al. Improving data quality: Consistency and accuracy [C]//Proc of the 33rd Int Conf on Very Large Databases. San Francisco, CA: Morgan Kaufmann, 2007: 315-326
125. Beskales G, Ilyas I F, Golab L. Sampling the repairs of functional dependency violations under hard constraints [J]. Proceedings of the VLDB Endowment, 2010, 3(1/2): 197-207
126. Lian Xiang, Chen Lei, Song Shaoxu. Consistent query answers in inconsistent probabilistic databases [C]//Proc of the 2010 Int Conf on Management of Data. New York: ACM, 2010: 303-314
127. Xie Junyi, Yang Jun, Chen Yuguo, et al. A sampling-based approach to information recovery [C]//Proc of IEEE ICDE'08. Piscataway, NJ: IEEE, 2008: 476-485
128. Jeffery S R, Garofalakis M, Franklin M J. Adaptive cleaning for RFID data streams [C]//Proc of the 32nd Int Conf on Very Large Databases. San Francisco, CA: Morgan Kaufmann, 2006: 163-174
129. Chen Haiquan, Ku W S, Wang Haixun, et al. Leveraging spatio-temporal redundancy for RFID data cleansing [C]//Proc of the 2010 ACM SIGMOD Int Conf on Management of Data. New York: ACM, 2010: 51-62
130. Zhuang Yongzhen, Chen Lei. In-network outlier cleaning for data collection in sensor networks [C]//Proc of VLDB Workshop on CleanDB. New York: VLDB Endowment, 2006: 41-48
131. Bleiholder J, Szott S, Herschel M, et al. Subsumption and complementation as data fusion operators [C]//Proc of the 13th Int Conf on Extending Database Technology. New York: ACM, 2010: 513-524
132. Beskales G, Soliman M A, Ilyas I F, et al. Modeling and querying possible repairs in duplicate detection [J]. Proceedings of the VLDB Endowment, 2009, 2(1): 598-609
133. Andritsos P, Fuxman A, Miller R J. Clean answers over dirty databases: A probabilistic approach [C]//Proc of IEEE ICDE'06. Piscataway, NJ: IEEE, 2006: 30-30
134. Thor A, Rahm E. MOMA-a mapping-based object matching system [C]//Proc of the 3rd Biennial Conf on Innovative Data Systems Research (CIDR). Asilomar, USA: CIDRDB.ORG, 2007: 7-10
135. Hassanzadeh O, Chiang F, Lee H C, et al. Framework for evaluating clustering algorithms in duplicate detection [J]. Proceedings of the VLDB Endowment, 2009, 2(1): 1282-1293
136. Hassanzadeh O, Miller R J. Creating probabilistic databases from duplicated data [J]. The International Journal on Very Large Databases, 2009, 18(5): 1141-1166
137. Guo Songtao, Dong X L, Srivastava D, et al. Record linkage with uniqueness constraints and erroneous values [J]. Proceedings of the VLDB Endowment, 2010, 3(1/2): 417-428
138. Mayfield C, Neville J, Prabhakar S. ERACER: a database approach for statistical inference and data cleaning [C]//Proc of the 2010 Int Conf on Management of Data. New York: ACM, 2010: 75-86
139. Fuxman A D, Miller R J. First-order query rewriting for inconsistent databases [C]//Proc of the 10th Int Conf on Database Theory. Berlin: Springer, 2005: 337-351
140. Fuxman A, Fuxman D, Miller R J. ConQuer: A system for efficient querying over inconsistent databases [C]//Proc of the 31st Int Conf on Very Large Databases. San Francisco, CA: Morgan Kaufmann, 2005: 1354-1357
141. Motro A. Integrity=validity+completeness [J]. ACM Trans on Database Systems (TODS), 1989, 14(4): 480-502
142. Levy A. Obtaining complete answers from incomplete databases [C]//Proc of the 22nd Int Conf on Very Large Databases. San Francisco, CA: Morgan Kaufmann, 1996: 402-412
143. Khalefa M E, Mokbel M F, Levandoski J J. Skyline query processing for incomplete data [C]//Proc of IEEE ICDE'08. Piscataway, NJ: IEEE, 2008: 556-565
144. Sismanis Y, Wang L, Fuxman A, et al. Resolution-aware query answering for business intelligence [C]//Proc of IEEE ICDE'09. Piscataway, NJ: IEEE, 2009: 976-987
145. Cormode G, McGregor A. Approximation algorithms for clustering uncertain data [C]//Proc of the 27th ACM SIGMOD-SIGACT-SIGART Symp on Principles of Database Systems. New York: ACM, 2008: 191-200
146. Kriegel H P, Pfeifle M. Density-based clustering of uncertain data [C]//Proc of the 11th ACM SIGKDD Int Conf on Knowledge Discovery in Data Mining. New York: ACM, 2005: 672-677
147. Aggarwal C C, Li Yan, Wang Jianyong, et al. Frequent pattern mining with uncertain data [C]//Proc of the 15th ACM SIGKDD Int Conf on Knowledge Discovery and Data Mining. New York: ACM, 2009: 29-38
148. Bernecker T, Kriegel H P, Renz M, et al. Probabilistic frequent itemset mining in uncertain databases [C]//Proc of the 15th ACM SIGKDD Int Conf on Knowledge Discovery and Data Mining. New York: ACM, 2009: 119-128
149. Zou Zhaonian, Li Jianzhong, Gao Hong, et al. Mining frequent subgraph patterns from uncertain graph data [J]. IEEE Trans on Knowledge and Data Engineering, 2010, 22(9): 1203-1218
150. Zou Zhaonian, Gao Hong, Li Jianzhong. Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics [C]//Proc of the 16th ACM SIGKDD Int Conf on Knowledge Discovery and Data Mining. New York: ACM, 2010: 633-642
151. Li Jianzhong, Zou Zhaonian, Gao Hong. Mining frequent subgraphs over uncertain graph databases under probabilistic semantics [J]. The VLDB Journal, 2012, 21(6): 753-777
152. Zou Zhaonian, Li Jianzhong, Gao Hong, et al. Finding top-k maximal cliques in an uncertain graph [C]//Proc of IEEE ICDE'10. Piscataway, NJ: IEEE, 2010: 649-652
153. Liu Lin, Jin Ruoming, Aggrawal C C, et al. Reliable clustering on uncertain graphs [C]//Proc of IEEE ICDM'12. Piscataway, NJ: IEEE, 2012: 459-468
154. Jin Ruoming, Liu Lin, Ding Bolin, et al. Distance-constraint reachability computation in uncertain graphs [J]. Proceedings of the VLDB Endowment, 2011, 4(9): 551-562
155. Bieber M, Engelbart D, Furuta R, et al. Toward virtual community knowledge evolution [J]. Journal of Management Information Systems, 2002, 18(4): 11-35
156. Gendarmi D, Abbattista F, Lanubile F. Fostering knowledge evolution through community-based participation [C]//Proc of the 1st Workshop on Social and Collaborative Construction of Structured Knowledge at WWW. Tiburg, Netherlands: CEUR-WS.org, 2007: 1-7
157. Kuo C S, Hong T P, Chen C L. A knowledge-evolution strategy based on genetic programming [C]//Proc of the 2008 Int Conf on Convergence and Hybrid Information Technology. Piscataway, NJ: IEEE, 2008: 43-48
158. Qin Biao, Xia Yuni, Prabhakar S. Rule induction for uncertain data [J]. Knowledge and Information Systems, 2011, 29(1): 103-130
159. Gao Chuancong, Wang Jianyong. Direct mining of discriminative patterns for classifying uncertain data [C]//Proc of the 16th ACM SIGKDD Int Conf on Knowledge Discovery and Data Mining. New York: ACM, 2010: 861-870