Automatic construction of N-ary tree based taxonomies

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2006, Pages 75-79

  Punera, Kunal ^a   Rajan, Suju ^a   Ghosh, Joydeep ^a  

^a The University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTER RECOGNITION; DATA MINING; SPECTRUM ANALYSIS; TAXONOMIES; TEXT PROCESSING;

AUTOMATIC CONSTRUCTION; CLASSIFICATION ACCURACY; DIVERSE DOMAINS; HIERARCHICAL ORGANIZATIONS; REAL LIFE DATASETS; SPACE DECOMPOSITION; TEXT MINING; USER-DEFINED PARAMETERS;

BINARY TREES;

EID: 57349106066     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icdmw.2006.35     Document Type: Conference Paper

References (6)

1. th KDD, pages 191-200, 2002.
2. D. Koller and M. Sahami. Hierarchically classifying documents using very few words. In ICML, pages 170-178, 1997.
3. K. Punera, S. Rajan, and J. Ghosh. Automatic construction of n-ary tree based taxonomies. Technical Report IDEAL- 2006-TR06, Electrical and Computer Engineering, University of Texas at Austin, [www.lans.ece.utexas.edu/~kunal/ papers/icdm06-nary-long.pdf], 2006.
4. th NIPS, 2001.
5. th NIPS, 1999.
6. V. Vural and J. G. Dy. A hierarchical method for multi-class support vector machines. In 21st ICML, 2004.