Sciweavers

1215 search results - page 129 / 243
» Numbers in Multi-relational Data Mining
Sort
View
PKDD
2000
Springer
144views Data Mining» more  PKDD 2000»
15 years 8 months ago
Fast Hierarchical Clustering Based on Compressed Data and OPTICS
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Markus M. Breunig, Hans-Peter Kriegel, Jörg S...
ICDE
2008
IEEE
137views Database» more  ICDE 2008»
16 years 6 months ago
Stop Chasing Trends: Discovering High Order Models in Evolving Data
Abstract-- Many applications are driven by evolving data -patterns in web traffic, program execution traces, network event logs, etc., are often non-stationary. Building prediction...
Shixi Chen, Haixun Wang, Shuigeng Zhou, Philip S. ...
KDD
2007
ACM
186views Data Mining» more  KDD 2007»
16 years 5 months ago
An Ad Omnia Approach to Defining and Achieving Private Data Analysis
We briefly survey several privacy compromises in published datasets, some historical and some on paper. An inspection of these suggests that the problem lies with the nature of the...
Cynthia Dwork
KDD
2002
ACM
126views Data Mining» more  KDD 2002»
16 years 5 months ago
Integrating feature and instance selection for text classification
Instance selection and feature selection are two orthogonal methods for reducing the amount and complexity of data. Feature selection aims at the reduction of redundant features i...
Dimitris Fragoudis, Dimitris Meretakis, Spiros Lik...
ICDM
2008
IEEE
172views Data Mining» more  ICDM 2008»
15 years 11 months ago
Active Learning of Equivalence Relations by Minimizing the Expected Loss Using Constraint Inference
Selecting promising queries is the key to effective active learning. In this paper, we investigate selection techniques for the task of learning an equivalence relation where the ...
Steffen Rendle, Lars Schmidt-Thieme