Sciweavers

PKDD
2010
Springer
125views Data Mining» more  PKDD 2010»
13 years 2 months ago
NDPMine: Efficiently Mining Discriminative Numerical Features for Pattern-Based Classification
Abstract. Pattern-based classification has demonstrated its power in recent studies, but because the cost of mining discriminative patterns as features in classification is very ex...
Hyungsul Kim, Sangkyum Kim, Tim Weninger, Jiawei H...
PKDD
2010
Springer
141views Data Mining» more  PKDD 2010»
13 years 2 months ago
On Detecting Clustered Anomalies Using SCiForest
Detecting local clustered anomalies is an intricate problem for many existing anomaly detection methods. Distance-based and density-based methods are inherently restricted by their...
Fei Tony Liu, Kai Ming Ting, Zhi-Hua Zhou
PKDD
2010
Springer
183views Data Mining» more  PKDD 2010»
13 years 2 months ago
Classification and Novel Class Detection of Data Streams in a Dynamic Feature Space
Data stream classification poses many challenges, most of which are not addressed by the state-of-the-art. We present DXMiner, which addresses four major challenges to data stream ...
Mohammad M. Masud, Qing Chen, Jing Gao, Latifur Kh...
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 2 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 2 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...
PKDD
2010
Springer
146views Data Mining» more  PKDD 2010»
13 years 2 months ago
Nonparametric Bayesian Clustering Ensembles
Forming consensus clusters from multiple input clusterings can improve accuracy and robustness. Current clustering ensemble methods require specifying the number of consensus clust...
Pu Wang, Carlotta Domeniconi, Kathryn Blackmond La...
PKDD
2010
Springer
235views Data Mining» more  PKDD 2010»
13 years 2 months ago
Online Structural Graph Clustering Using Frequent Subgraph Mining
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
Madeleine Seeland, Tobias Girschick, Fabian Buchwa...
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
13 years 2 months ago
Efficient and Numerically Stable Sparse Learning
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
Sihong Xie, Wei Fan, Olivier Verscheure, Jiangtao ...
PKDD
2010
Springer
152views Data Mining» more  PKDD 2010»
13 years 3 months ago
Online Knowledge-Based Support Vector Machines
Prior knowledge, in the form of simple advice rules, can greatly speed up convergence in learning algorithms. Online learning methods predict the label of the current point and the...
Gautam Kunapuli, Kristin P. Bennett, Amina Shabbee...
PKDD
2010
Springer
188views Data Mining» more  PKDD 2010»
13 years 3 months ago
Semi-supervised Abstraction-Augmented String Kernel for Multi-level Bio-Relation Extraction
ervised Abstraction-Augmented String Kernel for Multi-Level Bio-Relation Extraction Pavel Kuksa1 , Yanjun Qi2 , Bing Bai2 , Ronan Collobert2 , Jason Weston3 , Vladimir Pavlovic1 , ...
Pavel P. Kuksa, Yanjun Qi, Bing Bai, Ronan Collobe...