Sciweavers

164 search results - page 7 / 33
» Clustering Rules Using Empirical Similarity of Support Sets
Sort
View
ICML
2007
IEEE
15 years 10 months ago
Cross-domain transfer for reinforcement learning
A typical goal for transfer learning algorithms is to utilize knowledge gained in a source task to learn a target task faster. Recently introduced transfer methods in reinforcemen...
Matthew E. Taylor, Peter Stone
ICPR
2004
IEEE
15 years 10 months ago
Spin Images for Retrieval of 3D Objects by Local and Global Similarity
The ever increasing availability of 3D models demands for tools supporting their effective and efficient management. Among these tools, those enabling content-based retrieval play...
Alberto Del Bimbo, Jürgen Assfalg, Pietro Pal...
GFKL
2004
Springer
137views Data Mining» more  GFKL 2004»
15 years 2 months ago
Density Estimation and Visualization for Data Containing Clusters of Unknown Structure
Abstract. A method for measuring the density of data sets that contain an unknown number of clusters of unknown sizes is proposed. This method, called Pareto Density Estimation (PD...
Alfred Ultsch
AMAI
2002
Springer
14 years 9 months ago
An Empirical Test of Patterns for Nonmonotonic Inference
: It is claimed that human inferential apparatus offers interesting ground in order to consider the intuitions of artificial intelligence researchers about the inference patterns a...
Rui Da Silva Neves, Jean-François Bonnefon,...
CVPR
2011
IEEE
14 years 1 months ago
Max-margin Clustering: Detecting Margins from Projections of Points on Lines
Given a unlabelled set of points X ∈ RN belonging to k groups, we propose a method to identify cluster assignments that provides maximum separating margin among the clusters. We...
Raghuraman Gopalan, Jagan Sankaranarayanan