1839 search results - page 168 / 368 » Feature Selection in Clustering Problems |
SSDBM
2010
IEEE
14 years 8 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
67
Voted
AAAI
2008
15 years 13 days ago
2008
Modern feature-rich telecommunications services offer significant opportunities to human users. To make these services more usable, facilitating personalisation is very important....
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. The authors present a GA optimization technique for cosinebased k-nearest neighbors classification that improves predictive accuracy in a class-balanced manner while sim...
FUZZIEEE
2007
IEEE
15 years 4 months ago
2007
IEEE
— This paper provides a broad overview of logical and black box approaches to fuzzy and rough hybridization. The logical approaches include theoretical, supervised learning, feat...
119
click to vote
KDD
2008
ACM
15 years 10 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...