K-landmarks: Distributed dimensionality reduction for clustering quality maintenance
Due to the vast amount and pace of high-dimensional data production and their distribution
among network nodes, the fields of Distributed Knowledge Discovery (DKD) and Distributed …
among network nodes, the fields of Distributed Knowledge Discovery (DKD) and Distributed …
A feature selection algorithm based on discernibility matrix
F Liu, S Lu - … Conference on Computational and Information Science, 2006 - Springer
A heuristic algorithm of reduct computation for feature selection is proposed in the paper,
which is a discernibility matrix based method and aims at reducing the number of irrelevant …
which is a discernibility matrix based method and aims at reducing the number of irrelevant …
[PDF][PDF] Force-based clustering for transitive identity mapping.
HVD Parunak, SA Brueckner - AAMAS, 2013 - abcresearch.org
In most information retrieval systems, software processes (whether agent-based or not)
reason about passive items of data. An alternative approach instantiates each piece of …
reason about passive items of data. An alternative approach instantiates each piece of …
A Discernibility Matrix Based Algorithm for Feature Selection
F Liu - 2006 International Conference on Computational …, 2006 - ieeexplore.ieee.org
An algorithm of reduct computation for feature selection is proposed in the paper, which is a
discernibility matrix based method and aims at reducing the number of irrelevant and …
discernibility matrix based method and aims at reducing the number of irrelevant and …