Sciweavers

3133 search results - page 311 / 627
» Representing clusters for retrieval
Sort
View
ICDM
2007
IEEE
119views Data Mining» more  ICDM 2007»
16 years 1 months ago
Reducing UK-Means to K-Means
This paper proposes an optimisation to the UK-means algorithm, which generalises the k-means algorithm to handle objects whose locations are uncertain. The location of each object...
Sau Dan Lee, Ben Kao, Reynold Cheng
MDAI
2007
Springer
16 years 28 days ago
Lindig's Algorithm for Concept Lattices over Graded Attributes
Formal concept analysis (FCA) is a method of exploratory data analysis. The data is in the form of a table describing relationship between objects (rows) and attributes (columns), ...
Radim Belohlávek, Bernard De Baets, Jan Out...
FGR
2006
IEEE
217views Biometrics» more  FGR 2006»
16 years 26 days ago
Face Recognition with Image Sets Using Hierarchically Extracted Exemplars from Appearance Manifolds
An unsupervised nonparametric approach is proposed to automatically extract representative face samples (exemplars) from a video sequence or an image set for multipleshot face rec...
Wei Fan, Dit-Yan Yeung
ICRA
2006
IEEE
134views Robotics» more  ICRA 2006»
16 years 25 days ago
Hierarchical Map Building and Planning based on Graph Partitioning
— Mobile robot localization and navigation requires a map - the robot’s internal representation of the environment. A common problem is that path planning becomes very ineffic...
Zoran Zivkovic, Bram Bakker, Ben J. A. Kröse
WWW
2005
ACM
16 years 11 days ago
X-warehouse: building query pattern-driven data
In this paper, we propose an approach to materialize XML data warehouses based on the frequent query patterns discovered from historical queries issued by users. The schemas of in...
Ji Zhang, Wei Wang, Han Liu, Sheng Zhang