메뉴 건너뛰기




Volumn 2006, Issue , 2005, Pages 1003-1007

Inductive databases: Towards a new generation of databases for knowledge discovery

Author keywords

[No Author keywords available]

Indexed keywords

KNOWLEDGE DISCOVERY PROCESS (KDD); RAW DATA; STATE OF THE ART;

EID: 33749046507     PISSN: 15294188     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DEXA.2005.116     Document Type: Conference Paper
Times cited : (5)

References (35)
  • 2
    • 13844279020 scopus 로고    scopus 로고
    • An xml based environment in support of the overall kdd process
    • P. Alcamo, F. Domenichini, and F. Turini. An xml based environment in support of the overall kdd process. In FQAS, 2000.
    • (2000) FQAS
    • Alcamo, P.1    Domenichini, F.2    Turini, F.3
  • 4
    • 33749062633 scopus 로고    scopus 로고
    • Discovering interesting information in xml data with association rules
    • D. Braga, A. Campi, S. Ceri, M. Klemettinen, and P. L. Lanzi. Discovering interesting information in xml data with association rules. In ACM SAC, 2003.
    • (2003) ACM SAC
    • Braga, D.1    Campi, A.2    Ceri, S.3    Klemettinen, M.4    Lanzi, P.L.5
  • 8
    • 0011177327 scopus 로고    scopus 로고
    • Dzeroski, N. Lavrac, and S. D. (Ed.). Springer Verlag, NY
    • Dzeroski, N. Lavrac, and S. D. (Ed.). Relational Data Mining. Springer Verlag, NY, 2001.
    • (2001) Relational Data Mining
  • 9
    • 0001741607 scopus 로고    scopus 로고
    • Spirit: Sequential pattern mining with regular expression constraints
    • M. M. Garofalakis, R. Rastogi, and K. Shim. Spirit: Sequential pattern mining with regular expression constraints. In Proc. VLDB'99, 1999.
    • (1999) Proc. VLDB'99
    • Garofalakis, M.M.1    Rastogi, R.2    Shim, K.3
  • 10
    • 84889246013 scopus 로고    scopus 로고
    • Specifying mining algorithms with iterative user-defined aggregates: A case study
    • F. Giannotti, G. Manco, and F. Turini. Specifying mining algorithms with iterative user-defined aggregates: A case study. In PKDD, 2001.
    • (2001) PKDD
    • Giannotti, F.1    Manco, G.2    Turini, F.3
  • 12
    • 0030284618 scopus 로고    scopus 로고
    • A database perspective on knowledge discovery
    • November
    • T. Imielinski and H. Mannila. A database perspective on knowledge discovery. Coomunications of the ACM, 39(11):58-64, November 1996.
    • (1996) Coomunications of the ACM , vol.39 , Issue.11 , pp. 58-64
    • Imielinski, T.1    Mannila, H.2
  • 13
    • 9444296505 scopus 로고    scopus 로고
    • Datamine: Application programming interface and query language for database mining
    • T. Imielinski, A. Virmani, and A. Abdoulghani. Datamine: Application programming interface and query language for database mining. KDD-96, pages 256-260, 1996.
    • (1996) KDD-96 , pp. 256-260
    • Imielinski, T.1    Virmani, A.2    Abdoulghani, A.3
  • 14
    • 0029373303 scopus 로고
    • Approximate dependency inference from relations
    • J. Kivinen and H. Mannila. Approximate dependency inference from relations. Theoretical Computer Science, 149(1), 1995.
    • (1995) Theoretical Computer Science , vol.149 , Issue.1
    • Kivinen, J.1    Mannila, H.2
  • 15
    • 0029221256 scopus 로고
    • Efficient discovery of interesting statements in databases
    • W. Kloesgen. Efficient discovery of interesting statements in databases. Journal of Intelligent Information Systems, 4(1), 1995.
    • (1995) Journal of Intelligent Information Systems , vol.4 , Issue.1
    • Kloesgen, W.1
  • 16
    • 33749076954 scopus 로고    scopus 로고
    • A relational database mining framework with classification and discretization
    • June
    • P. Lanzi and G. Psaila. A relational database mining framework with classification and discretization. SEBD-99 Sistemi Evoluti per Basi di Dati, June 1999.
    • (1999) SEBD-99 Sistemi Evoluti per Basi di Dati
    • Lanzi, P.1    Psaila, G.2
  • 19
    • 21944442464 scopus 로고    scopus 로고
    • Levelwise search and borders of theories in knowledge discovery
    • H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3), 1997.
    • (1997) Data Mining and Knowledge Discovery , vol.1 , Issue.3
    • Mannila, H.1    Toivonen, H.2
  • 20
    • 33749065426 scopus 로고    scopus 로고
    • Optimizing inductive queries in frequent itemset mining
    • Università di Torino, Italy, May
    • M.Botta, R.Esposito, A.Gallo, and R.Meo. Optimizing inductive queries in frequent itemset mining. Technical Report RT79-2004, Università di Torino, Italy, May 2004.
    • (2004) Technical Report , vol.RT79-2004
    • Botta, M.1    Esposito, R.2    Gallo, A.3    Meo, R.4
  • 24
    • 0003024181 scopus 로고    scopus 로고
    • A new SQL-like operator for mining association rules
    • Bombay, India, September
    • R. Meo, G. Psaila, and S. Ceri. A new SQL-like operator for mining association rules. In Proceedings of the 22st VLDB Conference, Bombay, India, September 1996.
    • (1996) Proceedings of the 22st VLDB Conference
    • Meo, R.1    Psaila, G.2    Ceri, S.3
  • 25
    • 0032092760 scopus 로고    scopus 로고
    • Exploratory mining and pruning optimizations of constrained association rules
    • Seattle, WA
    • R. Ng, L. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained association rules. In Proc. ACM SIGMOD'98, pages 13-24, Seattle, WA, 1998.
    • (1998) Proc. ACM SIGMOD'98 , pp. 13-24
    • Ng, R.1    Lakshmanan, L.2    Han, J.3    Pang, A.4
  • 26
    • 85166320097 scopus 로고    scopus 로고
    • A belief-driven method for discovering unexpected patterns
    • B. Padmanabhan and A. Tuzhilin. A belief-driven method for discovering unexpected patterns. In KDD, 1998.
    • (1998) KDD
    • Padmanabhan, B.1    Tuzhilin, A.2
  • 28
    • 0033096890 scopus 로고    scopus 로고
    • Efficient mining of association rules using closed itemset lattices
    • N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rules using closed itemset lattices. Information Systems, 1(24), 1999.
    • (1999) Information Systems , vol.1 , Issue.24
    • Pasquier, N.1    Bastide, Y.2    Taouil, R.3    Lakhal, L.4
  • 29
    • 84954451051 scopus 로고    scopus 로고
    • A logical database mining query language
    • L. D. Raedt. A logical database mining query language. In ILP, 2000.
    • (2000) ILP
    • Raedt, L.D.1
  • 32
    • 23044518930 scopus 로고    scopus 로고
    • Integrating association rule mining with relational database systems: Alternatives and implications
    • S. Sarawagi, S. Thomas, and R. Agrawal. Integrating association rule mining with relational database systems: Alternatives and implications. Data Min. Knowl. Discov., 4(2/3), 2000.
    • (2000) Data Min. Knowl. Discov. , vol.4 , Issue.2-3
    • Sarawagi, S.1    Thomas, S.2    Agrawal, R.3
  • 33
    • 85162588849 scopus 로고    scopus 로고
    • Mining association rules with item constraints
    • Newport Beach, California
    • R. Srikant, Q. Vu, and R. Agrawal. Mining association rules with item constraints. In Proc. KDD'97, Newport Beach, California, 1997.
    • (1997) Proc. KDD'97
    • Srikant, R.1    Vu, Q.2    Agrawal, R.3
  • 34
    • 0242456825 scopus 로고    scopus 로고
    • Querying multiple sets of discovered rules
    • A. Tuzhilin and B. Liu. Querying multiple sets of discovered rules. In Proc. 8th ACM SIGKDD, 2002.
    • (2002) Proc. 8th ACM SIGKDD
    • Tuzhilin, A.1    Liu, B.2


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