IJCNN
2007
IEEE
14 years 7 months ago
2007
IEEE
— In this paper a clustering algorithm that learns the groups of synchronized spike trains directly from data is proposed. Clustering of spike trains based on the presence of syn...
ICRA
2007
IEEE
14 years 7 months ago
2007
IEEE
Abstract— This paper presents a novel use of spectral clustering algorithms to support cases where the entries in the affinity matrix are costly to compute. The method is increm...
ICPR
2008
IEEE
14 years 7 months ago
2008
IEEE
In this work we present a novel method to model instance-level constraints within a clustering algorithm. Thereby, both similarity and dissimilarity constraints can be used coeval...
ICPR
2008
IEEE
14 years 7 months ago
2008
IEEE
In this paper we propose a new clustering algorithm which combines the FCM clustering algorithm with the supervised learning normal mixture model; we call the algorithm as the FCM...
SIGIR
2009
ACM
14 years 7 months ago
2009
ACM
We proposed and implemented a novel clustering algorithm called LAIR2, which has constant running time average for on-the-fly Scatter/Gather browsing [4]. Our experiments showed ...
WADS
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering ...
ICDM
2009
IEEE
14 years 7 months ago
2009
IEEE
—Lack of supervision in clustering algorithms often leads to clusters that are not useful or interesting to human reviewers. We investigate if supervision can be automatically tr...
CIDM
2009
IEEE
14 years 7 months ago
2009
IEEE
– Clustering is an important task in spatial data mining and spatial analysis. We propose a clustering algorithm P-DBSCAN to cluster polygons in space. PDBSCAN is based on the we...
CVPR
2010
IEEE
14 years 9 months ago
2010
IEEE
The dynamic texture (DT) is a probabilistic generative model, defined over space and time, that represents a video as the output of a linear dynamical system (LDS). The DT model ...
ICCAD
2007
IEEE
14 years 9 months ago
2007
IEEE
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...