Unsupervised feature selection

Computational Methods of Feature Selection

Volumn , Issue , 2007, Pages 19-39

  Dy, Jennifer G ^a  

^a NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85130928181     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (51)

1. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In Proceedings ACM SIGMOD International Conference on Management of Data, pages 94-105, Seattle, WA, ACM Press, June 1998.
2. A. Banerjee, I. S. Dhillon, J. Ghosh, S. Merugu, and D. S. Modha. A generalized maximum entropy approach to bregman co-clustering and matrix approximations. In Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 509-514, August 2004.
3. R. E. Bellman. Adaptive Control Processes. Princeton University Press, Princeton, NJ, 1961.
4. P. S. Bradley and U. M. Fayyad. Refining initial points for K-means clustering. In Proceedings of the Fifteenth International Conference on Machine Learning, pages 91-99, San Francisco, CA, Morgan Kaufmann, 1998.
5. Y. Censor and S. Zenios. Parallel Optimization: Theory, Algorithms, and Applications. Oxford University Press, 1998.
6. J.-W. Chang and D.-S. Jin. A new cell-based clustering method for large, high-dimensional data in data mining applications. In Proceedings of the 2002 ACM Symposium on Applied Computing, pages 503-507. ACM Press, 2002.
7. C. H. Cheng, A. W. Fu, and Y. Zhang. Entropy-based subspace clustering for mining numerical data. In Proceedings of the fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 84-93. ACM Press, August 1999.
8. Y. Cheng and G. M. Church. Biclustering of expression data. In Proceedings ofthe eighth International Conference on Intelligent Systems for Molecular Biology, pages 93-103, 2000.
9. H. Cho, I. S. Dhillon, Y. Guan, and S. Sra. Minimum sum-squared residue co-clustering of gene expression data. In Proceedings ofthe Fourth SIAM International Conference on Data Mining, pages 114-125, 2004.
10. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the em algorithm. Journal Royal Statistical Society, Series B, 39(1):1-38, 1977.
11. M. Devaney and A. Ram. Efficient feature selection in conceptual clustering. In Proceedings ofthe Fourteenth International Conference on Machine Learning, pages 92-97, Nashville, TN, Morgan Kaufmann, 1997.
12. I. S. Dhillon, S. Mallela, and D. S. Modha. Information-theoretic co-clustering. In Proceedings ofthe ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pages 89-98, August 2003.
13. J. G. Dy and C. E. Brodley. Interactive visualization and feature selection for unsupervised data. In Proceedings ofthe Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 360-364, Boston, MA, ACM Press, August 2000.
14. J. G. Dy and C. E. Brodley. Feature selection for unsupervised learning. Journal ofMachine Learning Research, 5:845-889, August 2004.
15. J.G.Dy, C.E. Brodley, A. Kak, L.S. Broderick, and A.M. Aisen. Unsupervised feature selection applied to content-based retrieval of lung images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(3):373-378, March 2003.
16. X. Fern and C. E. Brodley. Solving cluster ensemble problems by bipartite graph partitioning. In Proceedings of the 21st International Conference on Machine Learning, pages 281-288, 2004.
17. E. Forgy. Cluster analysis of multivariate data: Efficiency vs. inter-pretability of classifications. Bio-metrics, 21:768, 1965.
18. C. Fraley and A. E. Raftery. Model-based clustering, discriminant analysis, and density estimation. Journal of the American Statistical Association, 97(458):611-631, June 2002.
19. A. Fred and A. K. Jain. Combining multiple clustering using evidence accumulation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(6):835-850, 2005.
20. J. H. Friedman. Exploratory projection pursuit. Journal American Statistical Association, 82:249-266, 1987.
21. J. H. Friedman and J. J. Meulman. Clustering objects on subsets of attributes. Journal Royal Statistical Society B, 2004.
22. J. H. Gennari. Concept formation and attention. In Proceedings of the Thirteenth Annual Conference of the Cognitive Science Society, pages 724-728, Chicago, IL, Lawrence Erlbaum, 1991.
23. S. Goil, H. Nagesh, and A. Choudhary. Mafia: Efficient and scalable subspace clustering for very large data sets. Technical report, Northwestern University, IL, June 1999.
24. I. Guyon and A. Elisseeff. An introduction to variable and feature selection. Journal of Machine Learning Research, 3:1157-1182, 2003.
25. J. A. Hartigan. Direct clustering of a data matrix. Journal of the American Statistical Association, 67(337):123-129, March 1972.
26. X. He, D. Cai, and P. Niyogi. Laplacian score for feature selection. In Y. Weiss, B. Scholkopf, and J. Platt, editors, Advances in Neural Information Processing Systems 18, pages 507-514. MIT Press, Cambridge, MA, 2006.
27. P. Huber. Projection pursuit. The Annals of Statistics, 13(2):435-475, 1985.
28. A. Hyvärinen. Survey on independent component analysis. Neural Computing Surveys, 2:94-128, 1999.
29. A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: A review. ACM Computing Surveys, 31(3):264-323, 1999.
30. I. Jolliffe. Principal Component Analysis. Springer, New York, Second edition edition, 2002.
31. Y. S. Kim, N. Street, and F. Menczer. Evolutionary model selection in unsupervised learning. Intelligent Data Analysis, 6:531-556, 2002.
32. J. Kittler. Feature set search algorithms. In Pattern Recognition and Signal Processing, pages 41-60, 1978.
33. R. Kohavi and G. H. John. Wrappers for feature subset selection. Artificial Intelligence, special issue on relevance, 97(1-2):273-324, 1997.
34. M. H. Law, M. Figueiredo, and A. K. Jain. Feature selection in mixture-based clustering. In Advances in Neural Information Processing Systems 15, Vancouver, December 2002.
35. B. Liu, Y. Xia, and P. S. Yu. Clustering through decision tree construction. In Proceedings ofthe ninth International Conference on Information and Knowledge Management, pages 20-29. ACM Press, 2000.
36. J. Macqueen. Some methods for classifications and analysis of multivariate observations. Proc. Symp. Mathematical Statistics and Probability, 5th, Berkeley, 1:281-297, 1967.
37. D. Manoranjan, K. Choi, P. Scheuermann, and H. Liu. Feature selection for clustering - a filter solution. In Proceedings of the Second IEEE International Conference on Data Mining, pages 115-122, December 2002.
38. T. Marill and D. M. Green. On the effectiveness of receptors in recognition systems. IEEE Transactions on Information Theory, 9:11-17, 1963.
39. G. McLachlan and D. Peel. Finite Mixture Models. Wiley, New York, 2000.
40. P. M. Narendra and K. Fukunaga. A branch and bound algorithm for feature subset selection. IEEE Transactions on Computers, C-26(9):917-922, September 1977.
41. L. Parsons, E. Haque, and H. Liu. Subspace clustering for high dimensional data: A review. SIGKDD Explorations, 6(1):90-105, June 2004.
42. C. M. Procopiuc, M. Jones, P. K. Agarwal, and T. M. Murali. A monte carlo algorithm for fast projective clustering. In Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, pages 418-427. ACM Press, 2002.
43. P. Pudil, Novovicova, and J. Kittler. Floating search methods in feature selection. Pattern Recognition Letters, 15:1119-1125, 1994.
44. G. Schwarz. Estimating the dimension of a model. The Annals ofStatis-tics, 6(2):461-464, 1978.
45. S. D. Stearns. On selecting features for pattern classifiers. In Third International Conf. on Pattern Recognition, pages 71-75, 1976.
46. A. Strehl and J. Ghosh. Cluster ensembles - a knowledge reuse framework for combining multiple partitions. Journal on Machine Learning Research, 3(583-617), 2002.
47. T. Su and J. G. Dy. In search of deterministic methods for initializing k-means andgaussian mixture clustering. Intelligent Data Analysis, 11(4), 2007.
48. L. Talavera. Feature selection as a preprocessing step for hierarchical clustering. In Proceedings of the Sixteenth International Conference on Machine Learning, pages 389-397, Bled, Slovenia, Morgan Kaufmann, 1999.
49. S. Vaithyanathan and B. Dom. Model selection in unsupervised learning with applications to document clustering. In Proceedings of the Sixteenth International Conference on Machine Learning, pages 433-443, Bled, Slovenia, Morgan Kaufmann, 1999.
50. A. W. Whitney. A direct method of nonparametric measurement selection. IEEE Transactions on Computers, 20:1100-1103, 1971.
51. J. Yang, W. Wang, H. Wang, and P. Yu. s-clusters: Capturing subspace correlation in a large data set. In Proceedings ofthe 18th International Conference on Data Engineering, pages 517-528, 2002.