Sciweavers

219 search results - page 40 / 44
» Hoarding Context Information with Context Clusters
Sort
View
DMKD
2004
ACM
139views Data Mining» more  DMKD 2004»
14 years 1 months ago
Iterative record linkage for cleaning and integration
Record linkage, the problem of determining when two records refer to the same entity, has applications for both data cleaning (deduplication) and for integrating data from multipl...
Indrajit Bhattacharya, Lise Getoor
TAL
2004
Springer
14 years 29 days ago
One Size Fits All? A Simple Technique to Perform Several NLP Tasks
Word fragments or n-grams have been widely used to perform different Natural Language Processing tasks such as information retrieval [1] [2], document categorization [3], automatic...
Daniel Gayo-Avello, Darío Álvarez Gu...
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
14 years 8 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
JIB
2007
124views more  JIB 2007»
13 years 7 months ago
Analysis of integrated biomolecular networks using a generic network analysis suite
The informative value of biomolecular networks has shifted from being solely information resources for possible cellular partners (whether these embody proteins, (ribo)nucleic aci...
Matthias Oesterheld, Hans-Werner Mewes, Volker St&...
STOC
2007
ACM
112views Algorithms» more  STOC 2007»
14 years 8 months ago
Smooth sensitivity and sampling in private data analysis
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
Kobbi Nissim, Sofya Raskhodnikova, Adam Smith