메뉴 건너뛰기




Volumn 4, Issue 6, 2008, Pages 421-426

Mining functional dependency from relational databases using equivalent classes and minimal cover

Author keywords

Data mining; Equivalent classes; Functional dependencies; Minimal cover

Indexed keywords


EID: 56149109850     PISSN: 15493636     EISSN: None     Source Type: Journal    
DOI: 10.3844/jcssp.2008.421.426     Document Type: Article
Times cited : (7)

References (12)
  • 1
    • 0003408496 scopus 로고    scopus 로고
    • Dept. of Information and Computer Science, University of California, Irvine, CA
    • Blake, C.L. and C.J. Merz, 1998. UCI repository of machine learning databases. Dept. of Information and Computer Science, University of California, Irvine, CA. http://www.ist-world.org/ ResultPublicationDetails.aspx?ResultPublicationId= 166f0434fd5c422898e1ee4618d683f6.
    • (1998) UCI repository of machine learning databases
    • Blake, C.L.1    Merz, C.J.2
  • 2
    • 33751042942 scopus 로고    scopus 로고
    • Dorneich, A., R. Natarajan, E. Pednault and F. Tipu, 2006. Embedded predictive modeling in a parallel relational database. SAC'06, Dojan, France., April 23-27 2006, ACM 1-59593-108-2/06/004. pp: 569-574. http://portal.acm.org/citation.cfm?id=1141277.1141409.
    • Dorneich, A., R. Natarajan, E. Pednault and F. Tipu, 2006. Embedded predictive modeling in a parallel relational database. SAC'06, Dojan, France., April 23-27 2006, ACM 1-59593-108-2/06/004. pp: 569-574. http://portal.acm.org/citation.cfm?id=1141277.1141409.
  • 3
    • 0345201769 scopus 로고    scopus 로고
    • TANE: An efficient algorithm for discovering functional and approximate dependencies
    • Huhtala, Y., J. Kärkkäinen, P. Porkka and H. Toivonen, 1999. TANE: An efficient algorithm for discovering functional and approximate dependencies. Comput. J., 42: 100-111. http://www.citeulike.org/user/ seungwon/article/1648417
    • (1999) Comput. J , vol.42 , pp. 100-111
    • Huhtala, Y.1    Kärkkäinen, J.2    Porkka, P.3    Toivonen, H.4
  • 4
    • 33644920942 scopus 로고    scopus 로고
    • research issues in data stream association rule mining
    • Jiang, N. and L. Gruenwald, 2006. research issues in data stream association rule mining. ACM SIGMOD Record, 35: 14-19. http://doi.acm.org/10.1145/1121995.1121998.
    • (2006) ACM SIGMOD Record , vol.35 , pp. 14-19
    • Jiang, N.1    Gruenwald, L.2
  • 5
    • 0029373303 scopus 로고
    • Approximate inference of functional dependencies from relations
    • Jyrki Kivinen and Heikki Mannila, 1995. Approximate inference of functional dependencies from relations. Theor. Comput. Sci., 149: 129-149. http://portal.acm.org/ citation.cfm?id=210500.210505&dl=GUIDE&dl=ACM
    • (1995) Theor. Comput. Sci , vol.149 , pp. 129-149
    • Kivinen, J.1    Mannila, H.2
  • 6
    • 0029722706 scopus 로고    scopus 로고
    • Data mining: Machine learning, statistics and databases
    • Stockholm, Sweden. Los Alamitos, CA: IEEE Computer Society Press, June 18-20
    • Mannila, H., 1996. Data mining: Machine learning, statistics and databases. 8th International Conference on Scientific and Statistical Database Management, Stockholm, Sweden. Los Alamitos, CA: IEEE Computer Society Press, 1996. June 18-20. http://doi.ieeecomputersociety.org/ 10.1109/SSDM.1996.505910.
    • (1996) 8th International Conference on Scientific and Statistical Database Management
    • Mannila, H.1
  • 9
    • 35348903822 scopus 로고    scopus 로고
    • Mining web functional dependencies for flexible information access
    • Perugini, S. and N. Ramakrishnan, 2007. Mining web functional dependencies for flexible information access. J. Am. Soc. Inform. Sci. Technol., 58: 1805-1819. http://portal.acm.org/citation.cfm?id=1294889
    • (2007) J. Am. Soc. Inform. Sci. Technol , vol.58 , pp. 1805-1819
    • Perugini, S.1    Ramakrishnan, N.2
  • 10
    • 56149126559 scopus 로고    scopus 로고
    • Silberschatz, A., H.F. Korth and S. Sudarshan, 2006. Database System Concepts. 5th Edn. Boston, MA: McGraw-Hill. ISBN 007124476X. http://webcat.hud.ac.uk/ipac20/ipac.jsp?full= 3100001~!549638~!0&profile=cls.
    • Silberschatz, A., H.F. Korth and S. Sudarshan, 2006. Database System Concepts. 5th Edn. Boston, MA: McGraw-Hill. ISBN 007124476X. http://webcat.hud.ac.uk/ipac20/ipac.jsp?full= 3100001~!549638~!0&profile=cls.
  • 11
    • 84958780501 scopus 로고    scopus 로고
    • FastFDs: A heuristic-driven, depth-first algorithm for mining functional dependencies from relation instances
    • Munich, Germany Sept. 5-7, Springer. ISBN 978-3540425533 pp
    • Wyss, C. and C. Giannella and E. Robertson, 2001. FastFDs: A heuristic-driven, depth-first algorithm for mining functional dependencies from relation instances. In: Proceedings of 3rd International Conference of the Data Warehousing and Knowledge Discovery, Munich, Germany Sept. 5-7 2001, Springer. ISBN 978-3540425533 pp. 101-110. http://portal.acm.org/citation.cfm?id= 646110.679455&coll=GUIDE&dl=GUIDE.
    • (2001) Proceedings of 3rd International Conference of the Data Warehousing and Knowledge Discovery , pp. 101-110
    • Wyss, C.1    Giannella, C.2    Robertson, E.3


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