Sciweavers

557 search results - page 70 / 112
» Sequence Mining in Categorical Domains: Algorithms and Appli...
Sort
View
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
13 years 11 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
14 years 8 months ago
Discovering significant OPSM subspace clusters in massive gene expression data
Order-preserving submatrixes (OPSMs) have been accepted as a biologically meaningful subspace cluster model, capturing the general tendency of gene expressions across a subset of ...
Byron J. Gao, Obi L. Griffith, Martin Ester, Steve...
ICIP
2008
IEEE
14 years 9 months ago
Estimation and representation of accumulated motion characteristics for semantic event detection
In this paper, a motion-based approach for detecting high-level semantic events in video sequences is presented. Its main characteristic is its generic nature, i.e. it can be dire...
Georgios Th. Papadopoulos, Vasileios Mezaris, Ioan...
WWW
2004
ACM
14 years 8 months ago
Mining models of human activities from the web
The ability to determine what day-to-day activity (such as cooking pasta, taking a pill, or watching a video) a person is performing is of interest in many application domains. A ...
Mike Perkowitz, Matthai Philipose, Kenneth P. Fish...
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
14 years 17 days ago
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
Philippe Rolet, Michèle Sebag, Olivier Teyt...