메뉴 건너뛰기




Volumn 6, Issue 4, 2004, Pages 169-178

Mining interesting association rules and sequential patterns

Author keywords

Association rules; Data mining; Interesting information; Sequential patterns; Transaction database

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; DATABASE SYSTEMS; DECISION MAKING; PROBLEM SOLVING; SET THEORY;

EID: 17444380776     PISSN: 15622479     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (2)

References (23)
  • 5
    • 84974711329 scopus 로고    scopus 로고
    • Athena: Mining-based interactive management of text databases
    • July
    • R. Agrawal, R. J. Bayardo, and R. Srikant. Athena: Mining-based Interactive Management of Text Databases. IBM Research Report RJ10153, July 1999.
    • (1999) IBM Research Report , vol.RJ10153
    • Agrawal, R.1    Bayardo, R.J.2    Srikant, R.3
  • 7
    • 0031162961 scopus 로고    scopus 로고
    • Dynamic itemset counting and implication rules for market basket data
    • S. Brin, R. Motwani, and et al. Dynamic Itemset Counting and Implication Rules for Market Basket Data. In Proc. of ACM SIGMOD, 1997.
    • (1997) Proc. of ACM SIGMOD
    • Brin, S.1    Motwani, R.2
  • 8
    • 0033892546 scopus 로고    scopus 로고
    • Efficient mining of constrained correlated sets
    • San Diego, CA, Feb.
    • G. Grahne, L. Lakshmanan, and X. Wang. Efficient mining of constrained correlated sets. In ICDE'00, pages 512-521, San Diego, CA, Feb. 2000.
    • (2000) ICDE'00 , pp. 512-521
    • Grahne, G.1    Lakshmanan, L.2    Wang, X.3
  • 9
    • 0034593066 scopus 로고    scopus 로고
    • FreeSpan: Frequent pattern-projected sequential pattern mining
    • Boston, MA, Aug.
    • J. Han, J. Pei, B. Mortazavi-Asl, Q. Chen, U. Dayal, and M.C. Hsu. FreeSpan: Frequent pattern-projected sequential pattern mining. In KDD'00, pages 355-359, Boston, MA, Aug. 2000.
    • (2000) KDD'00 , pp. 355-359
    • Han, J.1    Pei, J.2    Mortazavi-Asl, B.3    Chen, Q.4    Dayal, U.5    Hsu, M.C.6
  • 10
    • 0039253846 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation
    • Dallas, TX, May
    • J. Han, J. Pei and Y. Yin. Mining frequent patterns without candidate generation. In SIGMOD'00, pages 1-12, Dallas, TX, May 2000.
    • (2000) SIGMOD'00 , pp. 1-12
    • Han, J.1    Pei, J.2    Yin, Y.3
  • 11
    • 0003372359 scopus 로고    scopus 로고
    • Mining frequent patterns by pattern-growth: Methodology and implications
    • December
    • J. Han and J. Pei. Mining Frequent Patterns by Pattern-Growth: Methodology and Implications. In ACM SIGKDD, pages 30-36, December, 2000
    • (2000) ACM SIGKDD , pp. 30-36
    • Han, J.1    Pei, J.2
  • 12
    • 0003024181 scopus 로고    scopus 로고
    • A new SQL-like operator for mining association rules
    • on Very Large Data Bases
    • R. Meo, G. Psaila, and S. Ceri. A New SQL-like Operator for Mining Association Rules. In Proc. of the International Conference on Very Large Data Bases, pages 122-133, 1996.
    • (1996) Proc. of the International Conference , pp. 122-133
    • Meo, R.1    Psaila, G.2    Ceri, S.3
  • 13
    • 84976830511 scopus 로고
    • An effective hash-based algorithm for mining association rules
    • J.S. Park, M.S. Chen, and P.S. Yu. An Effective Hash-Based Algorithm for Mining Association Rules. In Proc. of ACM SIGAMOD 24(2): 175-186, 1995.
    • (1995) Proc. of ACM SIGAMOD , vol.24 , Issue.2 , pp. 175-186
    • Park, J.S.1    Chen, M.S.2    Yu, P.S.3
  • 14
    • 0035016447 scopus 로고    scopus 로고
    • Mining frequent itemsets with convertible constraints
    • Heidelberg, Germany, April
    • J. Pei, J. Han, and L.V.S. Lakshmanan. Mining Frequent itemsets with convertible constraints. In ICDE'01, Heidelberg, Germany, April, 2001.
    • (2001) ICDE'01
    • Pei, J.1    Han, J.2    Lakshmanan, L.V.S.3
  • 15
    • 0035016443 scopus 로고    scopus 로고
    • PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth
    • Heidelberg, Germany, April
    • J. Pei, J. Han, and B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M.C. Hsu. PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In ICDE'01, Heidelberg, Germany, April, 2001.
    • (2001) ICDE'01
    • Pei, J.1    Han, J.2    Mortazavi-Asl, B.3    Pinto, H.4    Chen, Q.5    Dayal, U.6    Hsu, M.C.7
  • 17
    • 0012980328 scopus 로고    scopus 로고
    • Breaking the barrier of transactions: Mining inter-transaction association rules
    • Anthony K.H. Tung, Hongjun Lu, Jiawei Han, Ling Feng: Breaking the Barrier of Transactions: Mining Inter-Transaction Association Rules. ACM SIGKDD, pages 297-301, 1999.
    • (1999) ACM SIGKDD , pp. 297-301
    • Tung, A.K.H.1    Lu, H.2    Han, J.3    Feng, L.4
  • 18
    • 84947552204 scopus 로고    scopus 로고
    • An effective boolean algorithm for mining association rules in large databases
    • S.Y. Wur and Y Leu. An Effective Boolean Algorithm for Mining Association Rules in Large Databases. In DASFAA, pages 19-30, 1999.
    • (1999) DASFAA , pp. 19-30
    • Wur, S.Y.1    Leu, Y.2
  • 22
    • 0035439306 scopus 로고    scopus 로고
    • A graph-based approach for discovering various types of association rules
    • S.J. Yen and A.L.P. Chen. "A Graph-Based Approach for Discovering Various Types of Association Rules," IEEE Trans. on Knowledge and Data Engineering, Vol.13, No.5, pages. 839-845, 2001.
    • (2001) IEEE Trans. on Knowledge and Data Engineering , vol.13 , Issue.5 , pp. 839-845
    • Yen, S.J.1    Chen, A.L.P.2


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