메뉴 건너뛰기




Volumn 1, Issue 2, 2011, Pages 97-113

Market basket analysis with networks

Author keywords

Association rules; Community detection; Market basket analysis; Product network; Transaction data

Indexed keywords

BEER; COMMERCE; DATA MINING;

EID: 84862946929     PISSN: 18695450     EISSN: 18695469     Source Type: Journal    
DOI: 10.1007/s13278-010-0003-7     Document Type: Article
Times cited : (63)

References (44)
  • 1
    • 0002704048 scopus 로고    scopus 로고
    • Tuzhilin A (1999) User profiling in personalization applications through rule discovery and validation
    • ACM, New York
    • Adomavicius G, Tuzhilin A (1999) User profiling in personalization applications through rule discovery and validation. In: Proceedings of KDD. ACM, New York, pp 377–381
    • Proceedings of KDD , pp. 377-381
    • Adomavicius, G.1
  • 2
    • 0001882616 scopus 로고    scopus 로고
    • Srikant R (1994) Fast algorithms for mining association rules in very large databases
    • Santiago, Chile
    • Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in very large databases. In: Proceedings of the 20th International Conference on VLDB. Santiago, Chile, pp 487–499
    • Proceedings of the 20th International Conference on VLDB , pp. 487-499
    • Agrawal, R.1
  • 3
    • 34547852262 scopus 로고    scopus 로고
    • An ensemble framework for clustering protein-protein interaction networks. In: ISMB/ECCB
    • Asur S, Ucar D, Parthasarathy S (2007) An ensemble framework for clustering protein-protein interaction networks. In: ISMB/ECCB, pp 29–40
    • (2007) pp 29–40
    • Asur, S.1    Ucar, D.2    Parthasarathy, S.3
  • 4
    • 0038513959 scopus 로고    scopus 로고
    • Scale-free networks
    • Barabasi A, Bonabeau E (2003) Scale-free networks. Sci Am 288(5):50–59
    • (2003) Sci Am , vol.288 , Issue.5 , pp. 50-59
    • Barabasi, A.1    Bonabeau, E.2
  • 6
    • 85041449843 scopus 로고    scopus 로고
    • Lefebvre E: Fast unfolding of communities in large networks
    • Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks
    • (2008) Lambiotte R
    • Blondel, V.D.1    Guillaume, J.-L.2
  • 7
    • 28544441784 scopus 로고    scopus 로고
    • Defining interestingness for association rules
    • Brijs T, Vanhoof K, Wets G (2003) Defining interestingness for association rules. Int J Inf Theor Appl 10(4):370–376
    • (2003) Int J Inf Theor Appl , vol.10 , Issue.4 , pp. 370-376
    • Brijs, T.1    Vanhoof, K.2    Wets, G.3
  • 8
    • 0007262134 scopus 로고    scopus 로고
    • What can you do with a Web in your Pocket?
    • Brin S, Motwani R, Page L, Winograd T (1998) What can you do with a Web in your Pocket? Data Eng Bull 21(2):37–47
    • (1998) Data Eng Bull , vol.21 , Issue.2 , pp. 37-47
    • Brin, S.1    Motwani, R.2    Page, L.3    Winograd, T.4
  • 9
    • 0031161999 scopus 로고    scopus 로고
    • Beyond market baskets: generalizing association rules to correlations. In: Proceedings of the ACM SIGMOD
    • Brin S, Motwani R, Silverstein C (1997) Beyond market baskets: generalizing association rules to correlations. In: Proceedings of the ACM SIGMOD, pp 265–276
    • (1997) pp 265–276
    • Brin, S.1    Motwani, R.2    Silverstein, C.3
  • 10
    • 0031162961 scopus 로고    scopus 로고
    • Dynamic itemset counting and implication rules for market basket data
    • Brin S, Motwani R, Ullman J, Tsur S (1997) Dynamic itemset counting and implication rules for market basket data. ACM SIGMOD Record 26(2):255–264
    • (1997) ACM SIGMOD Record , vol.26 , Issue.2 , pp. 255-264
    • Brin, S.1    Motwani, R.2    Ullman, J.3    Tsur, S.4
  • 11
    • 34548500564 scopus 로고    scopus 로고
    • A scalable algorithm for the market basket analysis
    • Cavique L (2007) A scalable algorithm for the market basket analysis. J Retail Consumer Serv 14(6):400–407
    • (2007) J Retail Consumer Serv , vol.14 , Issue.6 , pp. 400-407
    • Cavique, L.1
  • 12
    • 7444234279 scopus 로고    scopus 로고
    • Mining open source software (oss) data using association rules network
    • Chawla S, Arunasalam B, Davis J (2003) Mining open source software (oss) data using association rules network. PAKDD 461–466
    • (2003) PAKDD , pp. 461-466
    • Chawla, S.1    Arunasalam, B.2    Davis, J.3
  • 14
    • 0036776464 scopus 로고    scopus 로고
    • A personalized recommender system based on web usage mining and decision tree induction
    • Cho Y, Kim J, Kim S (2002) A personalized recommender system based on web usage mining and decision tree induction. Expert Syst Appl 23(3):329–342
    • (2002) Expert Syst Appl , vol.23 , Issue.3 , pp. 329-342
    • Cho, Y.1    Kim, J.2    Kim, S.3
  • 15
    • 41349117788 scopus 로고    scopus 로고
    • Finding community structure in very large networks
    • Clauset A, Newman M, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70(066111)
    • (2004) Phys Rev E , vol.70 , Issue.66111
    • Clauset, A.1    Newman, M.2    Moore, C.3
  • 16
    • 85041442209 scopus 로고    scopus 로고
    • Power-law distributions in empirical data. axriv
    • Clauset A, Shalizi C, Newman M (2007) Power-law distributions in empirical data. axriv, 706
    • (2007) 706
    • Clauset, A.1    Shalizi, C.2    Newman, M.3
  • 17
    • 43749091772 scopus 로고    scopus 로고
    • Community detection in large-scale social networks. In: Proceedings of WebKDD. ACM
    • Du N, Wu B, Pei X, Wang B, Xu L (2007) Community detection in large-scale social networks. In: Proceedings of WebKDD. ACM, pp 16–25
    • (2007) pp 16–25
    • Du, N.1    Wu, B.2    Pei, X.3    Wang, B.4    Xu, L.5
  • 18
    • 0035789655 scopus 로고    scopus 로고
    • Empirical bayes screening for multi-item associations. In: Proceedings of KDD
    • DuMouchel W, Pregibon D (2001) Empirical bayes screening for multi-item associations. In: Proceedings of KDD, pp 67–76
    • (2001) pp 67–76
    • DuMouchel, W.1    Pregibon, D.2
  • 20
    • 78149351437 scopus 로고    scopus 로고
    • Efficiently mining maximal frequent itemsets. In: Proceedings of ICDM. IEEE Computer Society
    • Gouda K, Zaki M (2001) Efficiently mining maximal frequent itemsets. In: Proceedings of ICDM. IEEE Computer Society, pp 163–170
    • (2001) pp 163–170
    • Gouda, K.1    Zaki, M.2
  • 21
    • 0003372359 scopus 로고    scopus 로고
    • Mining frequent patterns by pattern-growth: methodology and implications
    • Han J, Pei J (2000) Mining frequent patterns by pattern-growth: methodology and implications. ACM SIGKDD Explor Newslett 2(2):14–20
    • (2000) ACM SIGKDD Explor Newslett , vol.2 , Issue.2 , pp. 14-20
    • Han, J.1    Pei, J.2
  • 22
    • 24944564017 scopus 로고    scopus 로고
    • Visualization of directed associations in e-commerce transaction data
    • Hao M, Dayal U, Hsu M, Sprenger T, Gross M (2001) Visualization of directed associations in e-commerce transaction data. In: Proceedings of VisSym, vol 1, pp 185–192
    • (2001) Proceedings of VisSym , vol.1 , pp. 185-192
    • Hao, M.1    Dayal, U.2    Hsu, M.3    Sprenger, T.4    Gross, M.5
  • 23
    • 0002784345 scopus 로고    scopus 로고
    • Algorithms for association rule mininga general survey and comparison
    • Hipp J, Güntzer U, Nakhaeizadeh G (2000) Algorithms for association rule mininga general survey and comparison. ACM SIGKDD Explor Newslett 2(1):58–64
    • (2000) ACM SIGKDD Explor Newslett , vol.2 , Issue.1 , pp. 58-64
    • Hipp, J.1    Güntzer, U.2    Nakhaeizadeh, G.3
  • 24
    • 0035976573 scopus 로고    scopus 로고
    • The structure of the web
    • Kleinberg J, Lawrence S (2001) The structure of the web. Science 294:1849–1850
    • (2001) Science , vol.294 , pp. 1849-1850
    • Kleinberg, J.1    Lawrence, S.2
  • 25
    • 85041444752 scopus 로고
    • Finding interesting rules from large sets of discovered association rules. In: Proceedings of CIKM
    • Klemettinen M, Mannila H, Ronkainen P, Toivonen H, Verkamo A (1994) Finding interesting rules from large sets of discovered association rules. In: Proceedings of CIKM, pp 401–407
    • (1994) pp 401–407
    • Klemettinen, M.1    Mannila, H.2    Ronkainen, P.3    Toivonen, H.4    Verkamo, A.5
  • 26
    • 37649033033 scopus 로고    scopus 로고
    • Identifying communities within energy landscapes
    • Massen C, Doye J (2005) Identifying communities within energy landscapes. Phys Rev E 71(4):46101
    • (2005) Phys Rev E , vol.71 , Issue.4 , pp. 46101
    • Massen, C.1    Doye, J.2
  • 27
    • 0037262710 scopus 로고    scopus 로고
    • Card loyalty. A new emerging issue in grocery retailing
    • Mauri C (2003) Card loyalty. A new emerging issue in grocery retailing. Journal of Retailing and Consumer Serv 10(1):13–25
    • (2003) J Retail Consumer Serv , vol.10 , Issue.1 , pp. 13-25
    • Mauri, C.1
  • 28
    • 28544452631 scopus 로고    scopus 로고
    • A survey of interestingness measures for knowledge discovery
    • McGarry K (2005) A survey of interestingness measures for knowledge discovery. Knowl Eng Rev 20(01):39–61
    • (2005) Knowl Eng Rev , vol.20 , Issue.1 , pp. 39-61
    • McGarry, K.1
  • 29
    • 2942564706 scopus 로고    scopus 로고
    • Detecting community structure in networks
    • Newman M (2004) Detecting community structure in networks. Eur Phys J B Condens Matter Complex Syst 38(2):321–330
    • (2004) Eur Phys J B Condens Matter Complex Syst , vol.38 , Issue.2 , pp. 321-330
    • Newman, M.1
  • 30
    • 33749468596 scopus 로고    scopus 로고
    • Finding community structure in networks using the eigenvectors of matrices
    • Newman M (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74(3):36104
    • (2006) Phys Rev E , vol.74 , Issue.3 , pp. 36104
    • Newman, M.1
  • 31
    • 37649028224 scopus 로고    scopus 로고
    • Finding and evaluating community structure in networks
    • Newman M, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):26113
    • (2004) Phys Rev E , vol.69 , Issue.2 , pp. 26113
    • Newman, M.1    Girvan, M.2
  • 32
    • 7444235466 scopus 로고    scopus 로고
    • Electricity based external similarity of categorical attributes
    • Palmer C, Faloutsos C (2003) Electricity based external similarity of categorical attributes. Lecture notes in computer science, pp 486–500
    • (2003) Lecture notes in computer science , pp. 486-500
    • Palmer, C.1    Faloutsos, C.2
  • 34
    • 75149139108 scopus 로고    scopus 로고
    • Community detection in a large-scale real world social network
    • Springer, Berlin
    • Steinhaeuser K, Chawla N (2008) Community detection in a large-scale real world social network. In: LNCS. Springer, Berlin
    • (2008) In: LNCS
    • Steinhaeuser, K.1    Chawla, N.2
  • 35
    • 1242308945 scopus 로고    scopus 로고
    • Selecting the right objective measure for association analysis
    • Tan P, Kumar V, Srivastava J (2004) Selecting the right objective measure for association analysis. Inf Syst 29(4):293–313
    • (2004) Inf Syst , vol.29 , Issue.4 , pp. 293-313
    • Tan, P.1    Kumar, V.2    Srivastava, J.3
  • 36
    • 33749577591 scopus 로고    scopus 로고
    • Center-piece subgraphs: problem definition and fast solutions. In: Proceedings of KDD. ACM New York
    • Tong H, Faloutsos C (2006) Center-piece subgraphs: problem definition and fast solutions. In: Proceedings of KDD. ACM New York, pp 404–413
    • (2006) pp 404–413
    • Tong, H.1    Faloutsos, C.2
  • 37
    • 34748827346 scopus 로고    scopus 로고
    • Fast random walk with restart and its applications. In: Proceedings of ICDM
    • Tong H, Faloutsos C, Pan J (2006) Fast random walk with restart and its applications. In: Proceedings of ICDM, pp 613–622
    • (2006) pp 613–622
    • Tong, H.1    Faloutsos, C.2    Pan, J.3
  • 38
    • 0033280011 scopus 로고    scopus 로고
    • IEEE Symposium on Information Visualization, 1999 (Info Vis’ 99) Proceedings
    • Wong P, Whitney P, Thomas J (1999) Visualizing association rules for text mining. In: 1999 IEEE Symposium on Information Visualization, 1999 (Info Vis’ 99) Proceedings, pp 120–123
    • (1999) pp 120–123
  • 40
    • 0034592942 scopus 로고    scopus 로고
    • Generating non-redundant association rules. In: Proceedings of KDD. ACM New York
    • Zaki M (2000) Generating non-redundant association rules. In: Proceedings of KDD. ACM New York, pp 34–43
    • (2000) pp 34–43
    • Zaki, M.1
  • 41
    • 85041436478 scopus 로고    scopus 로고
    • CHARM: An efficient algorithm for closed itemset mining. In: 2nd SIAM International Conference on Data Mining
    • Zaki M, Hsiao C (2002) CHARM: An efficient algorithm for closed itemset mining. In: 2nd SIAM International Conference on Data Mining, pp 457–473
    • (2002) pp 457–473
    • Zaki, M.1    Hsiao, C.2
  • 42
    • 85041435095 scopus 로고    scopus 로고
    • Zaki M, Parthasarathy S, Ogihara M, Li W et al (1997) New algorithms for fast discovery of association rules. In: Proceedings of KDD, vol 20
  • 43
    • 0033354342 scopus 로고    scopus 로고
    • Parallel and distributed association mining: a survey
    • Zaki MJ (1999) Parallel and distributed association mining: a survey. IEEE Concurr 7(4):14–25
    • (1999) IEEE Concurr , vol.7 , Issue.4 , pp. 14-25
    • Zaki, M.J.1
  • 44
    • 0035788918 scopus 로고    scopus 로고
    • Mason L (2001) Real world performance of association rule algorithms
    • ACM, New York
    • Zheng Z, Kohavi R, Mason L (2001) Real world performance of association rule algorithms. In: Proceedings of KDD. ACM, New York, pp 401–406
    • Proceedings of KDD , pp. 401-406
    • Zheng, Z.1    Kohavi, R.2


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