TASC: Two-attribute-set clustering through decision tree construction

European Journal of Operational Research

Volumn 174, Issue 2, 2006, Pages 930-944

  Chen, Yen Liang ^a   Hsu, Wu Hsien ^a   Lee, Yu Hsuan ^a  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

Author keywords

Clustering; Data mining; Decision tree

Indexed keywords

ALGORITHMS; DATA MINING; DECISION THEORY; PROBLEM SOLVING; SET THEORY; TREES (MATHEMATICS);

CLUSTERING; CLUSTERING ALGORITHMS; DECISION TREES; PARTITIONING METHODS;

DATABASE SYSTEMS;

EID: 33746238956     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.04.029     Document Type: Article

References (20)

1. Ankerst, M., Breunig, M., Kriegel, H.-P., Sander, J., 1999. OPTICS: Ordering points to identify clustering structure. In: Proceedings of the ACM SIGMOD Conference, Philadelphia, PA, pp. 49-60.
2. Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P., 1999. Automatic subspace clustering of high dimensional data for data mining applications. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 94-105.
3. Basak J., and Krishnapuram R. Interpretable hierarchical clustering by constructing an unsupervised decision tree. IEEE Transactions on Knowledge and Data Engineering 17 1 (2005) 121-132
4. Bezdek J.C. Pattern Recognition with Fuzzy Objective Function Algorithms (1981), Plenum Press, New York
5. Chen Y.L., Hsu C.L., and Chou S.C. Constructing a multi-valued and multi-labeled decision tree. Expert Systems with Applications 25 2 (2003) 199-209
6. Cheng, C.H., Fu, A.W., Zhang, Y., 1999. Entropy-based subspace clustering for mining numerical data. In: Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 84-93.
7. Friedman J.H., and Fisher N.I. Bump hunting in high-dimensional data. Statistics and Computing 9 2 (1999) 123-143
8. Grabmeier J., and Rudolph A. Techniques of cluster algorithms in data mining. Data Mining and Knowledge Discovery 6 4 (2002) 303-360
9. Guha, S., Rastogi, R., and Shim, K., 1998. CURE: An efficient clustering algorithm for large databases. In: Proceedings of the ACM SIGMOD Conference, Seattle, WA, pp. 73-84.
10. Han J., and Kamber M. Data mining: Concepts and Techniques (2001), Academic Press
11. Jain A.K., Murty M.N., and Flynn P.J. Data clustering: A review. ACM Computing Surveys 31 3 (1999) 264-323
12. Kantardzic M. Data mining: Concepts, Models, Methods, and Algorithms (2002), Wiley-IEEE Press
13. Karypis G., Han E.-H., and Kumar V. CHAMELEON: A hierarchical clustering algorithm using dynamic modeling. Computer 32 (1999) 68-75
14. Keim, D., Hinneburg, A., 1999. Clustering techniques for large data sets: From the past to the future. KDD Tutorial Notes 1999, pp. 141-181.
15. Klawonn F., and Kruse R. Constructing a fuzzy controller from data. Fuzzy Sets and Systems 85 (1997) 177-193
16. Liu, B., Xia, Y., Yu, P., 2000. Clustering through decision tree construction. In: Proceedings of the 2000 ACM CIKM International Conference on Information and Knowledge Management, pp. 20-29.
17. Quinlan J.R. C4.5: Programs for Machine Learning (1993), Morgan Kaufmann, San Mateo, CA
18. Quinlan J.R. Improved use of continuous attributes in C4.5. Journal of Artificial Intelligence Research 4 (1996) 77-90
19. Ruggieri S. Efficient C4.5. IEEE Transactions Morgan Kaufmann Knowledge and Data Engineering 14 2 (2002) 438-444
20. Yao Y.Y. A comparative study of fuzzy sets and rough sets. Journal of Information Sciences 109 (1998) 227-242