메뉴 건너뛰기




Volumn 3673 LNAI, Issue , 2005, Pages 258-269

Optimization of association rules extraction through exploitation of context dependent constraints

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DATABASE SYSTEMS; ITERATIVE METHODS; KNOWLEDGE BASED SYSTEMS; OPTIMIZATION; QUERY LANGUAGES;

EID: 33646162432     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11558590_26     Document Type: Conference Paper
Times cited : (2)

References (24)
  • 1
    • 0008241804 scopus 로고
    • Fast discovery of association rules
    • Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R., eds.: AAAI/MIT Press, Santiago, Chile
    • Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.L: Fast discovery of association rules. In Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R., eds.: Knowledge Discovery in Databases. Volume 2. AAAI/MIT Press, Santiago, Chile (1995)
    • (1995) Knowledge Discovery in Databases , vol.2
    • Agrawal, R.1    Mannila, H.2    Srikant, R.3    Toivonen, H.4    Verkamo, A.L.5
  • 7
    • 9444282617 scopus 로고    scopus 로고
    • User defined aggregates for logical data languages
    • Wang, H., Zaniolo, C.: User defined aggregates for logical data languages. In: Proc. of DDLP. (1998) 85-97
    • (1998) Proc. of DDLP , pp. 85-97
    • Wang, H.1    Zaniolo, C.2
  • 8
    • 9444296505 scopus 로고    scopus 로고
    • Datamine: Application programming interface and query language for database mining
    • Imielinski, T., Virmani, A., Abdoulghani, A.: Datamine: Application programming interface and query language for database mining. KDD-96 (1996) 256-260
    • (1996) KDD-96 , pp. 256-260
    • Imielinski, T.1    Virmani, A.2    Abdoulghani, A.3
  • 11
    • 0030284618 scopus 로고    scopus 로고
    • A database perspective on knowledge discovery
    • Imielinski, T., Mannila, H.: A database perspective on knowledge discovery. Communications of the ACM 39 (1996) 58-64
    • (1996) Communications of the ACM , vol.39 , pp. 58-64
    • Imielinski, T.1    Mannila, H.2
  • 14
    • 9444257640 scopus 로고    scopus 로고
    • Query rewriting in itemset mining
    • Proceedings of the 6th International Conference On Flexible Query Answeringd Systems. (to appear), Springer
    • Meo, R., Botta, M., Esposito, R.: Query rewriting in itemset mining. In: Proceedings of the 6th International Conference On Flexible Query Answeringd Systems. LNAI (to appear), Springer (2004)
    • (2004) LNAI
    • Meo, R.1    Botta, M.2    Esposito, R.3
  • 15
    • 0029733589 scopus 로고    scopus 로고
    • Maintenance of discovered association rules in large databases: An incremental updating technique
    • New Orleans, Louisiana, USA
    • Cheung, D.W., Han, J., Ng, V.T., Wong, C.Y.: Maintenance of discovered association rules in large databases: an incremental updating technique. In: ICDE96 12th Int'l Conf. on Data Engineering, New Orleans, Louisiana, USA (1996)
    • (1996) ICDE96 12th Int'l Conf. on Data Engineering
    • Cheung, D.W.1    Han, J.2    Ng, V.T.3    Wong, C.Y.4
  • 18
    • 0242625292 scopus 로고    scopus 로고
    • Dualminer: A dual-pruning algorithm for itemsets with constraints
    • Bucila, C., Gehrke, J., Kifer, D., White, W.M.: Dualminer: a dual-pruning algorithm for itemsets with constraints. In: Proc. of 2002 ACM KDD. (2002) 42-51
    • (2002) Proc. of 2002 ACM KDD , pp. 42-51
    • Bucila, C.1    Gehrke, J.2    Kifer, D.3    White, W.M.4
  • 21
    • 2442458316 scopus 로고    scopus 로고
    • A perspective on inductive databases
    • Raedt, L.D.: A perspective on inductive databases. ACM SIGKDD Explorations 4 (2002) 69-77
    • (2002) ACM SIGKDD Explorations , vol.4 , pp. 69-77
    • Raedt, L.D.1
  • 22
    • 0001882616 scopus 로고
    • Fast algorithms for mining association rules in large databases
    • Santiago, Chile
    • Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th VLDB Conference, Santiago, Chile (1994)
    • (1994) Proceedings of the 20th VLDB Conference
    • Agrawal, R.1    Srikant, R.2
  • 24
    • 0039253846 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation
    • Dallas, TX, USA
    • Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proc. of ACM SIGMOD 2000, Dallas, TX, USA (2000)
    • (2000) Proc. of ACM SIGMOD 2000
    • Han, J.1    Pei, J.2    Yin, Y.3


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