Sciweavers

131 search results - page 10 / 27
» Efficient Mining of Indirect Associations Using HI-Mine
Sort
View
KDD
2009
ACM
229views Data Mining» more  KDD 2009»
14 years 8 months ago
An association analysis approach to biclustering
The discovery of biclusters, which denote groups of items that show coherent values across a subset of all the transactions in a data set, is an important type of analysis perform...
Gaurav Pandey, Gowtham Atluri, Michael Steinbach, ...
CEC
2008
IEEE
14 years 1 months ago
Distributed multi-relational data mining based on genetic algorithm
—An efficient algorithm for mining important association rule from multi-relational database using distributed mining ideas. Most existing data mining approaches look for rules i...
Wenxiang Dou, Jinglu Hu, Kotaro Hirasawa, Gengfeng...
WWW
2007
ACM
14 years 8 months ago
Mirror site maintenance based on evolution associations of web directories
Mirroring Web sites is a well-known technique commonly used in the Web community. A mirror site should be updated frequently to ensure that it reflects the content of the original...
Ling Chen 0002, Sourav S. Bhowmick, Wolfgang Nejdl
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 7 months ago
Providing k-anonymity in data mining
In this paper we present extended definitions of k-anonymity and use them to prove that a given data mining model does not violate the k-anonymity of the individuals represented in...
Arik Friedman, Ran Wolff, Assaf Schuster
DMIN
2006
126views Data Mining» more  DMIN 2006»
13 years 8 months ago
An Algorithm for the Discovery of Arbitrary Length Ordinal Association Rules
Association rule mining techniques are used to search attribute-value pairs that occur frequently together in a data set. Ordinal association rules are a particular type of associa...
Alina Campan, Gabriela Serban, Traian Marius Truta...