메뉴 건너뛰기




Volumn 11, Issue 5, 1996, Pages 59-68

Scalable discovery of informative structural concepts using domain knowledge

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER AIDED DESIGN; DATA COMPRESSION; DATA DESCRIPTION; DATA STRUCTURES; DATABASE SYSTEMS; ENCODING (SYMBOLS); GRAPH THEORY; MATRIX ALGEBRA; PERFORMANCE; POLYNOMIALS;

EID: 0030269647     PISSN: 08859000     EISSN: None     Source Type: Journal    
DOI: 10.1109/64.539018     Document Type: Article
Times cited : (17)

References (10)
  • 2
    • 0027652468 scopus 로고
    • Substructure Discovery Using Minimum Description Length and Background Knowledge
    • Feb.
    • D.J. Cook and L.B. Holder, "Substructure Discovery Using Minimum Description Length and Background Knowledge," J. Artificial Intelligence Research, Vol. 1, Feb. 1994, pp. 231-255.
    • (1994) J. Artificial Intelligence Research , vol.1 , pp. 231-255
    • Cook, D.J.1    Holder, L.B.2
  • 3
    • 0000197922 scopus 로고
    • Machine Discovery of Protein Motifs
    • Oct. and Nov.
    • D. Conklin, "Machine Discovery of Protein Motifs," Machine Learning, Vol. 21, Nos. 1 and 2, Oct. and Nov. 1995, pp. 125-150.
    • (1995) Machine Learning , vol.21 , Issue.1-2 , pp. 125-150
    • Conklin, D.1
  • 4
    • 0020979057 scopus 로고
    • A Self-Organizing Retrieval Sy stem for Graphs
    • AAAI Press/MIT Press
    • R. Levinson, "A Self-Organizing Retrieval Sy stem for Graphs," Proc. Second Nat'l Conf. Artificial Intelligence, AAAI Press/MIT Press, 1984, pp. 203-206.
    • (1984) Proc. Second Nat'l Conf. Artificial Intelligence , pp. 203-206
    • Levinson, R.1
  • 5
    • 84985820486 scopus 로고
    • Learning Graph Models of Shape
    • Morgan Kaufmann, San Francisco
    • J. Segen, "Learning Graph Models of Shape," Proc. Fifth Int'l Conf. Machine Learning, Morgan Kaufmann, San Francisco, 1988, pp. 29-35.
    • (1988) Proc. Fifth Int'l Conf. Machine Learning , pp. 29-35
    • Segen, J.1
  • 8
    • 0024627518 scopus 로고
    • Inferring Decision Trees Using the Minimum Description Length Principle
    • Mar.
    • J.R. Quinlan and R.L. Rivest, "Inferring Decision Trees Using the Minimum Description Length Principle," Information and Computation, Vol. 80, No. 3, Mar. 1989, pp. 227-248.
    • (1989) Information and Computation , vol.80 , Issue.3 , pp. 227-248
    • Quinlan, J.R.1    Rivest, R.L.2
  • 9
    • 0021022807 scopus 로고
    • Inexact Graph Matching for Structural Pattern Recognition
    • May
    • H. Bunke and G. Allermann, "Inexact Graph Matching for Structural Pattern Recognition," Pattern Recognition Letters, Vol. 1, No. 4, May 1983, pp. 245-253.
    • (1983) Pattern Recognition Letters , vol.1 , Issue.4 , pp. 245-253
    • Bunke, H.1    Allermann, G.2


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