
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Edward K.F. Dang, Robert W.P. Luk, D.L. Lee, K.S. Ho, Stephen C.F. Chan, "Optimal Combination of Nested Clusters by a Greedy Approximation Algorithm," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 31, no. 11, pp. 20832087, November, 2009.  
BibTex  x  
@article{ 10.1109/TPAMI.2009.75, author = {Edward K.F. Dang and Robert W.P. Luk and D.L. Lee and K.S. Ho and Stephen C.F. Chan}, title = {Optimal Combination of Nested Clusters by a Greedy Approximation Algorithm}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {31}, number = {11}, issn = {01628828}, year = {2009}, pages = {20832087}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2009.75}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  Optimal Combination of Nested Clusters by a Greedy Approximation Algorithm IS  11 SN  01628828 SP2083 EP2087 EPD  20832087 A1  Edward K.F. Dang, A1  Robert W.P. Luk, A1  D.L. Lee, A1  K.S. Ho, A1  Stephen C.F. Chan, PY  2009 KW  Clustering KW  classification KW  performance evaluation KW  optimization. VL  31 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
[1] A.K. Jain, R.P.W. Duin, and J. Mao, “Statistical Pattern Recognition: A Review,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 1, pp. 437, Jan. 2000.
[2] D. Judd, P.K. McKinley, and A.K. Jain, “LargeScale Parallel Data Clustering,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, no. 8, pp. 871876, Aug. 1998.
[3] C. Carpineto and G. Romano, “A Lattice Conceptual Clustering System and Its Application to Browsing Retrieval,” Machine Learning, vol. 24, pp. 95122, 1996.
[4] N. Jardine and C.J. van Rijsbergen, “The Use of Hierarchical Clustering in Information Retrieval,” Information Storage and Retrieval, vol. 7, pp. 217240, 1971.
[5] B. Larsen and C. Aone, “Fast and Effective Text Mining Using LinearTime Document Clustering,” Proc. Fifth Int'l Conf. Knowledge Discovery and Data Mining, pp. 1622, 1999.
[6] Y. Zhao and G. Karypis, “Evaluation of Hierarchical Clustering Algorithms for Document Datasets,” Proc. Int'l Conf. Information and Knowledge Management, pp. 515524, 2002.
[7] E.K.F. Dang, R.W.P. Luk, K.S. Ho, S.C.F. Chan, and D.L. Lee, “A New Measure of Clustering Effectiveness: Algorithms and Experimental Studies,” J. Am. Soc. Information Science and Technology, vol. 59, no. 3, pp.390406, 2008.
[8] S. Koshman, A. Spink, and B.J. Jansen, “Web Searching on the Vivisimo Search Engine,” J. Am. Soc. Information Science and Technology, vol. 57, pp.18751887, 2006.
[9] W.B. Croft, “A Model of Cluster Searching Based on Classification,” Information Systems, vol. 5, pp. 189195, 1980.
[10] P. Willett, “Recent Trends in Hierarchical Document Clustering: A Critical Review,” Information Processing and Management, vol. 24, pp. 577597, 1988.
[11] A. Tombros, R. Villa, and C.J. van Rijsbergen, “The Effectiveness of QuerySpecific Hierarchical Clustering in Information Retrieval,” Information Processing and Management, vol. 38, pp. 559582, 2002.
[12] B.J. Gao and M. Ester, “Clusters Description Formats, Problems and Algorithms,” Proc. SIAM Int'l Conf. Data Mining, J. Ghosh and D. Lambert, eds., pp. 462466, 2006.
[13] R.D. Carr, S. Doddi, G. Konjevod, and M. Marathe, “On the RedBlue Set Cover Problem,” Proc. 11th Ann. ACMSIAM Symp. Discrete Algorithms, pp.345353, 2000.
[14] D. Peleg, “Approximation Algorithms for the LabelCover MAX and RedBlue Set Cover Problems,” Proc. Seventh Scandinavian Workshop Algorithm Theory, M.M. Halldorsson, ed., pp. 220230, 2000.
[15] P. Robillard, “(0,1) Hyperbolic Programming Problems,” Naval Research Logistics Quarterly, vol. 18, pp. 4758, 1971.
[16] P. Hansen, M.V. Poggi de Aragao, and C.C. Ribeiro, “Hyperbolic 01 Programming and Query Optimization in Information Retrieval,” Math. Programming, vol. 52, pp. 255263, 1991.
[17] A. Murua, W. Stuetzle, J. Tantrum, and S. Sieberts, “Model Based Document Classification and Clustering,” Int'l J. Tomography and Statistics, vol. 8, pp. 124, 2008.
[18] L. Hubert and P. Arabie, “Comparing Partitions,” J. Classification, vol. 2, pp.193218, 1985.