메뉴 건너뛰기




Volumn 21, Issue 10, 2009, Pages 1372-1388

Approximate distributed K-means clustering over a peer-to-peer network

Author keywords

Distributed K means clustering; Peer to peer data mining

Indexed keywords

CLUSTERINGS; COMMUNICATION COST; COMPUTING RESOURCE; DATA CENTRALIZATION; DATA INTENSIVE; DISTRIBUTED DATA; DISTRIBUTED DATA MINING; DISTRIBUTED K-MEANS CLUSTERING; EMPIRICAL RESULTS; K-MEANS CLUSTERING; K-MEANS CLUSTERING ALGORITHM; NATURAL EXTENSION; P2P ENVIRONMENT; P2P NETWORK; PEER-TO-PEER DATA MINING; PEER-TO-PEER NETWORKS;

EID: 70349319868     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2008.222     Document Type: Article
Times cited : (111)

References (38)
  • 3
    • 57149132518 scopus 로고    scopus 로고
    • On efficient top-k query processing in highly distributed environments
    • A. Vlachou, C. Doulkeridis, K. Norvag, and M. Vazirgiannis, "On Efficient Top-K Query Processing in Highly Distributed Environments," Proc. ACM SIGMOD, pp. 753-764, 2008.
    • (2008) Proc. ACM SIGMOD , pp. 753-764
    • Vlachou, A.1    Doulkeridis, C.2    Norvag, K.3    Vazirgiannis, M.4
  • 5
    • 38049149862 scopus 로고    scopus 로고
    • Client-side web mining for community formation in peer-to-peer environments
    • K. Liu, K. Bhaduri, K. Das, P. Nguen, and H. Kargupta, "Client-Side Web Mining for Community Formation in Peer-to-Peer Environments," SIGKDD Explorations, vol.8, pp. 11-20, 2006.
    • (2006) SIGKDD Explorations , vol.8 , pp. 11-20
    • Liu, K.1    Bhaduri, K.2    Das, K.3    Nguen, P.4    Kargupta, H.5
  • 7
    • 8844257282 scopus 로고    scopus 로고
    • Efficient content-based P2P image retrieval using peer content descriptions
    • W. Muller, M. Eisenhart, and A. Henrich, "Efficient Content-Based P2P Image Retrieval Using Peer Content Descriptions," Proc. Internet Imaging V, pp. 57-68, 2004.
    • (2004) Proc. Internet Imaging v , pp. 57-68
    • Muller, W.1    Eisenhart, M.2    Henrich, A.3
  • 12
    • 17444400440 scopus 로고    scopus 로고
    • Distributed data clustering can be efficient and exact
    • G. Forman and B. Zhang, "Distributed Data Clustering Can Be Efficient and Exact," SIGKDD Explorations, vol.2, no.2, pp. 34-38, 2000.
    • (2000) SIGKDD Explorations , vol.2 , Issue.2 , pp. 34-38
    • Forman, G.1    Zhang, B.2
  • 14
    • 25844517631 scopus 로고    scopus 로고
    • Gossip algorithms: Design, analysis, and applications
    • S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Gossip Algorithms: Design, Analysis, and Applications," Proc. IEEE INFOCOM, vol.3, pp. 1653-1664, 2005.
    • (2005) Proc. IEEE INFOCOM , vol.3 , pp. 1653-1664
    • Boyd, S.1    Ghosh, A.2    Prabhakar, B.3    Shah, D.4
  • 16
    • 10044279537 scopus 로고    scopus 로고
    • Association rule mining in peer-to-peer systems
    • Dec.
    • R. Wolff and A. Schuster, "Association Rule Mining in Peer-to-Peer Systems," IEEE Trans. Systems, Man, and Cybernetics, Part B, vol.34, no.6, pp. 2426-2438, Dec. 2004.
    • (2004) IEEE Trans. Systems, Man, and Cybernetics , vol.34 , Issue.6 PART B , pp. 2426-2438
    • Wolff, R.1    Schuster, A.2
  • 17
    • 35348989678 scopus 로고    scopus 로고
    • A local facility location algorithm for large-scale distributed systems
    • D. Krivitski, A. Schuster, and R. Wolff, "A Local Facility Location Algorithm for Large-Scale Distributed Systems," J. Grid Computing, vol.5, no.4, pp. 361-378, 2007.
    • (2007) J. Grid Computing , vol.5 , Issue.4 , pp. 361-378
    • Krivitski, D.1    Schuster, A.2    Wolff, R.3
  • 22
    • 36949013219 scopus 로고    scopus 로고
    • A geometric approach to monitoring threshold functions over distributed data streams
    • I. Sharfman, A. Schuster, and D. Keren, "A Geometric Approach to Monitoring Threshold Functions over Distributed Data Streams," ACM Trans. Database Systems, vol.32, no.4, pp. 23:1-23:29, 2007.
    • (2007) ACM Trans. Database Systems , vol.32 , Issue.4 , pp. 231-2329
    • Sharfman, I.1    Schuster, A.2    Keren, D.3
  • 23
    • 52649172224 scopus 로고    scopus 로고
    • An efficient local algorithm for distributed multivariate regression in peer-to-peer networks
    • K. Bhaduri and H. Kargupta, "An Efficient Local Algorithm for Distributed Multivariate Regression in Peer-to-Peer Networks," Proc. SIAM Int'l Conf. Data Mining, pp. 153-164, 2008.
    • (2008) Proc. SIAM Int'l Conf. Data Mining , pp. 153-164
    • Bhaduri, K.1    Kargupta, H.2
  • 25
    • 1242310072 scopus 로고    scopus 로고
    • Peer-to-peer information retrieval using self-organizing semantic overlay networks
    • C. Tang, Z. Xu, and S. Dwarkadas, "Peer-to-Peer Information Retrieval Using Self-Organizing Semantic Overlay Networks," Proc. ACM SIGCOMM, pp. 175-186, 2004.
    • (2004) Proc. ACM SIGCOMM , pp. 175-186
    • Tang, C.1    Xu, Z.2    Dwarkadas, S.3
  • 30
    • 0002815587 scopus 로고    scopus 로고
    • A general method for scaling up machine learning algorithms and its application to clustering
    • P. Domingos and G. Hulten, "A General Method for Scaling Up Machine Learning Algorithms and Its Application to Clustering," Proc. Int'l Conf. Machine Learning (ICML '01), pp. 106-113, 2001.
    • (2001) Proc. Int'l Conf. Machine Learning (ICML '01) , pp. 106-113
    • Domingos, P.1    Hulten, G.2
  • 34
    • 25844500356 scopus 로고    scopus 로고
    • Non-uniform random membership management in peer-to-peer networks
    • M. Zhong, K. Shen, and J. Seiferas, "Non-Uniform Random Membership Management in Peer-to-Peer Networks," Proc. IEEE INFOCOM, 2005.
    • (2005) Proc. IEEE INFOCOM
    • Zhong, M.1    Shen, K.2    Seiferas, J.3
  • 38
    • 85002289052 scopus 로고    scopus 로고
    • Average diameter of network structures and its estimation
    • Z. Shen, "Average Diameter of Network Structures and Its Estimation," Proc. ACM Symp. Applied Computing (SAC '98), pp. 593-597, 1998.
    • (1998) Proc. ACM Symp. Applied Computing (SAC '98) , pp. 593-597
    • Shen, Z.1


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