Sciweavers

1110 search results - page 2 / 222
» Clustering with the Connectivity Kernel
Sort
View
NIPS
2004
13 years 6 months ago
The Laplacian PDF Distance: A Cost Function for Clustering in a Kernel Feature Space
A new distance measure between probability density functions (pdfs) is introduced, which we refer to as the Laplacian pdf distance. The Laplacian pdf distance exhibits a remarkabl...
Robert Jenssen, Deniz Erdogmus, José Carlos...
JCST
2000
89views more  JCST 2000»
13 years 5 months ago
LinuxDirector: A Connection Director for Scalable Internet Services
LinuxDirector is a connection director that supports load balancing among multiple Internet servers, which can be used to build scalable Internet services based on clusters of ser...
Zhang Wensong, Shiyao Jin, Quanyuan Wu
IJCNN
2006
IEEE
13 years 11 months ago
Information Theoretic Angle-Based Spectral Clustering: A Theoretical Analysis and an Algorithm
— Recent work has revealed a close connection between certain information theoretic divergence measures and properties of Mercer kernel feature spaces. Specifically, it has been...
Robert Jenssen, Deniz Erdogmus, Jose C. Principe
LATIN
2010
Springer
14 years 3 days ago
Kernelization through Tidying
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...
René van Bevern, Hannes Moser, Rolf Niederm...
ISBRA
2007
Springer
13 years 11 months ago
Discovering Relations Among GO-Annotated Clusters by Graph Kernel Methods
The biological interpretation of large-scale gene expression data is one of the challenges in current bioinformatics. The state-of-theart approach is to perform clustering and then...
Italo Zoppis, Daniele Merico, Marco Antoniotti, Bu...