Sciweavers

1427 search results - page 128 / 286
» Kernels for Semi-Structured Data
Sort
View
EGITALY
2006
15 years 2 months ago
3D Data Segmentation Using a Non-Parametric Density Estimation Approach
In this paper, a new segmentation approach for sets of 3D unorganized points is proposed. The method is based on a clustering procedure that separates the modes of a non-parametri...
Umberto Castellani, Marco Cristani, Vittorio Murin...
132
Voted
JMLR
2008
148views more  JMLR 2008»
15 years 23 days ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
SIGIR
2008
ACM
15 years 22 days ago
Learning to rank with partially-labeled data
Ranking algorithms, whose goal is to appropriately order a set of objects/documents, are an important component of information retrieval systems. Previous work on ranking algorith...
Kevin Duh, Katrin Kirchhoff
DIS
2006
Springer
15 years 4 months ago
Clustering Pairwise Distances with Missing Data: Maximum Cuts Versus Normalized Cuts
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...
Jan Poland, Thomas Zeugmann
88
Voted
ECCV
2002
Springer
16 years 2 months ago
Time-Recursive Velocity-Adapted Spatio-Temporal Scale-Space Filters
Abstract. This paper presents a theory for constructing and computing velocity-adapted scale-space filters for spatio-temporal image data. Starting from basic criteria in terms of ...
Tony Lindeberg