1701 search results - page 130 / 341 » Providing k-anonymity in data mining |
ICDM
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper describes an approach for incorporating externally specified aggregate ratings information into certain types of collaborative filtering (CF) methods. For a statistic...
ICUIMC
2009
ACM
15 years 4 months ago
2009
ACM
Although documents have hundreds of thousands of unique words, only a small number of words are significantly useful for intelligent services. For this reason, feature extraction ...
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper offers a local distributed algorithm for expectation maximization in large peer-to-peer environments. The algorithm can be used for a variety of well-known data mining...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
Motivation: In the field of bioinformatics there is an emerging need to integrate all knowledge discovery steps into a standardized modular framework. Indeed, component-based deve...
SSD
2005
Springer
15 years 3 months ago
2005
Springer
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...