메뉴 건너뛰기




Volumn 8, Issue 10 10, 2015, Pages 1082-1093

Functional dependency discovery: An experimental evaluation of seven algorithms

Author keywords

[No Author keywords available]

Indexed keywords

COMPREHENSIVE COMPARISONS; DATA CHARACTERISTICS; DATA CLEANSING; DATABASE RESEARCH; DEPENDENCY DISCOVERY; EXPERIMENTAL EVALUATION; FUNCTIONAL DEPENDENCY; NORMALISATION; REAL-WORLD; TEST SPACE;

EID: 84937979352     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2794367.2794377     Document Type: Chapter
Times cited : (198)

References (22)
  • 5
    • 85199308562 scopus 로고    scopus 로고
    • FDEP home page, Accessed, 02-26
    • FDEP home page. www.cs.bris.ac.uk/~flach/fdep. Accessed: 2015-02-26.
    • (2015)
  • 6
    • 0033350089 scopus 로고    scopus 로고
    • Database dependency discovery: a machine learning approach
    • P. A. Flach and I. Savnik. Database dependency discovery: a machine learning approach. AI Communications, 12(3):139-160, 1999.
    • (1999) AI Communications , vol.12 , Issue.3 , pp. 139-160
    • Flach, P.A.1    Savnik, I.2
  • 7
    • 0345201769 scopus 로고    scopus 로고
    • 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. The Computer Journal, 42(2):100-111, 1999.
    • (1999) The Computer Journal , vol.42 , Issue.2 , pp. 100-111
    • Huhtala, Y.1    Kärkkäinen, J.2    Porkka, P.3    Toivonen, H.4
  • 10
    • 0029373303 scopus 로고
    • Approximate inference of functional dependencies from relations
    • J. Kivinen and H. Mannila. Approximate inference of functional dependencies from relations. Theor. Comput. Sci., 149(1):129-149, 1995.
    • (1995) Theor. Comput. Sci. , vol.149 , Issue.1 , pp. 129-149
    • Kivinen, J.1    Mannila, H.2
  • 13
    • 0000300428 scopus 로고
    • On the complexity of inferring functional dependencies
    • H. Mannila and K.-J. Räihä. On the complexity of inferring functional dependencies. Discrete Appl. Math., 40:237-243, 1992.
    • (1992) Discrete Appl. Math. , vol.40 , pp. 237-243
    • Mannila, H.1    Räihä, K.-J.2
  • 15
    • 0035501368 scopus 로고    scopus 로고
    • Functional and embedded dependency inference: a data mining point of view
    • N. Novelli and R. Cicchetti. Functional and embedded dependency inference: a data mining point of view. Information Systems, 26(7):477-506, 2001.
    • (2001) Information Systems , vol.26 , Issue.7 , pp. 477-506
    • Novelli, N.1    Cicchetti, R.2
  • 16
    • 85152626023 scopus 로고
    • Efficiently inducing determinations:A complete and systematic search algorithm that uses optimal pruning
    • J. C. Schlimmer. Efficiently inducing determinations:A complete and systematic search algorithm that uses optimal pruning. In In Proceedings of the International Conference on Machine Learning (ICML), pages 284-290, 1993.
    • (1993) In Proceedings of the International Conference on Machine Learning (ICML) , pp. 284-290
    • Schlimmer, J.C.1
  • 17
    • 85199306122 scopus 로고    scopus 로고
    • Tane home page, Accessed, 02-26
    • Tane home page. www.cs.helsinki.fi/research/ fdk/datamining/tane/. Accessed: 2015-02-26.
    • (2015)
  • 18
    • 85199255931 scopus 로고    scopus 로고
    • UCI machine learning repository, Accessed, 02-26
    • UCI machine learning repository. http://archive.ics.uci.edu/ml. Accessed:2015-02-26.
    • (2015)


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.