Sciweavers

5595 search results - page 1016 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
KDD
2003
ACM
109views Data Mining» more  KDD 2003»
16 years 5 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
SIGMOD
2009
ACM
177views Database» more  SIGMOD 2009»
16 years 5 months ago
Exploiting context analysis for combining multiple entity resolution systems
Entity Resolution (ER) is an important real world problem that has attracted significant research interest over the past few years. It deals with determining which object descript...
Zhaoqi Chen, Dmitri V. Kalashnikov, Sharad Mehrotr...
EDBT
2002
ACM
159views Database» more  EDBT 2002»
16 years 5 months ago
Cut-and-Pick Transactions for Proxy Log Mining
Web logs collected by proxy servers, referred to as proxy logs or proxy traces, contain information about Web document accesses by many users against many Web sites. This "man...
Wenwu Lou, Guimei Liu, Hongjun Lu, Qiang Yang
BIBE
2008
IEEE
160views Bioinformatics» more  BIBE 2008»
15 years 11 months ago
Parallel integration of heterogeneous genome-wide data sources
— Heterogeneous genome-wide data sources capture information on various aspects of complex biological systems. For instance, transcriptome, interactome and phenome-level informat...
Derek Greene, Kenneth Bryan, Padraig Cunningham
CIA
2007
Springer
15 years 11 months ago
Learning Initial Trust Among Interacting Agents
Trust learning is a crucial aspect of information exchange, negotiation, and any other kind of social interaction among autonomous agents in open systems. But most current probabil...
Achim Rettinger, Matthias Nickles, Volker Tresp
« Prev « First page 1016 / 1119 Last » Next »