
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Kamalika Das, Kanishka Bhaduri, Kun Liu, Hillol Kargupta, "Distributed Identification of Topl Inner Product Elements and its Application in a PeertoPeer Network," IEEE Transactions on Knowledge and Data Engineering, vol. 20, no. 4, pp. 475488, April, 2008.  
BibTex  x  
@article{ 10.1109/TKDE.2007.190714, author = {Kamalika Das and Kanishka Bhaduri and Kun Liu and Hillol Kargupta}, title = {Distributed Identification of Topl Inner Product Elements and its Application in a PeertoPeer Network}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {20}, number = {4}, issn = {10414347}, year = {2008}, pages = {475488}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2007.190714}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Distributed Identification of Topl Inner Product Elements and its Application in a PeertoPeer Network IS  4 SN  10414347 SP475 EP488 EPD  475488 A1  Kamalika Das, A1  Kanishka Bhaduri, A1  Kun Liu, A1  Hillol Kargupta, PY  2008 KW  Data mining KW  Probabilistic algorithms KW  Mining methods and algorithms KW  Algorithms for data and knowledge management KW  Knowledge management applications VL  20 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] C. Giannella, K. Liu, T. Olsen, and H. Kargupta, “Communication Efficient Construction of Decision Trees over Heterogeneously Distributed Data,” Proc. Fourth IEEE Int'l Conf. Data Mining (ICDM '04), pp. 6774, 2004.
[2] K. Liu, H. Kargupta, and J. Ryan, “Random ProjectionBased Multiplicative Data Perturbation for Privacy Preserving Distributed Data Mining,” IEEE Trans. Knowledge and Data Eng., vol. 18, no. 1, pp. 92106, Jan. 2006.
[3] K. Liu, K. Bhaduri, K. Das, P. Nguyen, and H. Kargupta, “ClientSide Web Mining for Community Formation in PeertoPeer Environments,” Proc. ACM SIGKDD Workshop Web Usage and Analysis (WebKDD '06), 2006.
[4] B. Babcock and C. Olston, “Distributed Topk Monitoring,” Proc. ACM SIGMOD '03, pp. 2839, 2003.
[5] H.A. David, Order Statistics. John Wiley & Sons, 1970.
[6] W. Hoeffding, “Probability for Sums of Bounded Random Variables,” J. Am. Statistical Assoc., no. 58, pp. 1330, 1963.
[7] H. Kargupta and K. Sivakumar, Existential Pleasures of Distributed Data Mining. Data Mining: Next Generation Challenges and Future Directions. AAAI/MIT Press, 2004.
[8] Advances in Distributed and Parallel Knowledge Discovery, H.Kargupta and P. Chan, eds. MIT Press, 2000.
[9] R.I. Arriaga and S. Vempala, “An Algorithmic Theory of Learning: Robust Concepts and Random Projection,” Proc. 40th Ann. Symp. Foundations of Computer Science (FOCS '99), pp. 616623, 1999.
[10] R. Wolff and A. Schuster, “Association Rule Mining in PeertoPeer Systems,” IEEE Trans. Systems, Man and, Cybernetics Part B: Cybernetics, vol. 34, no. 6, pp. 24262438, 2004.
[11] R. Fagin, “Combining Fuzzy Information from Multiple Systems,” Proc. ACM SIGMOD '96, pp. 216226, 1996.
[12] W.T. Balke, W. Nejdl, W. Siberski, and U. Thaden, “Progressive Distributed Topk Retrieval in PeertoPeer Networks,” Proc. 21st Int'l Conf. Data Eng. (ICDE '05), pp. 174185, 2005.
[13] F. CuencaAcuna, C. Peery, R. Martin, and T. Nguyen, “PlanetP: Using Gossiping to Build Content Addressable PeertoPeer Information Sharing Communities,” Proc. 12th Int'l Symp. HighPerformance Distributed Computing (HPDC '03), pp. 236249, 2003.
[14] S. Datta, C. Giannella, and H. Kargupta, “KMeans Clustering over Large, Dynamic Networks,” Proc. Sixth SIAM Int'l Conf. Data Mining (SDM '06), pp. 153164, 2006.
[15] R. Wolff, K. Bhaduri, and H. Kargupta, “Local L2Thresholding Based Data Mining in PeertoPeer Systems,” Proc. Sixth SIAM Int'l Conf. Data Mining (SDM '06), pp. 430441, 2006.
[16] S. Datta, K. Bhaduri, C. Giannella, R. Wolff, and H. Kargupta, “Distributed Data Mining in PeertoPeer Networks,” IEEE Internet Computing, special issue on distributed data mining, vol.10, no. 4, pp. 1826, 2006.
[17] K. Tumer and J. Ghosh, “Robust Combining of Disparate Classifiers through Order Statistics,” Pattern Analysis and Applications, vol. 5, pp. 189200, 2001.
[18] M.B. Greenwald and S. Khanna, “PowerConserving Computation of OrderStatistics over Sensor Networks,” Proc. 23rd ACM SIGACTSIGMODSIGART Symp. Principles of Database Systems (PODS '04), pp. 275285, 2004.
[19] Y.C. Ho, C.G. Cassandras, C.H. Chen, and L. Dai, “Ordinal Optimization and Simulation,” J. Operations Research Soc., vol. 51, pp. 490500, 2000.
[20] L. Lovász, “Random Walks on Graphs: A Survey,” Combinatorics, vol. 2, no. 80, pp. 146, 1993.
[21] N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, and E. Teller, “Equations of State Calculations by Fast Computing Machines,” J. Chemical Physics, vol. 21, pp. 10871092, 1953.
[22] W. Hastings, “Monte Carlo Sampling Methods Using Markov Chains and Their Applications,” Biometrika, vol. 57, pp. 97109, 1970.
[23] S. Datta and H. Kargupta, “Uniform Data Sampling from a PeertoPeer Network,” Proc. 27th Int'l Conf. Distributed Computing Systems (ICDCS '07), p. 50, 2007.
[24] A. Awan, R.A. Ferreira, S. Jagannathan, and A. Grama, “Distributed Uniform Sampling in Unstructured PeertoPeer Networks,” Proc. 39th Hawaii Int'l Conf. Systems Science (HICSS '06), 2006.
[25] P. Orponen and S.E. Schaeffer, “Efficient Algorithms for Sampling and Clustering of Large Nonuniform Networks,” Technical Report condmat/0406048, arXiv.org ePrint archive, 2004.
[26] S. Mane, S. Mopuru, K. Mehra, and J. Srivastava, “Network Size Estimation in A PeertoPeer Network,” Technical Report 05030, Univ. of Minnesota, Sept. 2005.
[27] M. Bawa, H. GarciaMolina, A. Gionis, and R. Motwani, “Estimating Aggregates on a PeertoPeer Network,” technical report, Computer Science Dept., Stanford Univ., Apr. 2003.
[28] A. Medina, A. Lakhina, I. Matta, and J. Byers, “BRITE: An Approach to Universal Topology Generation,” Proc. Ninth Int'l Workshop Modeling, Analysis, and Simulation of Computer and Telecomm. Systems (MASCOTS '01), 2001.
[29] S. Saroiu, P.K. Gummadi, and S.D. Gribble, “A Measurement Study of PeertoPeer File Sharing Systems,” Proc. SPIE/ACM Conf. Multimedia Computing and Networking (MMCN '02), pp. 156170, 2002.
[30] DDMT, http://www.umbc.edu/ddm/wiki/softwareDDMT /, 2007.
[31] A.H. Maslow, Motivation and Personality, third ed. HarperCollins, Jan. 1987.
[32] S. Castano and S. Montanelli, “Semantic SelfFormation of Communities of Peers,” Proc. Second Ann. European Semantic Web Conf. (ESWC '05), 2005.
[33] N. Noy, “Semantic Integration: A Survey of OntologyBased Approaches,” ACM SIGMOD Record, vol. 33, no. 4, pp. 6570, 2004.
[34] M. Khambatti, K.D. Ryu, and P. Dasgupta, “Efficient Discovery of Implicitly Formed PeertoPeer Communities,” Int'l J. Parallel and Distributed Systems and Networks, vol. 5, no. 4, pp. 155164, 2002.
[35] Y. Wang and J. Vassileva, “TrustBased Community Formation in PeertoPeer File Sharing Networks,” Proc. IEEE/WIC/ACM Int'l Conf. Web Intelligence (WI '04) , pp. 341348, 2004.
[36] J.P. Scott, Social Network Analysis: A Handbook, second ed. Sage Publications, Mar. 2000.
[37] J. Trajkova and S. Gauch, “Improving OntologyBased User Profiles,” Proc. Recherche d'Information Assistée par Ordinateur (RIAO '04), pp. 380389, 2004.
[38] Ö. Egecioglu and H. Ferhatosmanoglu, “Dimensionality Reduction and Similarity Computation by Inner Product Approximations,” Proc. ACM Int'l Conf. Information and Knowledge Management (CIKM '00), pp. 219226, 2000.