메뉴 건너뛰기




Volumn 34, Issue 6, 2004, Pages 2426-2438

Association rule mining in peer-to-peer systems

Author keywords

Anytime algorithms; Association rule mining; Data mining; Local algorithms; Peer to peer

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; DATA COMMUNICATION SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; DISTRIBUTED DATABASE SYSTEMS; NETWORK PROTOCOLS; PROBLEM SOLVING; TELECOMMUNICATION TRAFFIC;

EID: 10044279537     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2004.836888     Document Type: Article
Times cited : (74)

References (28)
  • 1
    • 0006303639 scopus 로고    scopus 로고
    • Mining association rules between sets of items in large databases
    • [Online]. Available: citeseer.nj.nec.com/agrawal93mining.html
    • R. Agrawal, T. Imielinski, and A. N. Swami, Mining association rules between sets of items in large databases, presented at ACM SIGMOD Int. Conf. Management Data. [Online]. Available: citeseer.nj.nec.com/ agrawal93mining.html
    • ACM SIGMOD Int. Conf. Management Data
    • Agrawal, R.1    Imielinski, T.2    Swami, A.N.3
  • 6
    • 0031699077 scopus 로고    scopus 로고
    • Mining association rules: Anti-skew algorithms
    • [Online]. Available
    • J.-L. Lin and M. H. Dunham, Mining association rules: Anti-skew algorithms, presented at Proc. 14th Int. Conf. Data Engineering (ICDE). [Online]. Available: http://www.seas.smu.edu/jun/Papers/MINE/now.ps
    • Proc. 14th Int. Conf. Data Engineering (ICDE)
    • Lin, J.-L.1    Dunham, M.H.2
  • 7
    • 10044296899 scopus 로고    scopus 로고
    • "A high-performance algorithm for distributed association rule mining"
    • Melbourne, FL
    • A. Schuster, R. Wolff, and D. Trock, "A high-performance algorithm for distributed association rule mining," in Proc. IEEE Conf. Data Mining ICDM, Melbourne, FL, 2003.
    • (2003) Proc. IEEE Conf. Data Mining ICDM
    • Schuster, A.1    Wolff, R.2    Trock, D.3
  • 10
  • 13
    • 10044241347 scopus 로고    scopus 로고
    • The Condor Project [Online]. Available
    • The Condor Project [Online]. Available: http://www.cs.wisc.edu/condor/
  • 14
    • 10044221643 scopus 로고    scopus 로고
    • Setiηome [Online]. Available
    • Setiηome [Online]. Available: http://setiathome.ssl.berkeley.edu/
  • 15
    • 10044277727 scopus 로고    scopus 로고
    • United Devices Inc. [Online]. Available
    • United Devices Inc. [Online]. Available: http://www.ud.com/home.htm
  • 16
    • 10044259391 scopus 로고    scopus 로고
    • Entropia [Online]. Available
    • Entropia [Online]. Available: http://www.entropia.com
  • 17
    • 0029733589 scopus 로고    scopus 로고
    • "Maintenance of discovered association rules in large databases: An incremental updating technique"
    • D. W.-L. Cheung, J. Han, V. Ng, and C. Y. Wong, "Maintenance of discovered association rules in large databases: An incremental updating technique," in Proc. 12th Int. Conf. Data Engineering, ICDE, 1996, pp. 106-114.
    • (1996) Proc. 12th Int. Conf. Data Engineering, ICDE , pp. 106-114
    • Cheung, D.W.-L.1    Han, J.2    Ng, V.3    Wong, C.Y.4
  • 18
    • 85049125672 scopus 로고    scopus 로고
    • "An efficient algorithm for the incremental updation of association rules in large databases"
    • Newport Beach, CA, Aug
    • S. Thomas, S. Bodagala, K. Alsabti, and S. Ranka, "An efficient algorithm for the incremental updation of association rules in large databases," in Proc. ACM SIGKDD Conf. Knowledge Discovery Data Mining, Newport Beach, CA, Aug. 1997, pp. 263-266.
    • (1997) Proc. ACM SIGKDD Conf. Knowledge Discovery Data Mining , pp. 263-266
    • Thomas, S.1    Bodagala, S.2    Alsabti, K.3    Ranka, S.4
  • 19
    • 10044280117 scopus 로고    scopus 로고
    • Incremental mining of constrained associations
    • [Online]. Available citeseer.nj.nec.com/301407.html
    • S. Thomas and S. Chakravarthy, Incremental mining of constrained associations, presented at Int. Conf. High Performance Computing HiPC. [Online]. Available: citeseer.nj.nec.com/301407.html
    • Int. Conf. High Performance Computing HiPC
    • Thomas, S.1    Chakravarthy, S.2
  • 22
    • 10044265014 scopus 로고    scopus 로고
    • Fault-local distributed mending
    • presented at ACM Symp. Principle Distributed Computing (PODC) [Online]. Available: citeseer.nj.nec.com/kutten94faultlocal.html
    • S. Kutten and D. Peleg, Fault-local distributed mending, presented at ACM Symp. Principle Distributed Computing (PODC). [Online]. Available: citeseer.nj.nec.com/kutten94faultlocal.html
    • Kutten, S.1    Peleg, D.2
  • 23
    • 0003150383 scopus 로고    scopus 로고
    • "Stabilizing time-adaptive protocols"
    • S. Kutten and B. Patt-Shamir, "Stabilizing time-adaptive protocols," Theor. Comput. Sci., vol. 220, no. 1, pp. 93-111, 1999.
    • (1999) Theor. Comput. Sci. , vol.220 , Issue.1 , pp. 93-111
    • Kutten, S.1    Patt-Shamir, B.2
  • 24
    • 84976815497 scopus 로고
    • "Fail-stop processors: An approach to designing fault-tolerant computing systems"
    • R. D. Schlichting and F. B. Schneider, "Fail-stop processors: An approach to designing fault-tolerant computing systems," ACM Trans. Comput. Syst. (TOCS), vol. 1, no. 3, pp. 222-238, 1983.
    • (1983) ACM Trans. Comput. Syst. (TOCS) , vol.1 , Issue.3 , pp. 222-238
    • Schlichting, R.D.1    Schneider, F.B.2
  • 25
    • 0034826383 scopus 로고    scopus 로고
    • "Communication-efficient distributed mining of association rules"
    • Santa Barbara, CA, May
    • A. Schuster and R. Wolff, "Communication-efficient distributed mining of association rules," in Proc. ACM SIGMOD Int. Conf. Management Data, Santa Barbara, CA, May 2001, pp. 473-484.
    • (2001) Proc. ACM SIGMOD Int. Conf. Management Data , pp. 473-484
    • Schuster, A.1    Wolff, R.2
  • 26
    • 0031162961 scopus 로고    scopus 로고
    • "Dynamic itemset counting and implication rules for market basket data"
    • June
    • S. Brin, R. Motwani, J. Ullman, and S. Tsur, "Dynamic itemset counting and implication rules for market basket data," SIGMOD Rec., vol. 6, no. 2, pp. 255-264, June 1997.
    • (1997) SIGMOD Rec. , vol.6 , Issue.2 , pp. 255-264
    • Brin, S.1    Motwani, R.2    Ullman, J.3    Tsur, S.4
  • 28
    • 1242308945 scopus 로고    scopus 로고
    • "Selecting the right objective measure for association analysis"
    • June
    • P.-N. Tan, V. Kumar, and J. Srivastava, "Selecting the right objective measure for association analysis," Inform. Syst., vol. 29, no. 4, pp. 293-313, June 2004.
    • (2004) Inform. Syst. , vol.29 , Issue.4 , pp. 293-313
    • Tan, P.-N.1    Kumar, V.2    Srivastava, J.3


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