Sciweavers

1701 search results - page 247 / 341
» Providing k-anonymity in data mining
Sort
View
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
14 years 4 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
ICDM
2005
IEEE
168views Data Mining» more  ICDM 2005»
14 years 3 months ago
A Scalable Collaborative Filtering Framework Based on Co-Clustering
Collaborative filtering-based recommender systems, which automatically predict preferred products of a user using known preferences of other users, have become extremely popular ...
Thomas George, Srujana Merugu
ICDM
2005
IEEE
215views Data Mining» more  ICDM 2005»
14 years 3 months ago
CLUGO: A Clustering Algorithm for Automated Functional Annotations Based on Gene Ontology
We address the issue of providing highly informative and comprehensive annotations using information revealed by the structured vocabularies of Gene Ontology (GO). For a target, a...
In-Yee Lee, Jan-Ming Ho, Ming-Syan Chen
ICDM
2005
IEEE
116views Data Mining» more  ICDM 2005»
14 years 3 months ago
Learning Functional Dependency Networks Based on Genetic Programming
Bayesian Network (BN) is a powerful network model, which represents a set of variables in the domain and provides the probabilistic relationships among them. But BN can handle dis...
Wing-Ho Shum, Kwong-Sak Leung, Man Leung Wong
KDD
2005
ACM
180views Data Mining» more  KDD 2005»
14 years 3 months ago
Information retrieval based on collaborative filtering with latent interest semantic map
In this paper, we propose an information retrieval model called Latent Interest Semantic Map (LISM), which features retrieval composed of both Collaborative Filtering(CF) and Prob...
Noriaki Kawamae, Katsumi Takahashi