메뉴 건너뛰기




Volumn 20, Issue 3, 2005, Pages 359-373

Mining interval sequential patterns

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPETITION; CUSTOMER SATISFACTION; DATA MINING; DECISION MAKING; MARKETING; PRODUCT DEVELOPMENT;

EID: 15244351469     PISSN: 08848173     EISSN: None     Source Type: Journal    
DOI: 10.1002/int.20070     Document Type: Article
Times cited : (6)

References (10)
  • 4
    • 0034592960 scopus 로고    scopus 로고
    • Cross-sell: A fast promotion-tunable customer-item recommendation method based on conditionally independent probabilities
    • Taipei, Taiwan, May 6-8
    • Kitts B, Freed D, Vrieze M. Cross-sell: A fast promotion-tunable customer-item recommendation method based on conditionally independent probabilities. In: Proc ACM 6th Int Conf on Knowledge Discovery and Data Mining, Taipei, Taiwan, May 6-8, 2002. pp 437-446.
    • (2002) Proc ACM 6th Int Conf on Knowledge Discovery and Data Mining , pp. 437-446
    • Kitts, B.1    Freed, D.2    Vrieze, M.3
  • 5
    • 0030285403 scopus 로고    scopus 로고
    • The KDD Process for extracting useful knowledge from volumes of data
    • Fayyad UM, Shapiro GP, Smyth P. The KDD Process for extracting useful knowledge from volumes of data. Commun ACM 1996;39(11):27-34.
    • (1996) Commun ACM , vol.39 , Issue.11 , pp. 27-34
    • Fayyad, U.M.1    Shapiro, G.P.2    Smyth, P.3
  • 6
    • 0004654679 scopus 로고
    • Competitive knowledge development: Reengineering competitive intelligence for maximun success
    • Tyson KWM. Competitive knowledge development: Reengineering competitive intelligence for maximun success. Compel Intell Rev 1995;6(4): 14-21.
    • (1995) Compel Intell Rev , vol.6 , Issue.4 , pp. 14-21
    • Tyson, K.W.M.1
  • 7
    • 0039253846 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation
    • Dallas, Texas, May 14-19
    • Han J, Pel J, Yin Y. Mining frequent patterns without candidate generation. In: Proc ACM SIGMOD Conf on Management of Data, Dallas, Texas, May 14-19, 2000. pp 241-250.
    • (2000) Proc ACM SIGMOD Conf on Management of Data , pp. 241-250
    • Han, J.1    Pel, J.2    Yin, Y.3
  • 9
    • 0001882616 scopus 로고
    • Fast algorithms for mining association rules
    • Santiago, Chile, September 12-15
    • Agrawal R, Srikant R. Fast algorithms for mining association rules. In: Proc 20th Int Conf on Very Large Data Bases, Santiago, Chile, September 12-15, 1994. pp 478-499.
    • (1994) Proc 20th Int Conf on Very Large Data Bases , pp. 478-499
    • Agrawal, R.1    Srikant, R.2
  • 10
    • 0027621699 scopus 로고
    • Mining association rules between sets of items in large database
    • Washington, D.C., May 26-28
    • Agrawal R, Imielinski T, Swami A. Mining association rules between sets of items in large database. In: Proc ACM SIGMOD Int Conf on Management of Data, Washington, D.C., May 26-28, 1993. pp 207-216.
    • (1993) Proc ACM SIGMOD Int Conf on Management of Data , pp. 207-216
    • Agrawal, R.1    Imielinski, T.2    Swami, A.3


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