Sciweavers

PAKDD
2010
ACM
173views Data Mining» more  PAKDD 2010»
13 years 2 months ago
Distributed Knowledge Discovery with Non Linear Dimensionality Reduction
Data mining tasks results are usually improved by reducing the dimensionality of data. This improvement however is achieved harder in the case that data lay on a non linear manifol...
Panagis Magdalinos, Michalis Vazirgiannis, Dialect...
PAKDD
2010
ACM
171views Data Mining» more  PAKDD 2010»
13 years 3 months ago
Summarizing Multidimensional Data Streams: A Hierarchy-Graph-Based Approach
With the rapid development of information technology, many applications have to deal with potentially infinite data streams. In such a dynamic context, storing the whole data stre...
Yoann Pitarch, Anne Laurent, Pascal Poncelet
PAKDD
2010
ACM
193views Data Mining» more  PAKDD 2010»
13 years 3 months ago
As Time Goes by: Discovering Eras in Evolving Social Networks
Abstract. Within the large body of research in complex network analysis, an important topic is the temporal evolution of networks. Existing approaches aim at analyzing the evolutio...
Michele Berlingerio, Michele Coscia, Fosca Giannot...
PAKDD
2010
ACM
150views Data Mining» more  PAKDD 2010»
13 years 3 months ago
Mining Trajectory Corridors Using Fréchet Distance and Meshing Grids
Haohan Zhu, Jun Luo, Hang Yin, Xiaotao Zhou, Joshu...
PAKDD
2010
ACM
165views Data Mining» more  PAKDD 2010»
13 years 7 months ago
Classification and Novel Class Detection in Data Streams with Active Mining
We present ActMiner, which addresses four major challenges to data stream classification, namely, infinite length, concept-drift, conceptevolution, and limited labeled data. Most o...
Mohammad M. Masud, Jing Gao, Latifur Khan, Jiawei ...
PAKDD
2010
ACM
134views Data Mining» more  PAKDD 2010»
13 years 7 months ago
Generating Diverse Ensembles to Counter the Problem of Class Imbalance
Abstract. One of the more challenging problems faced by the data mining community is that of imbalanced datasets. In imbalanced datasets one class (sometimes severely) outnumbers t...
T. Ryan Hoens, Nitesh V. Chawla
PAKDD
2010
ACM
169views Data Mining» more  PAKDD 2010»
13 years 7 months ago
Correspondence Clustering: An Approach to Cluster Multiple Related Spatial Datasets
Domain experts are frequently interested to analyze multiple related spatial datasets. This capability is important for change analysis and contrast mining. In this paper, a novel ...
Vadeerat Rinsurongkawong, Christoph F. Eick
PAKDD
2010
ACM
208views Data Mining» more  PAKDD 2010»
13 years 7 months ago
Efficient Pattern Mining of Uncertain Data with Sampling
Mining frequent itemsets from transactional datasets is a well known problem with good algorithmic solutions. In the case of uncertain data, however, several new techniques have be...
Toon Calders, Calin Garboni, Bart Goethals
PAKDD
2010
ACM
215views Data Mining» more  PAKDD 2010»
13 years 7 months ago
Mining Closed Episodes from Event Sequences Efficiently
Recent studies have proposed different methods for mining frequent episodes. In this work, we study the problem of mining closed episodes based on minimal occurrences. We study the...
Wenzhi Zhou, Hongyan Liu, Hong Cheng
PAKDD
2010
ACM
134views Data Mining» more  PAKDD 2010»
13 years 7 months ago
A Robust Seedless Algorithm for Correlation Clustering
Abstract. Finding correlation clusters in the arbitrary subspaces of highdimensional data is an important and a challenging research problem. The current state-of-the-art correlati...
Mohammad S. Aziz, Chandan K. Reddy