Sciweavers

2705 search results - page 396 / 541
» Privacy in Data Mining Using Formal Methods
Sort
View
WSDM
2010
ACM
213views Data Mining» more  WSDM 2010»
16 years 3 months ago
Corroborating Information from Disagreeing Views
We consider a set of views stating possibly conflicting facts. Negative facts in the views may come, e.g., from functional dependencies in the underlying database schema. We want ...
Alban Galland, Serge Abiteboul, Amélie Mari...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 6 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
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
16 years 6 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
CAV
2007
Springer
166views Hardware» more  CAV 2007»
16 years 16 days ago
Fast and Accurate Static Data-Race Detection for Concurrent Programs
We present new techniques for fast, accurate and scalable static data race detection in concurrent programs. Focusing our analysis on Linux device drivers allowed us to identify th...
Vineet Kahlon, Yu Yang, Sriram Sankaranarayanan, A...
SIGMOD
2011
ACM
269views Database» more  SIGMOD 2011»
14 years 9 months ago
Advancing data clustering via projective clustering ensembles
Projective Clustering Ensembles (PCE) are a very recent advance in data clustering research which combines the two powerful tools of clustering ensembles and projective clustering...
Francesco Gullo, Carlotta Domeniconi, Andrea Tagar...