메뉴 건너뛰기




Volumn 2682, Issue , 2004, Pages 24-51

Query languages supporting descriptive rule mining: A comparative study

Author keywords

[No Author keywords available]

Indexed keywords


EID: 33745779547     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-44497-8_2     Document Type: Review
Times cited : (18)

References (18)
  • 1
    • 84867817851 scopus 로고    scopus 로고
    • Mining minimal non-redundant association rules using frequent closed itemsets
    • Proc. CL'00 London (UK). Springer-Verlag
    • Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining minimal non-redundant association rules using frequent closed itemsets. Proc. CL'00 (2000), London (UK). Springer-Verlag LNCS 1861. pp. 972-986.
    • (2000) LNCS , vol.1861 , pp. 972-986
    • Bastide, Y.1    Pasquier, N.2    Taouil, R.3    Stumme, G.4    Lakhal, L.5
  • 2
    • 84942749652 scopus 로고    scopus 로고
    • Frequent closures as a concise representation for binary data mining
    • Proc. PAKDD'00 Kyoto (JP). Springer-Verlag
    • Boulicaut, J-F., Bykowski, A.: Frequent closures as a concise representation for binary data mining. Proc. PAKDD'00 (2000), Kyoto (JP). Springer-Verlag LNAI 1805. pp. 62-73.
    • (2000) LNAI , vol.1805 , pp. 62-73
    • Boulicaut, J.-F.1    Bykowski, A.2
  • 3
    • 0037243046 scopus 로고    scopus 로고
    • Free-sets: A condensed representation of boolean data for the approximation of frequency queries
    • Boulicaut J-F., Bykowski, A., Rigotti, C.: Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery (2003). 7(1)5-22.
    • (2003) Data Mining and Knowledge Discovery , vol.7 , Issue.1 , pp. 5-22
    • Boulicaut, J.-F.1    Bykowski, A.2    Rigotti, C.3
  • 4
    • 35048818436 scopus 로고    scopus 로고
    • Condensed representations for sets of mining queries
    • Helsinki (FIN). An extended version appears in this volume
    • Giacometti, A., Laurent, D., Diop, G.T.: Condensed representations for sets of mining queries. Proc. KDID'02 (2002), Helsinki (FIN). An extended version appears in this volume.
    • (2002) Proc. KDID'02
    • Giacometti, A.1    Laurent, D.2    Diop, G.T.3
  • 5
    • 0030284618 scopus 로고    scopus 로고
    • A Database Perspective on Knowledge Discovery
    • Imielinski, T., Mannila, H.: A Database Perspective on Knowledge Discovery. Communications of the ACM (1996). 3(4)58-64.
    • (1996) Communications of the ACM , vol.3 , Issue.4 , pp. 58-64
    • Imielinski, T.1    Mannila, H.2
  • 6
    • 9444296505 scopus 로고    scopus 로고
    • DataMine: Application Programming Interface and Query Language for Database Mining
    • Portland (USA). AAAI Press
    • Imielinski, T., Virmani, A., Abdulghani, A.: DataMine: Application Programming Interface and Query Language for Database Mining. Proc. KDD'96 (1996), Portland (USA). AAAI Press, pp. 256-261.
    • (1996) Proc. KDD'96 , pp. 256-261
    • Imielinski, T.1    Virmani, A.2    Abdulghani, A.3
  • 8
    • 0141983698 scopus 로고    scopus 로고
    • Optimization of association rule mining queries
    • Jeudy, B., Boulicaut, J-F.: Optimization of association rule mining queries. Intelligent Data Analysis (2002). 6(4)341-357.
    • (2002) Intelligent Data Analysis , vol.6 , Issue.4 , pp. 341-357
    • Jeudy, B.1    Boulicaut, J.-F.2
  • 9
    • 84864832820 scopus 로고    scopus 로고
    • Using condensed representations for interactive association rule mining
    • Proc. PKDD'02 Helsinki (FIN). Springer-Verlag
    • Jeudy, B., Boulicaut, J-F.: Using condensed representations for interactive association rule mining. Proc. PKDD'02 (2002), Helsinki (FIN). Springer-Verlag LNAI 2431. pp. 225-236.
    • (2002) LNAI , vol.2431 , pp. 225-236
    • Jeudy, B.1    Boulicaut, J.-F.2
  • 12
    • 0003024181 scopus 로고    scopus 로고
    • A New SQL-like Operator for Mining Association Rules
    • Bombay (India). Morgan Kaufmann
    • Meo, R., Psaila, G., Ceri, S.: A New SQL-like Operator for Mining Association Rules. Proc. VLDB'96 (1996), Bombay (India). Morgan Kaufmann, pp. 122-133.
    • (1996) Proc. VLDB'96 , pp. 122-133
    • Meo, R.1    Psaila, G.2    Ceri, S.3
  • 13
  • 15
    • 0034592942 scopus 로고    scopus 로고
    • Generating non-redundant association rules
    • Boston (USA). ACM Press
    • Zaki, M.J.: Generating non-redundant association rules. Proc. SIGKDD'00 (2000), Boston (USA). ACM Press, pp. 34-43.
    • (2000) Proc. SIGKDD'00 , pp. 34-43
    • Zaki, M.J.1
  • 16
    • 0035022213 scopus 로고    scopus 로고
    • Integrating Data Mining with SQL Databases: OLE DB for Data Mining
    • Heidelberg (Germany). IEEE Computer Society
    • Netz, A., Chaudhuri, S., Fayyad, U., Bernhardt, J.:Integrating Data Mining with SQL Databases: OLE DB for Data Mining. Proc ICDE'01 (2001), Heidelberg (Germany). IEEE Computer Society, pp. 379-387
    • (2001) Proc ICDE'01 , pp. 379-387
    • Netz, A.1    Chaudhuri, S.2    Fayyad, U.3    Bernhardt, J.4


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