Sciweavers

1701 search results - page 258 / 341
» Providing k-anonymity in data mining
Sort
View
CIKM
2010
Springer
13 years 8 months ago
Generating advertising keywords from video content
With the proliferation of online distribution methods for videos, content owners require easier and more effective methods for monetization through advertising. Matching advertis...
Michael J. Welch, Junghoo Cho, Walter Chang
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 10 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
KDD
2005
ACM
104views Data Mining» more  KDD 2005»
14 years 10 months ago
A hit-miss model for duplicate detection in the WHO drug safety database
The WHO Collaborating Centre for International Drug Monitoring in Uppsala, Sweden, maintains and analyses the world's largest database of reports on suspected adverse drug re...
Andrew Bate, G. Niklas Norén, Roland Orre
APN
2007
Springer
14 years 4 months ago
ProM 4.0: Comprehensive Support for Real Process Analysis
This tool paper describes the functionality of ProM. Version 4.0 of ProM has been released at the end of 2006 and this version reflects recent achievements in process mining. Proc...
Wil M. P. van der Aalst, Boudewijn F. van Dongen, ...
IJMMS
2007
166views more  IJMMS 2007»
13 years 9 months ago
Visualization of large networks with min-cut plots, A-plots and R-MAT
What does a ‘normal’ computer (or social) network look like? How can we spot ‘abnormal’ sub-networks in the Internet, or web graph? The answer to such questions is vital f...
Deepayan Chakrabarti, Christos Faloutsos, Yiping Z...