Sciweavers

1601 search results - page 150 / 321
» Closed Sets for Labeled Data
Sort
View
SCHOLARPEDIA
2008
89views more  SCHOLARPEDIA 2008»
15 years 4 months ago
Support vector clustering
We present a novel method for clustering using the support vector machine approach. Data points are mapped to a high dimensional feature space, where support vectors are used to d...
Asa Ben-Hur
TRECVID
2008
15 years 7 months ago
Learning TRECVID'08 High-Level Features from YouTube
Run No. Run ID Run Description infMAP (%) training on TV08 data 1 IUPR-TV-M SIFT visual words with maximum entropy 6.1 2 IUPR-TV-MF SIFT with maximum entropy, fused with color+tex...
Adrian Ulges, Christian Schulze, Markus Koch, Thom...
APVIS
2007
15 years 7 months ago
A comparison of vertex ordering algorithms for large graph visualization
In this study, we examine the use of graph ordering algorithms for visual analysis of data sets using visual similarity matrices. Visual similarity matrices display the relationsh...
Christopher Mueller, Benjamin Martin, Andrew Lumsd...
KDD
2009
ACM
193views Data Mining» more  KDD 2009»
16 years 1 months ago
Category detection using hierarchical mean shift
Many applications in surveillance, monitoring, scientific discovery, and data cleaning require the identification of anomalies. Although many methods have been developed to iden...
Pavan Vatturi, Weng-Keen Wong
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
16 years 7 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer