5962 search results - page 262 / 1193 » Efficient Clustering for Orders |
158
click to vote
ORDER
2002
15 years 6 months ago
2002
In this article we describe a very efficient method to construct pairwise nonisomorphic posets (equivalently, T0 topologies). We also give the results obtained by a computer progr...
181
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
Nearest neighborhood consistency is an important concept in statistical pattern recognition, which underlies the well-known k-nearest neighbor method. In this paper, we combine th...
179
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
196
click to vote
ICDM
2005
IEEE
16 years 10 days ago
2005
IEEE
We address the issue of providing highly informative and comprehensive annotations using information revealed by the structured vocabularies of Gene Ontology (GO). For a target, a...
200
click to vote
DAWAK
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Individual privacy will be at risk if a published data set is not properly de-identified. k-anonymity is a major technique to de-identify a data set. A more general view ...