5046 search results - page 333 / 1010 » Non-redundant data clustering |
149
click to vote
IDEAL
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper, we present a more effective approach to clustering with eXtended Classifier System (XCS) which is divided into two phases. The first phase is the XCS le...
157
click to vote
IJCNN
2008
IEEE
16 years 1 months ago
2008
IEEE
—Normalization before clustering is often needed for proximity indices, such as Euclidian distance, which are sensitive to differences in the magnitude or scales of the attribute...
146
click to vote
PAKDD
2004
ACM
16 years 4 days ago
2004
ACM
Abstract. Traditional clustering algorithms are based on one representation space, usually a vector space. However, in a variety of modern applications, multiple representations ex...
101
click to vote
ICPR
2006
IEEE
16 years 8 months ago
2006
IEEE
In this paper we describe a Torah Code experiment which: ? Focuses on a famous contemporary event. ? Has a simple and explicit data collection. ? Has considerably simpler measurem...
144
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
We present a novel algorithm called Clicks, that finds clusters in categorical datasets based on a search for k-partite maximal cliques. Unlike previous methods, Clicks mines subs...