-
1
-
-
80052365341
-
Differential dependencies: Reasoning and discovery
-
S. Song and L. Chen, "Differential dependencies: Reasoning and discovery," ACM TODS, vol. 36, no. 3, Article 16, 2011.
-
(2011)
ACM TODS
, vol.36
, Issue.3
-
-
Song, S.1
Chen, L.2
-
3
-
-
34548731840
-
Conditional functional dependencies for data cleaning
-
Istanbul, Turkey
-
P. Bohannon, W. Fan, F. Geerts, X. Jia, and A. Kementsietsidis, "Conditional functional dependencies for data cleaning," in Proc. IEEE 23rd ICDE, Istanbul, Turkey, 2007, pp. 746-755.
-
(2007)
Proc. IEEE 23rd ICDE
, pp. 746-755
-
-
Bohannon, P.1
Fan, W.2
Geerts, F.3
Jia, X.4
Kementsietsidis, A.5
-
4
-
-
57549084481
-
Dependencies revisited for improving data quality
-
Vancouver, BC, Canada
-
W. Fan, "Dependencies revisited for improving data quality," in Proc. 27th PODS, Vancouver, BC, Canada, 2008, pp. 159-170.
-
(2008)
Proc. 27th PODS
, pp. 159-170
-
-
Fan, W.1
-
5
-
-
84959912087
-
Improving data quality: Consistency and accuracy
-
Vienna, Austria
-
G. Cong, W. Fan, F. Geerts, X. Jia, and S. Ma, "Improving data quality: Consistency and accuracy," in Proc. 33rd Int. Conf. VLDB, Vienna, Austria, 2007, pp. 315-326.
-
(2007)
Proc. 33rd Int. Conf. VLDB
, pp. 315-326
-
-
Cong, G.1
Fan, W.2
Geerts, F.3
Jia, X.4
Ma, S.5
-
6
-
-
2342447399
-
Adaptive name matching in information integration
-
Sept
-
M. Bilenko, R. J. Mooney, W. W. Cohen, P. Ravikumar, and S. E. Fienberg, "Adaptive name matching in information integration," IEEE Intell. Syst., vol. 18, no. 5, pp. 16-23, Sept. 2003.
-
(2003)
IEEE Intell. Syst.
, vol.18
, Issue.5
, pp. 16-23
-
-
Bilenko, M.1
Mooney, R.J.2
Cohen, W.W.3
Ravikumar, P.4
Fienberg, S.E.5
-
7
-
-
67649655745
-
Metric functional dependencies
-
Shanghai, China
-
N. Koudas, A. Saha, D. Srivastava, and S. Venkatasubramanian, "Metric functional dependencies," in Proc. IEEE 25th ICDE, Shanghai, China, 2009, pp. 1275-1278.
-
(2009)
Proc. IEEE 25th ICDE
, pp. 1275-1278
-
-
Koudas, N.1
Saha, A.2
Srivastava, D.3
Venkatasubramanian, S.4
-
8
-
-
84865086832
-
Reasoning about record matching rules
-
W. Fan, J. Li, X. Jia, and S. Ma, "Reasoning about record matching rules," PVLDB, vol. 2, no. 1, pp. 407-418, 2009.
-
(2009)
PVLDB
, vol.2
, Issue.1
, pp. 407-418
-
-
Fan, W.1
Li, J.2
Jia, X.3
Ma, S.4
-
9
-
-
0345201769
-
Tane: An efficient algorithm for discovering functional and approximate dependencies
-
Y. Huhtala, J. Kärkkäinen, P. Porkka, and H. Toivonen, "Tane: An efficient algorithm for discovering functional and approximate dependencies," Comput. J., vol. 42, no. 2, pp. 100-111, 1999.
-
(1999)
Comput. J.
, vol.42
, Issue.2
, pp. 100-111
-
-
Huhtala, Y.1
Kärkkäinen, J.2
Porkka, P.3
Toivonen, H.4
-
10
-
-
0029373303
-
Approximate inference of functional dependencies from relations
-
J. Kivinen and H. Mannila, "Approximate inference of functional dependencies from relations," Theor. Comput. Sci., vol. 149, no. 1, pp. 129-149, 1995.
-
(1995)
Theor. Comput. Sci.
, vol.149
, Issue.1
, pp. 129-149
-
-
Kivinen, J.1
Mannila, H.2
-
11
-
-
0041902248
-
Searching for dependencies at multiple abstraction levels
-
T. Calders, R. T. Ng, and J. Wijsen, "Searching for dependencies at multiple abstraction levels," ACM TODS, vol. 27, no. 3, pp. 229-260, 2002.
-
(2002)
ACM TODS
, vol.27
, Issue.3
, pp. 229-260
-
-
Calders, T.1
Ng, R.T.2
Wijsen, J.3
-
12
-
-
84885874596
-
Neighborhood dependencies for prediction
-
Hong Kong, China
-
R. Bassée and J. Wijsen, "Neighborhood dependencies for prediction," in Proc. 5th PAKDD, Hong Kong, China, 2001, pp. 562-567.
-
(2001)
Proc. 5th PAKDD
, pp. 562-567
-
-
Bassée, R.1
Wijsen, J.2
-
13
-
-
57449119633
-
Checks and balances: Monitoring data quality problems in network traffic databases
-
Berlin, Germany
-
F. Korn, S. Muthukrishnan, and Y. Zhu, "Checks and balances: Monitoring data quality problems in network traffic databases," in Proc. 29th Int. Conf. VLDB, Berlin, Germany, 2003, pp. 536-547.
-
(2003)
Proc. 29th Int. Conf. VLDB
, pp. 536-547
-
-
Korn, F.1
Muthukrishnan, S.2
Zhu, Y.3
-
14
-
-
33745531232
-
Data tables with similarity relations: Functional dependencies, complete rules and nonredundant bases
-
Singapore
-
R. Belohlávek and V. Vychodil, "Data tables with similarity relations: Functional dependencies, complete rules and nonredundant bases," in Proc. DASFAA, Singapore, 2006, pp. 644-658.
-
(2006)
Proc. DASFAA
, pp. 644-658
-
-
Belohlávek, R.1
Vychodil, V.2
-
15
-
-
79960451998
-
Dynamic constraints for record matching
-
W. Fan, H. Gao, X. Jia, J. Li, and S. Ma, "Dynamic constraints for record matching," VLDB J., Vol. 20, no. 4, pp. 1-26, 2010.
-
(2010)
VLDB J.
, vol.20
, Issue.4
, pp. 1-26
-
-
Fan, W.1
Gao, H.2
Jia, X.3
Li, J.4
Ma, S.5
-
16
-
-
79957864063
-
On data dependencies in dataspaces
-
Hannover, Germany
-
S. Song, L. Chen, and P. S. Yu, "On data dependencies in dataspaces," in Proc. IEEE 27th ICDE, Hannover, Germany, 2011, pp. 470-481.
-
(2011)
Proc. IEEE 27th ICDE
, pp. 470-481
-
-
Song, S.1
Chen, L.2
Yu, P.S.3
-
17
-
-
80052369619
-
Sequential dependencies
-
L. Golab, H. J. Karloff, F. Korn, A. Saha, and D. Srivastava, "Sequential dependencies," PVLDB, vol. 2, no. 1, pp. 574-585, 2009.
-
(2009)
PVLDB
, vol.2
, Issue.1
, pp. 574-585
-
-
Golab, L.1
Karloff, H.J.2
Korn, F.3
Saha, A.4
Srivastava, D.5
-
18
-
-
0028377853
-
Algorithms for inferring functional dependencies from relations
-
H. Mannila and K.-J. Räihä, "Algorithms for inferring functional dependencies from relations," Data Knowl. Eng., vol. 12, no. 1, pp. 83-99, 1994.
-
(1994)
Data Knowl. Eng.
, vol.12
, Issue.1
, pp. 83-99
-
-
Mannila, H.1
Räihä, K.-J.2
-
19
-
-
85152626023
-
Efficiently inducing determinations: A complete and systematic search algorithm that uses optimal pruning
-
Amherst, MA, USA
-
J. C. Schlimmer, "Efficiently inducing determinations: A complete and systematic search algorithm that uses optimal pruning," in Proc. ICML, Amherst, MA, USA, 1993, pp. 284-290.
-
(1993)
Proc. ICML
, pp. 284-290
-
-
Schlimmer, J.C.1
-
20
-
-
0344109301
-
Efficient search for strong partial determinations
-
S. Kramer and B. Pfahringer, "Efficient search for strong partial determinations," in Proc. KDD, 1996, pp. 371-374.
-
(1996)
Proc. KDD
, pp. 371-374
-
-
Kramer, S.1
Pfahringer, B.2
-
21
-
-
0031649138
-
Efficient discovery of functional and approximate dependencies using partitions
-
Orlando, FL, USA
-
Y. Huhtala, J. Kärkkäinen, P. Porkka, and H. Toivonen, "Efficient discovery of functional and approximate dependencies using partitions," in Proc. 14th ICDE, Orlando, FL, USA, 1998, pp. 392-401.
-
(1998)
Proc. 14th ICDE
, pp. 392-401
-
-
Huhtala, Y.1
Kärkkäinen, J.2
Porkka, P.3
Toivonen, H.4
-
22
-
-
84958780501
-
FastFDs: A heuristic-driven, depth-first algorithm for mining functional dependencies from relation instances - extended abstract
-
Münich, Germany
-
C. M. Wyss, C. Giannella, and E. L. Robertson, "FastFDs: A heuristic-driven, depth-first algorithm for mining functional dependencies from relation instances - extended abstract," in Proc. DaWaK, Münich, Germany, 2001, pp. 101-110.
-
(2001)
Proc. DaWaK
, pp. 101-110
-
-
Wyss, C.M.1
Giannella, C.2
Robertson, E.L.3
-
23
-
-
0033350089
-
Database dependency discovery: A machine learning approach
-
P. A. Flach and I. Savnik, "Database dependency discovery: A machine learning approach," AI Commun., vol. 12, no. 3, pp. 139-160, 1999.
-
(1999)
AI Commun.
, vol.12
, Issue.3
, pp. 139-160
-
-
Flach, P.A.1
Savnik, I.2
-
24
-
-
67649641438
-
Discovering conditional functional dependencies
-
Shanghai, China
-
W. Fan, F. Geerts, L. V. S. Lakshmanan, and M. Xiong, "Discovering conditional functional dependencies," in Proc. IEEE ICDE, Shanghai, China, 2009, pp. 1231-1234.
-
(2009)
Proc. IEEE ICDE
, pp. 1231-1234
-
-
Fan, W.1
Geerts, F.2
Lakshmanan, L.V.S.3
Xiong, M.4
-
25
-
-
74549201636
-
Discovering matching dependencies
-
New York, NY, USA
-
S. Song and L. Chen, "Discovering matching dependencies," in Proc. 18th CIKM, New York, NY, USA, 2009, pp. 1421-1424.
-
(2009)
Proc. 18th CIKM
, pp. 1421-1424
-
-
Song, S.1
Chen, L.2
-
26
-
-
70349846180
-
On generating near-optimal tableaux for conditional functional dependencies
-
L. Golab, H. J. Karloff, F. Korn, D. Srivastava, and B. Yu, "On generating near-optimal tableaux for conditional functional dependencies," PVLDB, vol. 1, no. 1, pp. 376-390, 2008.
-
(2008)
PVLDB
, vol.1
, Issue.1
, pp. 376-390
-
-
Golab, L.1
Karloff, H.J.2
Korn, F.3
Srivastava, D.4
Yu, B.5
-
27
-
-
74549188261
-
Discovering data quality rules
-
F. Chiang and R. J. Miller, "Discovering data quality rules," PVLDB, vol. 1, no. 1, pp. 1166-1177, 2008.
-
(2008)
PVLDB
, vol.1
, Issue.1
, pp. 1166-1177
-
-
Chiang, F.1
Miller, R.J.2
-
28
-
-
0027621699
-
Mining association rules between sets of items in large databases
-
Washington, DC, USA
-
R. Agrawal, T. Imielinski, and A. N. Swami, "Mining association rules between sets of items in large databases," in Proc. SIGMOD, Washington, DC, USA, 1993, pp. 207-216.
-
(1993)
Proc. SIGMOD
, pp. 207-216
-
-
Agrawal, R.1
Imielinski, T.2
Swami, A.N.3
-
29
-
-
78149328321
-
Mining top-k frequent closed patterns without minimum support
-
Washington, DC, USA
-
J. Han, J. Wang, Y. Lu, and P. Tzvetkov, "Mining top-k frequent closed patterns without minimum support," in Proc. IEEE ICDM, Washington, DC, USA, 2002, pp. 211-218.
-
(2002)
Proc. IEEE ICDM
, pp. 211-218
-
-
Han, J.1
Wang, J.2
Lu, Y.3
Tzvetkov, P.4
-
30
-
-
14844340628
-
K-optimal rule discovery
-
G. I. Webb and S. Zhang, "K-optimal rule discovery," Data Min. Knowl. Discov., vol. 10, no. 1, pp. 39-79, 2005.
-
(2005)
Data Min. Knowl. Discov.
, vol.10
, Issue.1
, pp. 39-79
-
-
Webb, G.I.1
Zhang, S.2
-
31
-
-
33749539847
-
Finding association rules that trade support optimally against confidence
-
T. Scheffer, "Finding association rules that trade support optimally against confidence," Intell. Data Anal., vol. 9, no. 4, pp. 381-395, 2005.
-
(2005)
Intell. Data Anal.
, vol.9
, Issue.4
, pp. 381-395
-
-
Scheffer, T.1
-
32
-
-
0345566149
-
A guided tour to approximate string matching
-
G. Navarro, "A guided tour to approximate string matching," ACM CSUR, vol. 33, no. 1, pp. 31-88, 2001.
-
(2001)
ACM CSUR
, vol.33
, Issue.1
, pp. 31-88
-
-
Navarro, G.1
-
33
-
-
0032091575
-
Integration of heterogeneous databases without common domains using queries based on textual similarity
-
Washington, DC, USA
-
W. W. Cohen, "Integration of heterogeneous databases without common domains using queries based on textual similarity," in Proc. SIGMOD, Washington, DC, USA, 1998, pp. 201-212.
-
(1998)
Proc. SIGMOD
, pp. 201-212
-
-
Cohen, W.W.1
-
34
-
-
12244301995
-
Searching with numbers
-
New York, NY, USA
-
R. Agrawal and R. Srikant, "Searching with numbers," in Proc. 11th Int. Conf. WWW, New York, NY, USA, 2002, pp. 420-431.
-
(2002)
Proc. 11th Int. Conf. WWW
, pp. 420-431
-
-
Agrawal, R.1
Srikant, R.2
-
36
-
-
84974710118
-
Average-case analysis of classification algorithms for Boolean functions and decision trees
-
Sydney, NSW, Australia
-
T. Scheffer, "Average-case analysis of classification algorithms for Boolean functions and decision trees," in Proc. ALT, Sydney, NSW, Australia, 2000, pp. 194-208.
-
(2000)
Proc. ALT
, pp. 194-208
-
-
Scheffer, T.1
-
37
-
-
0034592784
-
Efficient clustering of high-dimensional data sets with application to reference matching
-
New York, NY, USA
-
A. McCallum, K. Nigam, and L. H. Ungar, "Efficient clustering of high-dimensional data sets with application to reference matching," in Proc. KDD, New York, NY, USA, 2000, pp. 169-178.
-
(2000)
Proc. KDD
, pp. 169-178
-
-
McCallum, A.1
Nigam, K.2
Ungar, L.H.3
-
38
-
-
0012249331
-
Using q-grams in a DBMS for approximate string processing
-
Dec
-
L. Gravano et al., "Using q-grams in a DBMS for approximate string processing," IEEE Data Eng. Bull., vol. 24, no. 4, pp. 28-34, Dec. 2001.
-
(2001)
IEEE Data Eng. Bull.
, vol.24
, Issue.4
, pp. 28-34
-
-
Gravano, L.1
|