Sciweavers

5580 search results - page 1073 / 1116
» Randomized priority algorithms
Sort
View
KDD
2006
ACM
128views Data Mining» more  KDD 2006»
14 years 8 months ago
On privacy preservation against adversarial data mining
Privacy preserving data processing has become an important topic recently because of advances in hardware technology which have lead to widespread proliferation of demographic and...
Charu C. Aggarwal, Jian Pei, Bo Zhang 0002
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 8 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
2005
ACM
182views Data Mining» more  KDD 2005»
14 years 8 months ago
Making holistic schema matching robust: an ensemble approach
The Web has been rapidly "deepened" by myriad searchable databases online, where data are hidden behind query interfaces. As an essential task toward integrating these m...
Bin He, Kevin Chen-Chuan Chang
KDD
2005
ACM
153views Data Mining» more  KDD 2005»
14 years 8 months ago
Improving discriminative sequential learning with rare--but--important associations
Discriminative sequential learning models like Conditional Random Fields (CRFs) have achieved significant success in several areas such as natural language processing, information...
Xuan Hieu Phan, Minh Le Nguyen, Tu Bao Ho, Susumu ...
KDD
2003
ACM
109views Data Mining» more  KDD 2003»
14 years 8 months ago
Experimental design for solicitation campaigns
Data mining techniques are routinely used by fundraisers to select those prospects from a large pool of candidates who are most likely to make a financial contribution. These tech...
Uwe F. Mayer, Armand Sarkissian
« Prev « First page 1073 / 1116 Last » Next »