Unsupervised feature selection with ensemble learning
H Elghazel, A Aussem - Machine Learning, 2015 - Springer
In this paper, we show that the way internal estimates are used to measure variable
importance in Random Forests are also applicable to feature selection in unsupervised …
importance in Random Forests are also applicable to feature selection in unsupervised …
Entropy based probabilistic collaborative clustering
Unsupervised machine learning approaches involving several clustering algorithms working
together to tackle difficult data sets are a recent area of research with a large number of …
together to tackle difficult data sets are a recent area of research with a large number of …
t-Distributed stochastic neighbor embedding spectral clustering
N Rogovschi, J Kitazono, N Grozavu… - … joint conference on …, 2017 - ieeexplore.ieee.org
This paper introduces a new topological clustering approach to cluster high dimensional
datasets based on t-SNE (Stochastic Neighbor Embedding) dimensionality reduction …
datasets based on t-SNE (Stochastic Neighbor Embedding) dimensionality reduction …
[PDF][PDF] Generating Javanese Stopwords List using K-means Clustering Algorithm.
Text processing in Information Retrieval (IR) requires text documents as primary data
sources. However, not all words in the text document are used. Some words often appear in …
sources. However, not all words in the text document are used. Some words often appear in …
[PDF][PDF] Modified binary bat algorithm for feature selection in unsupervised learning.
R Ramasamy, S Rani - Int. Arab J. Inf. Technol., 2018 - ccis2k.org
Feature selection is the process of selecting a subset of optimal features by removing
redundant and irrelevant features. In supervised learning, feature selection process uses …
redundant and irrelevant features. In supervised learning, feature selection process uses …
Feature selection for unsupervised learning using random cluster ensembles
H Elghazel, A Aussem - 2010 IEEE International Conference on …, 2010 - ieeexplore.ieee.org
In this paper, we propose another extension of the Random Forests paradigm to unlabeled
data, leading to localized unsupervised feature selection (FS). We show that the way internal …
data, leading to localized unsupervised feature selection (FS). We show that the way internal …
[PDF][PDF] An Information Theory based Approach to Multisource Clustering.
Clustering is a compression task which consists in grouping similar objects into clusters. In
real-life applications, the system may have access to several views of the same data and …
real-life applications, the system may have access to several views of the same data and …
[PDF][PDF] Impact of learners' quality and diversity in collaborative clustering
Collaborative Clustering is a data mining task the aim of which is to use several clustering
algorithms to analyze different aspects of the same data. The aim of collaborative clustering …
algorithms to analyze different aspects of the same data. The aim of collaborative clustering …
A new method for splitting clumped cells in red blood images
Automated cell counting is a required task which helps examiners in evaluating blood
smears. A problem is that clumped cells usually appear in images with various degree of …
smears. A problem is that clumped cells usually appear in images with various degree of …
Recursive feature elimination with ensemble learning using som variants
A Filali, C Jlassi, N Arous - International Journal of Computational …, 2017 - World Scientific
To uncover an appropriate latent subspace for data representation, we propose in this paper
a new extension of the random forests method which leads to the unsupervised feature …
a new extension of the random forests method which leads to the unsupervised feature …