Abstract
A peer community is composed of a number of peers who share files about the same topic in the file sharing P2P applications. Building peer communities can benefit content location and retrieval in P2P systems. We propose an effective approach based on rough set and topic cluster to build peer communities. Firstly, we compute one of the best reduced sets of all the same type files, such as the video files, with files’ attributes in a peer. Secondly, topic clusters of a peer are calculated, which represent the interests of it. Finally, we build peer communities using the super peer technique. Experiments performed on the real data sets prove that our approach is effective. Experimental results verify that our approach works much better compared with that of previous approaches.
This research has been supported by the National Natural Science foundation of China under Grant No.90412008, National Grand Fundamental Research 973 program of China under Grant No.2004CB318204.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A distributed anonymous information storage and retrieval system. In: Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, USA, pp. 311–320 (July 2000)
Miller, J.: Characterization of data on the gnutella peer-to-peer network. In: Proceedings of 1st IEEE Consumer Communications and Networking Conference, pp. 489–494 (2004)
Barbosa, M.W., Costa, M.M., Almeida, J.M., Almeida, V.A.F.: Using locality of reference to improve performance of peer-to-peer applications. In: Proceedings of the 4th International Workshop on Software and Performance, pp. 216–227, Shores, California, USA (2004)
Sripanidkulchai, K., Maggs, B.M., Zhang, H.: Efficient content location using interestbased locality in peer-to-peer systems. In: IEEE INFOCOM 2003, San Francisco, CA, USA (2003)
Bawa, M., Manku, G.S., Raghavan, P.: Sets: Search enhanced by topic segmentation. In: Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 306–313, Toronto, Canada (2003)
Zhu, X., Han, D., Zhu, W., Yu, Y.: An Effective Resource Description Based Approach to Find Similar Peers. In: Proc. of the Fifth IEEE International Conference on Peer-to-Peer Computing, pp. 191–198, Konstanz, Germany (2005)
Yang, M., Zhang, Z., Li, X., Dai, Y.: An Empirical Study of Free-Riding Behavior in the Maze P2P File-Sharing System. In: Proceedings of IPTPS, Ithaca, NY (February 2005)
Wille, R.: Restructuring lattice theory: An approach based on hierarchies of concepts. Ordered Sets, pp. 445–470. Reidel, Dordrecht Boston (1982)
Merz, C., Murphy, J.: UCI repository of machine learning database [EB/OL], http://www.cs.uci.edu/~mlearn/MLRepository.html 2000-10-25/2002-02-27
Guha, S., Rastogi, R., Shim, K.: CURE: an efficient clustering algorithm for large databases. In: Haas, L.M., Tiwary, A. (eds.) Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 73–84. ACM Press, New York (1998)
Xiao, M., Dai, Y., Li, X.: Split bloom filters. Chinese Journal of Electronic 32, 241–245 (2004)
Steinbach, M., Karypis, G., Kumar, V.: A comparison of document clustering techniques. Technical Report #00-034, Department of Computer Science and Engineering, University of Minnesota (2000)
Bawa, M., Manku, G.S., Raghavan, P.: Sets: Search enhanced by topic segmentation. In: Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 306–313, Toronto, Canada (2003)
Xu, J., Croft, W.B.: Cluster-based language models for distributed retrieval. In: Proceedings of the 22th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 254–261, Berkley, CA, USA (August 1999)
Klampanos, I.A., Jose, J.M.: An architecture for information retrieval over semicollaborating peer-to-peer networks. In: Proceedings of the 19th ACM Symposium on Applied Computing, pp. 1078–1083, Nicosia, Cyprus (2004)
Khambatti, M., Ryu, K., Dasgupta, P.: Efficient discovery of implicitly formed peer-topeer communities. International Journal of Parallel and Distributed Systems and Networks 5(4) (2002)
Pawlak, Z.: Rough Sets. International Journal of Computer and Information Sciences 11, 341–356 (1982)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, Q., Qiu, Z., Dai, Y., Li, X. (2007). An Effective Approach Based on Rough Set and Topic Cluster to Build Peer Communities. In: Stojmenovic, I., Thulasiram, R.K., Yang, L.T., Jia, W., Guo, M., de Mello, R.F. (eds) Parallel and Distributed Processing and Applications. ISPA 2007. Lecture Notes in Computer Science, vol 4742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74742-0_53
Download citation
DOI: https://doi.org/10.1007/978-3-540-74742-0_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74741-3
Online ISBN: 978-3-540-74742-0
eBook Packages: Computer ScienceComputer Science (R0)