Sciweavers

947 search results - page 121 / 190
» Evaluation of Sampling for Data Mining of Association Rules
Sort
View
146
Voted
WWW
2009
ACM
16 years 1 months ago
Collaborative filtering for orkut communities: discovery of user latent behavior
Users of social networking services can connect with each other by forming communities for online interaction. Yet as the number of communities hosted by such websites grows over ...
WenYen Chen, Jon-Chyuan Chu, Junyi Luan, Hongjie B...
KDD
2003
ACM
161views Data Mining» more  KDD 2003»
16 years 1 months ago
Eliminating noisy information in Web pages for data mining
A commercial Web page typically contains many information blocks. Apart from the main content blocks, it usually has such blocks as navigation panels, copyright and privacy notice...
Lan Yi, Bing Liu, Xiaoli Li
ADC
2003
Springer
182views Database» more  ADC 2003»
15 years 5 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
SDM
2009
SIAM
123views Data Mining» more  SDM 2009»
15 years 9 months ago
Measuring Discrimination in Socially-Sensitive Decision Records.
Discrimination in social sense (e.g., against minorities and disadvantaged groups) is the subject of many laws worldwide, and it has been extensively studied in the social and eco...
Dino Pedreschi, Franco Turini, Salvatore Ruggieri
ICDM
2002
IEEE
145views Data Mining» more  ICDM 2002»
15 years 5 months ago
Mining Top-K Frequent Closed Patterns without Minimum Support
In this paper, we propose a new mining task: mining top-k frequent closed patterns of length no less than min , where k is the desired number of frequent closed patterns to be min...
Jiawei Han, Jianyong Wang, Ying Lu, Petre Tzvetkov