Sciweavers

319 search results - page 13 / 64
» Algorithms for Mining Distance-Based Outliers in Large Datas...
Sort
View
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
14 years 11 months ago
Finding Frequent Patterns in a Large Sparse Graph
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
Michihiro Kuramochi, George Karypis
CVPR
2010
IEEE
15 years 2 months ago
On the design of robust classifiers for computer vision
The design of robust classifiers, which can contend with the noisy and outlier ridden datasets typical of computer vision, is studied. It is argued that such robustness requires l...
Hamed Masnadi-Shirazi, Nuno Vasconcelos, Vijay Mah...
SDM
2008
SIAM
117views Data Mining» more  SDM 2008»
14 years 11 months ago
A Feature Selection Algorithm Capable of Handling Extremely Large Data Dimensionality
With the advent of high throughput technologies, feature selection has become increasingly important in a wide range of scientific disciplines. We propose a new feature selection ...
Yijun Sun, Sinisa Todorovic, Steve Goodison
PAKDD
2010
ACM
203views Data Mining» more  PAKDD 2010»
15 years 2 months ago
Finding Itemset-Sharing Patterns in a Large Itemset-Associated Graph
Both itemset mining and graph mining have been studied independently. Here, we introduce a novel data structure, which is an unweighted graph whose vertices contain itemsets. From ...
Mutsumi Fukuzaki, Mio Seki, Hisashi Kashima, Jun S...
FIMI
2003
170views Data Mining» more  FIMI 2003»
14 years 11 months ago
kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets
This paper presents the implementation of kDCI, an enhancement of DCI [10], a scalable algorithm for discovering frequent sets in large databases. The main contribution of kDCI re...
Salvatore Orlando, Claudio Lucchese, Paolo Palmeri...