Sciweavers

2006 search results - page 379 / 402
» Heuristic Security-Testing Methods
Sort
View
WWW
2009
ACM
14 years 9 months ago
Extracting article text from the web with maximum subsequence segmentation
Much of the information on the Web is found in articles from online news outlets, magazines, encyclopedias, review collections, and other sources. However, extracting this content...
Jeff Pasternack, Dan Roth
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
14 years 9 months ago
Correlation search in graph databases
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation ...
Yiping Ke, James Cheng, Wilfred Ng
KDD
2006
ACM
128views Data Mining» more  KDD 2006»
14 years 9 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
2005
ACM
91views Data Mining» more  KDD 2005»
14 years 9 months ago
On mining cross-graph quasi-cliques
Joint mining of multiple data sets can often discover interesting, novel, and reliable patterns which cannot be obtained solely from any single source. For example, in cross-marke...
Jian Pei, Daxin Jiang, Aidong Zhang
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 9 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han