Sciweavers

1314 search results - page 30 / 263
» Approximate data mining in very large relational data
Sort
View
EUSFLAT
2009
163views Fuzzy Logic» more  EUSFLAT 2009»
13 years 6 months ago
A Fuzzy Set Approach to Ecological Knowledge Discovery
Besides the problem of searching for effective methods for extracting knowledge from large databases (KDD) there are some additional problems with handling ecological data, namely ...
Arkadiusz Salski
ICDM
2010
IEEE
264views Data Mining» more  ICDM 2010»
13 years 6 months ago
Block-GP: Scalable Gaussian Process Regression for Multimodal Data
Regression problems on massive data sets are ubiquitous in many application domains including the Internet, earth and space sciences, and finances. In many cases, regression algori...
Kamalika Das, Ashok N. Srivastava
ECML
1997
Springer
14 years 20 days ago
Parallel and Distributed Search for Structure in Multivariate Time Series
Abstract. E cient data mining algorithms are crucial fore ective knowledge discovery. We present the Multi-Stream Dependency Detection (msdd) data mining algorithm that performs a ...
Tim Oates, Matthew D. Schmill, Paul R. Cohen
SDM
2004
SIAM
211views Data Mining» more  SDM 2004»
13 years 10 months ago
Using Support Vector Machines for Classifying Large Sets of Multi-Represented Objects
Databases are a key technology for molecular biology which is a very data intensive discipline. Since molecular biological databases are rather heterogeneous, unification and data...
Hans-Peter Kriegel, Peer Kröger, Alexey Pryak...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 9 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos