Please use this identifier to cite or link to this item:
|Title:||Dimensionality reduction of unsupervised data|
|Citation:||Dash, M.,Liu, H.,Yao, J. (1997). Dimensionality reduction of unsupervised data. Proceedings of the International Conference on Tools with Artificial Intelligence : 532-539. ScholarBank@NUS Repository.|
|Abstract:||Dimensionality reduction is an important problem for efficient handling of large databases. Many feature selection methods exist for supervised data having class information. Little work has been done for dimensionality reduction of unsupervised data in which class information is not available. Principal Component Analysis (PCA) is often used. However, PCA creates new features. It is difficult to obtain intuitive understanding of the data using the new features only. In this paper we are concerned with the problem of determining and choosing the important original features for unsupervised data. Our method is based on the observation that removing an irrelevant feature from the feature set may not change the underlying concept of the data, but not so otherwise. We propose an entropy measure for ranking features, and conduct extensive experiments to show that our method is able to find the important features. Also it compares well with a similar feature ranking method (Relief) that requires class information unlike our method.|
|Source Title:||Proceedings of the International Conference on Tools with Artificial Intelligence|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 2, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.