메뉴 건너뛰기




Volumn 2408, Issue PART2, 2002, Pages 526-547

Data mining as constraint logic programming

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER CIRCUITS; DATA MINING; PROLOG (PROGRAMMING LANGUAGE); QUERY LANGUAGES; QUERY PROCESSING; SEMANTICS;

EID: 23044533452     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45632-5_20     Document Type: Article
Times cited : (8)

References (30)
  • 2
    • 84958043653 scopus 로고    scopus 로고
    • Incremental refinement of mining queries
    • Mukesh K. Mohania, A. Min Tjoa (Eds.) Proceedings. Lecture Notes in Computer Science Springer Verlag
    • E. Baralis, G. Psaila. Incremental Refinement of Mining Queries. In Mukesh K. Mohania, A. Min Tjoa (Eds.) Data Warehousing and Knowledge Discovery, First International Conference DaWaK '99 Proceedings. Lecture Notes in Computer Science, Vol. 1676, Springer Verlag, pp. 173-182, 1999.
    • (1999) Data Warehousing and Knowledge Discovery, First International Conference DaWaK '99 , vol.1676 , pp. 173-182
    • Baralis, E.1    Psaila, G.2
  • 3
    • 84947721195 scopus 로고    scopus 로고
    • Heikki mannila: Querying inductive databases: A case study on the MINE RULE operator
    • Lecture Notes in Computer Science Springer Verlag
    • Jean-Francois Boulicaut, Mika Klemettinen, Heikki Mannila: Querying Inductive Databases: A Case Study on the MINE RULE Operator. In Proceedings of PKDD-98, Lecture Notes in Computer Science, Vol. 1510, Springer Verlag, pp. 194-202, 1998.
    • (1998) Proceedings of PKDD-98 , vol.1510 , pp. 194-202
    • Boulicaut, J.-F.1    Klemettinen, M.2
  • 5
    • 0034172470 scopus 로고    scopus 로고
    • Whirl: A word-based information representation language
    • W. Cohen, Whirl: a word-based information representation language. Artificial Intelligence, Vol. 118 (1-2), pp. 163-196, 2000.
    • (2000) Artificial Intelligence , vol.118 , Issue.1-2 , pp. 163-196
    • Cohen, W.1
  • 6
    • 84880088183 scopus 로고    scopus 로고
    • Finding frequent substructures in chemical compounds
    • AAAI Press
    • L. Dehaspe, H. Toivonen and R.D. King. Finding frequent substructures in chemical compounds, in Proceedings of KDD-98, AAAI Press, pp. 30-36, 1998.
    • (1998) Proceedings of KDD-98 , pp. 30-36
    • Dehaspe, L.1    Toivonen, H.2    King, R.D.3
  • 8
    • 79955672163 scopus 로고    scopus 로고
    • An inductive logic programming query language for database mining (Extended abstract)
    • Lecture Notes in Artificial Intelligence Springer Verlag
    • L. De Raedt, An inductive logic programming query language for database mining (Extended Abstract), in Proceedings of Artificial Intel ligence and Symbolic Computation, Lecture Notes in Artificial Intelligence, Vol. 1476, Springer Verlag, pp. 1-13, 1998.
    • (1998) Proceedings of Artificial Intel Ligence and Symbolic Computation , vol.1476 , pp. 1-13
    • De Raedt, L.1
  • 9
    • 84954451051 scopus 로고    scopus 로고
    • A logical database mining query language
    • Lecture Notes in Artificial Intelligence Springer Verlag
    • L. De Raedt, A Logical Database Mining Query Language. In Proceedings of the 10th Inductive Logic Programming Conference, Lecture Notes in Artificial Intelligence, Vol. 1866, Springer Verlag, pp. 78-92, 2000.
    • (2000) Proceedings of the 10th Inductive Logic Programming Conference , vol.1866 , pp. 78-92
    • De Raedt, L.1
  • 15
    • 0032650246 scopus 로고    scopus 로고
    • Constraint-based, multidimensional data mining
    • J. Han, L. V. S. Lakshmanan, and R. T. Ng, Constraint-Based, Multidimensional Data Mining, Computer, Vol. 32(8), pp. 46-50, 1999.
    • (1999) Computer , vol.32 , Issue.8 , pp. 46-50
    • Han, J.1    Lakshmanan, L.V.S.2    Ng, R.T.3
  • 16
    • 0028530086 scopus 로고
    • Generalizing version spaces
    • H. Hirsh. Generalizing Version Spaces. Machine Learning, Vol. 17(1), pp. 5-46 (1994).
    • (1994) Machine Learning , vol.17 , pp. 5-46
    • Hirsh, H.1
  • 17
    • 0030284618 scopus 로고    scopus 로고
    • A database perspectivce on knowledge discovery
    • T. Imielinski and H. Mannila. A database perspectivce on knowledge discovery. Communications of the ACM, Vol. 39(11), pp. 58-64, 1996.
    • (1996) Communications of the ACM , vol.39 , Issue.11 , pp. 58-64
    • Imielinski, T.1    Mannila, H.2
  • 18
    • 9444296505 scopus 로고    scopus 로고
    • Application programming interface and query language for database mining
    • AAAI Press
    • T. Imielinski, A. Virmani, and A. Abdulghani. Application programming interface and query language for database mining. In Proceedings of KDD 96. AAAI Press, pp. 256-262, 1996.
    • (1996) Proceedings of KDD 96 , pp. 256-262
    • Imielinski, T.1    Virmani, A.2    Abdulghani, A.3
  • 19
    • 84976816925 scopus 로고
    • Algorithm = logic + control
    • Robert A. Kowalski. Algorithm = Logic + Control. Communications of the ACM, 22(7), pp. 424-436, 1979.
    • (1979) Communications of the ACM , vol.22 , Issue.7 , pp. 424-436
    • Kowalski, R.A.1
  • 22
    • 0002381177 scopus 로고    scopus 로고
    • Discovering all most specific sentences by randomized algorithms
    • Foto N. Afrati, Phokion Kolaitis (Eds.) Lecture Notes in Computer Science Springer Verlag
    • D. Gunopulos, H. Mannila, S. Saluja: Discovering All Most Specific Sentences by Randomized Algorithms. In Foto N. Afrati, Phokion Kolaitis (Eds.): Database Theory - ICDT '97, 6th International Conference, Lecture Notes in Computer Science, Vol. 1186, Springer Verlag, pp. 41-55, 1997.
    • (1997) Database Theory - ICDT '97, 6th International Conference , vol.1186 , pp. 41-55
    • Gunopulos, D.1    Mannila, H.2    Saluja, S.3
  • 23
    • 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, Vol. 1(3), pp. 241-258, 1997.
    • (1997) Data Mining and Knowledge Discovery , vol.1 , Issue.3 , pp. 241-258
    • Mannila, H.1    Toivonen, H.2
  • 26
    • 22044442392 scopus 로고    scopus 로고
    • An extension to SQL for mining association rules
    • R. Meo, G. Psaila and S. Ceri, An extension to SQL for mining association rules. Data Mining and Knowledge Discovery, Vol. 2 (2), pp. 195-224, 1998.
    • (1998) Data Mining and Knowledge Discovery , vol.2 , Issue.2 , pp. 195-224
    • Meo, R.1    Psaila, G.2    Ceri, S.3
  • 27
    • 44949274684 scopus 로고
    • The description identification algorithm
    • C. Mellish. The description identification algorithm. Artificial Intelligence, Vol. 52 (2), pp, 151-168, 1990.
    • (1990) Artificial Intelligence , vol.52 , Issue.2 , pp. 151-168
    • Mellish, C.1
  • 28
    • 0000531852 scopus 로고
    • Generalization as search
    • T. Mitchell. Generalization as Search, Artificial Intelligence, Vol. 18 (2), pp. 203-226, 1980.
    • (1980) Artificial Intelligence , vol.18 , Issue.2 , pp. 203-226
    • Mitchell, T.1
  • 30
    • 84974733299 scopus 로고    scopus 로고
    • An apriori-based algorithm for mining frequent substructures from graph data
    • D. Zighed, J. Komorowski, and J. Zyktow (Eds.) Springer-Verlag
    • A. Inokuchi, T. Washio, H. Motoda. An Apriori-based algorithm for mining frequent substructures from graph data. In D. Zighed, J. Komorowski, and J. Zyktow (Eds.) Proceedings of PKDD 2000, Lecture Notes in Artificial Intelligence, Vol. 1910, Springer-Verlag, pp. 13-23, 2000.
    • (2000) Proceedings of PKDD 2000, Lecture Notes in Artificial Intelligence , vol.1910 , pp. 13-23
    • Inokuchi, A.1    Washio, T.2    Motoda, H.3


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