Combinatorial feature selection problems

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2000, Pages 631-640

  Charikar, Moses ^a   Guruswami, Venkatesan ^b   Kumar, Ravi ^c   Rajagopalan, Sridhar ^c   Sahai, Amit ^b  

^a Stanford University   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; OBJECT RECOGNITION; PROBLEM SOLVING; SET THEORY;

COMBINATORIAL FEATURE SELECTION PROBLEMS;

FEATURE EXTRACTION;

EID: 0034507847     PISSN: 02725428     EISSN: None     Source Type: Journal    
DOI: 10.1109/SFCS.2000.892331     Document Type: Article

References (30)

1. C. Aggarwal C. Procopiuc J. Wolf P. Wu J. S. Park Fast algorithms for projected clustering Proc. SIGMOD 61 72 Proc. SIGMOD 1999
2. R. Agrawal J. Gehrke D. Gunopulos P. Raghavan Automatic subspace clustering of high dimensional data for data mining applications Proc. SIGMOD 94 105 Proc. SIGMOD 1998
3. Y. Aumann Y. Rabani An O(lg k) approximate min-cut max-flow theorem and approximation algorithm SIAM J. Comput. 27 1 291 301 1998
4. J. Bourgain On Lipschitz embedding of finite metric spaces in Hilbert space Israel J. Math. 52 46 52 1985
5. S. Chakrabarti B. Dom R. Agrawal P. Raghavan Using taxonomy, discriminants, and signatures to navigate in text databases Proc. 23rd VLDB Proc. 23rd VLDB 1997
6. S. Chakrabarti B. Dom P. Indyk Enhanced hypertext categorization using hyperlinks Proc. SIGMOD Proc. SIGMOD 1998
7. C. Chekuri S. Khanna On multidimensional packing problems Proc. 10th SODA 185 194 Proc. 10th SODA 1999
8. M. Dash H. Liu Handling large unsupervised data via dimensionality reduction Proc. SIGMOD Workshop on research issues in data mining and knowledge discovery Proc. SIGMOD Workshop on research issues in data mining and knowledge discovery 1999
9. S. Dasgupta Learning mixtures of Gaussians Proc. 40th FOCS Proc. 40th FOCS 1999
10. S. Deerwester S. Dumais G. Furnas T. Landauer R. Harshman Indexing by latent semantic analysis J. Amer. Soc. for Inf. Sci. 41 6 391 407 1990
11. M. E. Dyer A. M. Frieze A simple heuristic for the p-center problem Oper. Res. Lett. 3 285 288 1985
12. Advances in Knowledge Discovery and Data Mining 1996 AAAI/MIT Press
13. U. Feige M. Seltser On the densest k-subgraph problems 1997 CS TR 97-16 Weizmann Institute of Science
14. J. Håstad Clique is hard to approximate within n1-€ Proc. 37th FOCS 627 636 Proc. 37th FOCS 1996
15. D. S. Hochbaum D. B. Shmoys A best possible approximation algorithm for the k-center problem Math. Oper. Res. 10 180 184 1985
16. G. John R. Kohavi K. Pfleger Irrelevant features and the subset selection problem Proc. ML Proc. ML 1994
17. W. B. Johnson J. Lindenstrauss Extensions of Lipschitz mappings into a Hilbert space Contemporary Math. 26 189 206 1984
18. D. Koller M. Sahami Towards optimal feature selection Proc. ICML 284 292 Proc. ICML 1996
19. D. Koller M. Sahami Hierarchically classifying documents using very few words Proc. 14th ML 170 178 Proc. 14th ML 1997
20. E. Kushilevitz R. Ostrovsky Y. Rabani Efficient search for approximate nearest neighbor in high dimensional spaces Proc. 30th STOC 614 623 Proc. 30th STOC 1998
21. N. Linial E. London Y. Rabinovich The geometry of graphs and some of its algorithmic applications Proc.35th FOCS 577 591 Proc.35th FOCS 1994
22. R. Motwani P. Raghavan Randomized Algorithms 1995 Cambridge University Press
23. C. Papadimitrious P. Raghavan H. Tamaki S. Vempala Latent semantic indexing: A probabilistic analysis Proc. PODS Proc. PODS 1997
24. C. Papadimitriou M. Yannakakis On Limited Nondeterminism and the complexity of the VC-dimension IEEE Conf. on Comp. Complexity 12 18 IEEE Conf. on Comp. Complexity 1993
25. P. Raghavan C. D. Thompson Randomized rounding: A technique for provably good algorithms and algorithmic proofs Combinatorica 7 365 374 1987
26. G. Salton Automatic Text Processing 1989 Addison Wesley
27. A. Srinivasan Improved approximations of packing and covering problems Proc. 27th STOC 268 276 Proc. 27th STOC 1995
28. G.K. Zipf Human behaviour and the principle of least effort 1949 Hafner New York