Sciweavers

51 search results - page 7 / 11
» K-medoid-style Clustering Algorithms for Supervised Summary ...
Sort
View
DASFAA
2010
IEEE
419views Database» more  DASFAA 2010»
14 years 2 months ago
Incremental Clustering for Trajectories
Trajectory clustering has played a crucial role in data analysis since it reveals underlying trends of moving objects. Due to their sequential nature, trajectory data are often rec...
Zhenhui Li, Jae-Gil Lee, Xiaolei Li, Jiawei Han
WWW
2005
ACM
14 years 1 months ago
Finding the boundaries of information resources on the web
In recent years, many algorithms for the Web have been developed that work with information units distinct from individual web pages. These include segments of web pages or aggreg...
Pavel Dmitriev, Carl Lagoze, Boris Suchkov
EMNLP
2010
13 years 5 months ago
Unsupervised Discovery of Negative Categories in Lexicon Bootstrapping
Multi-category bootstrapping algorithms were developed to reduce semantic drift. By extracting multiple semantic lexicons simultaneously, a category's search space may be res...
Tara McIntosh
DAGM
2010
Springer
13 years 7 months ago
Semi-supervised Learning of Edge Filters for Volumetric Image Segmentation
Abstract. For every segmentation task, prior knowledge about the object that shall be segmented has to be incorporated. This is typically performed either automatically by using la...
Margret Keuper, Robert Bensch, Karsten Voigt, Alex...
ICCV
2009
IEEE
1824views Computer Vision» more  ICCV 2009»
15 years 14 days ago
Beyond the Euclidean distance: Creating effective visual codebooks using the histogram intersection kernel
Common visual codebook generation methods used in a Bag of Visual words model, e.g. k-means or Gaussian Mixture Model, use the Euclidean distance to cluster features into visual...
Jianxin Wu, James M. Rehg