Sciweavers

452 search results - page 33 / 91
» On Weighting Clustering
Sort
View
85
Voted
CLASSIFICATION
2006
103views more  CLASSIFICATION 2006»
14 years 12 months ago
On the Complexity of Ordinal Clustering
Abstract. Given a set of pairwise distances on a set of n points, constructing an edge-weighted tree whose leaves are these n points such that the tree distances would mimic the or...
Rahul Shah, Martin Farach-Colton
ICALP
2011
Springer
14 years 3 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner
PR
2008
170views more  PR 2008»
14 years 11 months ago
Annealing and the normalized N-cut
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
Tomás Gedeon, Albert E. Parker, Collette Ca...
ISDA
2006
IEEE
15 years 5 months ago
Modular Neural Network Task Decomposition Via Entropic Clustering
The use of monolithic neural networks (such as a multilayer perceptron) has some drawbacks: e.g. slow learning, weight coupling, the black box effect. These can be alleviated by t...
Jorge M. Santos, Luís A. Alexandre, Joaquim...
ICASSP
2009
IEEE
14 years 9 months ago
Phoneme cluster based state mapping for text-independent voice conversion
This paper takes phonetic information into account for data alignment in text-independent voice conversion. Hidden Markov Models are used for representing the phonetic structure o...
Meng Zhang, Jiaohua Tao, Jani Nurminen, Jilei Tian...