Sciweavers

1701 search results - page 218 / 341
» Providing k-anonymity in data mining
Sort
View
101
Voted
KDD
2012
ACM
197views Data Mining» more  KDD 2012»
13 years 16 days ago
On the separability of structural classes of communities
Three major factors govern the intricacies of community extraction in networks: (1) the application domain includes a wide variety of networks of fundamentally different natures,...
Bruno D. Abrahao, Sucheta Soundarajan, John E. Hop...
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
13 years 16 days ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri
SDM
2012
SIAM
216views Data Mining» more  SDM 2012»
13 years 15 days ago
Feature Selection "Tomography" - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable
:  Feature Selection “Tomography” - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable George Forman HP Laboratories HPL-2010-19R1 Feature selection; ...
George Forman
SDM
2012
SIAM
322views Data Mining» more  SDM 2012»
13 years 15 days ago
Adaptive Multi-task Sparse Learning with an Application to fMRI Study
In this paper, we consider the multi-task sparse learning problem under the assumption that the dimensionality diverges with the sample size. The traditional l1/l2 multi-task lass...
Xi Chen, Jingrui He, Rick Lawrence, Jaime G. Carbo...
KDD
2000
ACM
115views Data Mining» more  KDD 2000»
15 years 1 months ago
A framework for specifying explicit bias for revision of approximate information extraction rules
Information extraction is one of the most important techniques used in Text Mining. One of the main problems in building information extraction (IE) systems is that the knowledge ...
Ronen Feldman, Yair Liberzon, Binyamin Rosenfeld, ...