Sciweavers

1701 search results - page 120 / 341
» Providing k-anonymity in data mining
Sort
View
RCIS
2010
14 years 8 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
15 years 10 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
GECCO
2006
Springer
128views Optimization» more  GECCO 2006»
15 years 1 months ago
FTXI: fault tolerance XCS in integer
In the realm of data mining, several key issues exists in the traditional classification algorithms, such as low readability, large rule number, and low accuracy with information ...
Hong-Wei Chen, Ying-Ping Chen
KDD
2005
ACM
218views Data Mining» more  KDD 2005»
15 years 10 months ago
A maximum entropy web recommendation system: combining collaborative and content features
Web users display their preferences implicitly by navigating through a sequence of pages or by providing numeric ratings to some items. Web usage mining techniques are used to ext...
Xin Jin, Yanzan Zhou, Bamshad Mobasher
BMCBI
2007
134views more  BMCBI 2007»
14 years 10 months ago
PLAN: a web platform for automating high-throughput BLAST searches and for managing and mining results
Background: BLAST searches are widely used for sequence alignment. The search results are commonly adopted for various functional and comparative genomics tasks such as annotating...
Ji He, Xinbin Dai, Xuechun Zhao