Sciweavers

1314 search results - page 62 / 263
» Approximate data mining in very large relational data
Sort
View
PKDD
2009
Springer
148views Data Mining» more  PKDD 2009»
15 years 8 months ago
Feature Selection by Transfer Learning with Linear Regularized Models
Abstract. This paper presents a novel feature selection method for classification of high dimensional data, such as those produced by microarrays. It includes a partial supervisio...
Thibault Helleputte, Pierre Dupont
184
Voted
JPDC
2007
138views more  JPDC 2007»
15 years 1 months ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki
93
Voted
PAKDD
2005
ACM
146views Data Mining» more  PAKDD 2005»
15 years 7 months ago
An Incremental Data Stream Clustering Algorithm Based on Dense Units Detection
Abstract. The data stream model of computation is often used for analyzing huge volumes of continuously arriving data. In this paper, we present a novel algorithm called DUCstream ...
Jing Gao, Jianzhong Li, Zhaogong Zhang, Pang-Ning ...
SSD
1995
Springer
146views Database» more  SSD 1995»
15 years 5 months ago
Discovery of Spatial Association Rules in Geographic Information Databases
Spatial data mining, i.e., discovery of interesting, implicit knowledge in spatial databases, is an important task for understanding and use of spatial data- and knowledge-bases. I...
Krzysztof Koperski, Jiawei Han
DATAMINE
2006
142views more  DATAMINE 2006»
15 years 1 months ago
Sequential Pattern Mining in Multi-Databases via Multiple Alignment
To efficiently find global patterns from a multi-database, information in each local database must first be mined and summarized at the local level. Then only the summarized infor...
Hye-Chung Kum, Joong Hyuk Chang, Wei Wang 0010