Sciweavers

4560 search results - page 405 / 912
» Finding Data in the Neighborhood
Sort
View
ICML
2005
IEEE
16 years 7 months ago
Semi-supervised graph clustering: a kernel approach
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
Brian Kulis, Sugato Basu, Inderjit S. Dhillon, Ray...
WWW
2005
ACM
16 years 7 months ago
Duplicate detection in click streams
We consider the problem of finding duplicates in data streams. Duplicate detection in data streams is utilized in various applications including fraud detection. We develop a solu...
Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
WWW
2001
ACM
16 years 7 months ago
Map adaptation for users of mobile systems
Display characteristics, network Quality of Service, and the user's current task all exhibit a wide range of variation when users interact with mobile and ubiquitous devices....
Dan Chalmers, Morris Sloman, Naranker Dulay
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
16 years 7 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
209
Voted
KDD
2006
ACM
200views Data Mining» more  KDD 2006»
16 years 7 months ago
A Random-Walk Based Scoring Algorithm Applied to Recommender Engines
Recommender systems are an emerging technology that helps consumers find interesting products and useful resources. A recommender system makes personalized product suggestions by e...
Augusto Pucci, Marco Gori, Marco Maggini