메뉴 건너뛰기




Volumn 2287, Issue , 2002, Pages 106-123

Composition of mining contexts for efficient extraction of association rules

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; DATA MINING; DATABASE SYSTEMS; EXTRACTION;

EID: 84883804781     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper
Times cited : (13)

References (20)
  • 2
    • 84958043653 scopus 로고    scopus 로고
    • Incremental Refinement of Mining Queries
    • Florence
    • E. Baralis and G. Psaila (1999). Incremental Refinement of Mining Queries. In Proc. of DAWAK’99, pp. 173-182, Florence.
    • (1999) Proc. Of DAWAK’99 , pp. 173-182
    • Baralis, E.1    Psaila, G.2
  • 3
  • 5
    • 0029733589 scopus 로고    scopus 로고
    • Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique
    • New Orleans, USA
    • D. Cheung, J. Han, V. Ng, and C.Y. Wong (1996) Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique. In Proc. of ICDE’96, pp. 106-114, New Orleans, USA.
    • (1996) Proc. Of ICDE’96 , pp. 106-114
    • Cheung, D.1    Han, J.2    Ng, V.3    Wong, C.Y.4
  • 6
    • 22644450056 scopus 로고    scopus 로고
    • Discovery of Frequent Datalog Patterns
    • Kluwer Academic Publishers
    • L. Dehaspe and H. Toivonen (1999). Discovery of Frequent Datalog Patterns. Data Mining and Knowledge Discovery, 3, pp. 7-36, Kluwer Academic Publishers.
    • (1999) Data Mining and Knowledge Discovery , vol.3 , pp. 7-36
    • Dehaspe, L.1    Toivonen, H.2
  • 7
    • 84883788105 scopus 로고    scopus 로고
    • Extraction de règles d’association entre vues: Vers une approche incrémentale (French)
    • Blois, France. English version available as Tech. Rep. LI/E3I No. 241, University of Tours, France
    • C.T. Diop, A. Giacometti, D. Laurent and N. Spyratos (2000). Extraction de règles d’association entre vues: vers une approche incrémentale (French). In Proc. of BDA’2000, pp. 323-344, Blois, France. English version available as Tech. Rep. LI/E3I No. 241, University of Tours, France.
    • (2000) Proc. Of BDA’2000 , pp. 323-344
    • Diop, C.T.1    Giacometti, A.2    Laurent, D.3    Spyratos, N.4
  • 8
    • 84883749526 scopus 로고    scopus 로고
    • Combining Mining Tasks through Relational Algebra
    • Tours, France (full paper, to appear)
    • C.T. Diop, A. Giacometti, D. Laurent and N. Spyratos (2001). Combining Mining Tasks through Relational Algebra. Techn. Rep. LI/E3I, Tours, France (full paper, to appear).
    • (2001) Techn. Rep. LI/E3I
    • Diop, C.T.1    Giacometti, A.2    Laurent, D.3    Spyratos, N.4
  • 10
    • 22844454898 scopus 로고    scopus 로고
    • MSQL: A Query Language for Database Mining
    • Kluwer Academic Publishers
    • T. Imielinski and A. Virmani (1999). MSQL: A Query Language for Database Mining. Data Mining and Knowledge Discovery, Vol. 3, No. 4, pp. 373-408, Kluwer Academic Publishers.
    • (1999) Data Mining and Knowledge Discovery , vol.3 , Issue.4 , pp. 373-408
    • Imielinski, T.1    Virmani, A.2
  • 11
    • 0005187580 scopus 로고    scopus 로고
    • Metarule-Guided Mining of Multi- Dimensional Association Rules Using Data Cubes
    • Newport Beach, USA
    • M. Kamber, J. Han, J. Chiang (1997). Metarule-Guided Mining of Multi- Dimensional Association Rules Using Data Cubes. In Proc. of KDD’97, pp. 207-210, Newport Beach, USA.
    • (1997) Proc. Of KDD’97 , pp. 207-210
    • Kamber, M.1    Han, J.2    Chiang, J.3
  • 14
    • 0013115617 scopus 로고    scopus 로고
    • Using a Knowledge Cache for Interactive Discovery of Association Rules
    • San Diego, USA
    • B. Nag, P. Deshpande and D.J. DeWitt (1999). Using a Knowledge Cache for Interactive Discovery of Association Rules. In Proc. of KDD’99, pp. 244-253, San Diego, USA.
    • (1999) Proc. Of KDD’99 , pp. 244-253
    • Nag, B.1    Deshpande, P.2    Dewitt, D.J.3
  • 15
    • 35048828322 scopus 로고    scopus 로고
    • Caching for Multi-dimensional Data Mining Queries
    • Orlando, Florida
    • B. Nag, P. Deshpande and D.J. DeWitt (2001). Caching for Multi-dimensional Data Mining Queries. In Proc. of SCI’2001, Orlando, Florida.
    • (2001) Proc. Of SCI’2001
    • Nag, B.1    Deshpande, P.2    Dewitt, D.J.3
  • 16
    • 84976830511 scopus 로고
    • An Effective Hash Based Algorithm for Mining Association Rules
    • J.S. Park, M. Chen, P.S. Yu (1995). An Effective Hash Based Algorithm for Mining Association Rules. SIGMOD Conference, pp. 175-186.
    • (1995) SIGMOD Conference , pp. 175-186
    • Park, J.S.1    Chen, M.2    Yu, P.S.3
  • 17
    • 0002082857 scopus 로고
    • An Efficient Algorithm for Mining Association Rules in Large Databases
    • A. Savasere, E. Omiecinski and S.B. Navathe (1995). An Efficient Algorithm for Mining Association Rules in Large Databases. VLDB Conference, pp. 432-444.
    • (1995) VLDB Conference , pp. 432-444
    • Savasere, A.1    Omiecinski, E.2    Navathe, S.B.3
  • 18
    • 85049125672 scopus 로고    scopus 로고
    • An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases
    • Newport Beach, USA
    • S. Thomas, S. Bodagala, K. Alsabti and Sanjay Ranka (1997). An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases. In Proc. of KDD’97, pp. 263-266, Newport Beach, USA.
    • (1997) Proc. Of KDD’97 , pp. 263-266
    • Thomas, S.1    Bodagala, S.2    Alsabti, K.3    Ranka, S.4
  • 19
    • 0032092082 scopus 로고    scopus 로고
    • Query Flocks: A Generalization of Association-Rule Mining
    • S. Tsur and al. (1998), Query Flocks: A Generalization of Association-Rule Mining. SIGMOD Conference, pp. 1-12.
    • (1998) SIGMOD Conference , pp. 1-12
    • Tsur, S.1


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