
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Renchu Guan, Xiaohu Shi, Maurizio Marchese, Chen Yang, Yanchun Liang, "Text Clustering with Seeds Affinity Propagation," IEEE Transactions on Knowledge and Data Engineering, vol. 23, no. 4, pp. 627637, April, 2011.  
BibTex  x  
@article{ 10.1109/TKDE.2010.144, author = {Renchu Guan and Xiaohu Shi and Maurizio Marchese and Chen Yang and Yanchun Liang}, title = {Text Clustering with Seeds Affinity Propagation}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {23}, number = {4}, issn = {10414347}, year = {2011}, pages = {627637}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.144}, 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  Text Clustering with Seeds Affinity Propagation IS  4 SN  10414347 SP627 EP637 EPD  627637 A1  Renchu Guan, A1  Xiaohu Shi, A1  Maurizio Marchese, A1  Chen Yang, A1  Yanchun Liang, PY  2011 KW  Affinity propagation KW  text clustering KW  cofeature set KW  unilateral feature set KW  significant cofeature set. VL  23 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] Y.J. Li, C. Luo, and S.M. Chung, "Text Clustering with Feature Selection by Using Statistical Data," IEEE Trans. Knowledge and Data Eng., vol. 20, no. 5, pp. 641652, May 2008.
[2] C. Buckley and A.F. Lewit, "Optimizations of Inverted Vector Searches," Proc. Ann. ACM SIGIR, pp. 97110, 1985.
[3] N. Jardin and C.J. van Rijsbergen, "The Use of Hierarchic Clustering in Information Retrieval," Information Storage and Retrieval, vol. 7, no. 5, pp. 217240, 1971.
[4] G. Salton, Dynamic Information and Library Processing. PrenticeHall, Inc., 1975.
[5] G. Salton and M.J. McGill, Introduction to Modern Information Retrieval. McGraw Hill Book Co., 1983.
[6] E.M. Voorhees, "The Efficiency of Inverted Index and Cluster Searches," Proc. Ann. Int'l ACM SIGIR, pp. 164174, 1986.
[7] B.J. Frey and D. Dueck, "Clustering by Passing Messages between Data Points," Science, vol. 315, no. 5814, pp. 972976, Feb. 2007.
[8] B.J. Frey and D. Dueck, "NonMetric Affinity Propagation for UnSupervised Image Categorization," Proc. 11th IEEE Int'l Conf. Computer Vision (ICCV '07), pp. 18, Oct. 2007.
[9] L. Michele, Sumedha, and W. Martin, "Clustering by SoftConstraint Affinity Propagation Applications to GeneExpression Data," Bioinformatics, vol. 23, no. 20, pp. 27082715, Sept. 2007.
[10] T.Y. Jiang and A. Tuzhilin, "Dynamic Micro Targeting: FitnessBased Approach to Predicting Individual Preferences," Proc. Seventh IEEE Int'l Conf. Data Mining (ICDM '07), pp. 173182, Oct. 2007.
[11] H.F. Ma, X.H. Fan, and J. Chen, "An Incremental Chinese Text Classification Algorithm Based on Quick Clustering," Proc. 2008 Int'l Symp. Information Processing (ISIP '08), pp. 308312, May 2008.
[12] W.H. Wang, H.W. Zhang, F. Wu, and Y.T. Zhuang, "Large Scale of ELearning Resources Clustering with Parallel Affinity Propagation," Proc. Int'l Conf. Hybrid Learning 2008 (ICHL '08), pp.110, Aug. 2008.
[13] F. Sebastiani, "Machine Learning in Automated Text Categorization," ACM Computing Surveys, vol. 34, pp. 147, 2002.
[14] G. Salton, Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer. AddisonWesley, 1989.
[15] F. Wang and C.S. Zhang, "Label Propagation through Linear Neighbourhoods," IEEE Trans. Knowledge and Data Eng., vol. 20, no. 1, pp. 5567, Jan. 2008.
[16] Z.H. Zhou and M. Li, "SemiSupervised Regression with CoTraining Style Algorithms," IEEE Trans. Knowledge and Data Eng., vol. 19, no. 11, pp. 14791493, Aug. 2007.
[17] A. Blum and T. Mitchell, "Combining Labeled and Unlabeled Data with CoTraining," Proc. 11th Ann. Conf. Computational Learning Theory, pp. 92100, 1998.
[18] S. Yu, B. Krishnapuram, R. Rosales, H. Steck, and R.B. Rao, "Bayesian CoTraining," Advances in Neural Information Processing Systems, vol. 20, pp. 16651672, MIT Press, 2008.
[19] M. Belkin and P. Niyogi, "SemiSupervised Learning on Riemannian Manifolds," Machine Learning, vol. 56, pp. 209239, 2004.
[20] Z.H. Zhou, D.C. Zhan, and Q. Yang, "SemiSupervised Learning with Very Few Labeled Training Examples," Proc. 22nd AAAI Conf. Artificial Intelligence, pp. 675680, 2007.
[21] Z.H. Zhou and M. Li, "TriTraining: Exploiting Unlabeled Data Using Three Classifiers," IEEE Trans. Knowledge and Data Eng., vol. 17, no. 11, pp. 15291541, Nov. 2005.
[22] O. Chapelle, B. Schölkopf, and A. Zien, SemiSupervised Learning. MIT Press, 2006.
[23] C.J. van Rijsbergen, Information Retrieval, second ed., pp. 2228. Butterworth, 1979.
[24] J. MacQUEEN, "Some Methods for Classification and Analysis of Multivariate Observations," Proc. Fifth Berkeley Symp. Math. Statistics and Probability, pp. 281297, 1967.
[25] X.D. Wu and C.Q. Zhang, "Efficient Mining of Both Positive and Negative Association Rules," ACM Trans. Information Systems, vol. 22, no. 3, pp. 381405, July 2004.
[26] M.J. MañaLópez, M.D. Buenaga, and J.M. GómezHidalgo, "Multidocument Summarization: An Added Value to Clustering in Interactive Retrieval," ACM Trans. Information Systems, vol. 22, no. 2, pp. 215241, Apr. 2004.
[27] L.P. Jing, M.K. Ng, and J.Z. Huang, "An Entropy Weighting KMeans Algorithm for Subspace Clustering of HighDimensional Sparse Data," IEEE Trans. Knowledge and Data Eng., vol. 19, no. 8, pp. 10261041, Aug. 2007.
[28] S. Huang, Z. Chen, Y. Yu, and W.Y. Ma, "Multitype Features Coselection for Web Document Clustering," IEEE Trans. Knowledge and Data Eng., vol. 18, no. 4, pp. 448458, Apr. 2006.
[29] X.D. Wu et al., "Top 10 Algorithms in Data Mining," Knowledge and Information Systems, vol. 14, no. 1, pp. 137, Jan. 2008.
[30] M.J. Brusco and H.F. Kohn, "Comment on 'Clustering by Passing Messages between Data Points,'" Science, vol. 319, no. 5864, p. 726c, Feb. 2008.
[31] B.J. Frey and D. Dueck, "Response to Comment on 'Clustering by Passing Messages Between Data Points,'" Science, vol. 319, no. 5864, p. 726d, Feb. 2008.
[32] J. Wu, F. Ding, and Q.L. Xiang, "An Affinity Propagation Based Method for Vector Quantization," Eprint arXiv 0710.2037, http://arxiv.org/abs0710.2037v2, Oct. 2007.
[33] K.J. Wang, J.Y. Zhang, D. Li, X.N. Zhang, and T. Guo, "Adaptive Affinity Propagation Clustering," Acta Automatica Sinica, vol. 33, no. 12, pp. 12421246, Dec. 2007.
[34] S. Gao, W. Wu, C.H. Lee, and T.S. Chua, "A Maximal FigureofMerit (MFoM)Learning Approach to Robust Classifier Design for Text Categorization," ACM Trans. Information Systems, vol. 24, no. 2, pp. 190218, Apr. 2006.
[35] Z.H. Zhou and M. Li, "Distributional Features for Text Categorization," IEEE Trans. Knowledge and Data Eng., vol. 21, no. 3, pp. 428442, Mar. 2009.
[36] D.D. Lewis, "Reuters21578 Text Categorization Test Collection," http://www.daviddlewis.com/resources/testcollections reuters21578, May 2004.
[37] A. Estabrooks, T. Jo, and N. Japkowicz, "A Multiple Resampling Method for Learning from Imbalanced Data Sets," Computational Intelligence, vol. 2, no. 1, pp. 1836, 2004.
[38] S. Dumais, J. Platt, D. Heckerman, and M. Sahami, "Inductive Learning Algorithms and Representations for Text Categorization," Proc. Seventh Int'l Conf. Information and Knowledge Management, pp. 148155, 1998.
[39] http://www.psi.toronto.edu/affinitypropagation faq.html, 2010.
[40] H. Zha, C. Ding, M. Gu, X. He, and H.D. Simon, "Spectral Relaxation for KMeans Clustering," Advances in Neural Information Processing Systems, vol. 14, pp. 10571064, MIT Press, 2001.
[41] L. Bottou and Y. Bengio, "Convergence Properties of the KMeans," Advances in Neural Information Processing Systems, vol. 7, pp. 585592, MIT Press, 1995.