Sciweavers

1314 search results - page 11 / 263
» Approximate data mining in very large relational data
Sort
View
IAAI
2003
13 years 8 months ago
LAW: A Workbench for Approximate Pattern Matching in Relational Data
Pattern matching for intelligence organizations is a challenging problem. The data sets are large and noisy, and there is a flexible and constantly changing notion of what consti...
Michael Wolverton, Pauline Berry, Ian W. Harrison,...
ASUNAM
2010
IEEE
13 years 9 months ago
Semi-Supervised Classification of Network Data Using Very Few Labels
The goal of semi-supervised learning (SSL) methods is to reduce the amount of labeled training data required by learning from both labeled and unlabeled instances. Macskassy and Pr...
Frank Lin, William W. Cohen
VLDB
2005
ACM
196views Database» more  VLDB 2005»
14 years 26 days ago
Summarizing and Mining Inverse Distributions on Data Streams via Dynamic Inverse Sampling
Emerging data stream management systems approach the challenge of massive data distributions which arrive at high speeds while there is only small storage by summarizing and minin...
Graham Cormode, S. Muthukrishnan, Irina Rozenbaum
KDD
2002
ACM
136views Data Mining» more  KDD 2002»
14 years 7 months ago
Relational Markov models and their application to adaptive web navigation
Relational Markov models (RMMs) are a generalization of Markov models where states can be of different types, with each type described by a different set of variables. The domain ...
Corin R. Anderson, Pedro Domingos, Daniel S. Weld
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 7 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...