Sciweavers

5107 search results - page 90 / 1022
» Data Mining and Information Retrieval
Sort
View
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
16 years 6 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
KDD
2003
ACM
122views Data Mining» more  KDD 2003»
16 years 6 months ago
Natural communities in large linked networks
We are interested in finding natural communities in largescale linked networks. Our ultimate goal is to track changes over time in such communities. For such temporal tracking, we...
John E. Hopcroft, Omar Khan, Brian Kulis, Bart Sel...
CIKM
2008
Springer
15 years 8 months ago
How does clickthrough data reflect retrieval quality?
Filip Radlinski, Madhu Kurup, Thorsten Joachims
KDD
2006
ACM
121views Data Mining» more  KDD 2006»
16 years 6 months ago
Query-time entity resolution
The goal of entity resolution is to reconcile database references corresponding to the same real-world entities. Given the abundance of publicly available databases where entities...
Indrajit Bhattacharya, Lise Getoor, Louis Licamele
SIGIR
2012
ACM
13 years 8 months ago
Building reputation and trust using federated search and opinion mining
The term online reputation addresses trust relationships amongst agents in dynamic open systems. These can appear as ratings, recommendations, referrals and feedback. Several repu...
Somayeh Khatiban