Sciweavers

131 search results - page 13 / 27
» Efficient Mining of Indirect Associations Using HI-Mine
Sort
View
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
14 years 7 months ago
Interestingness of frequent itemsets using Bayesian networks as background knowledge
The paper presents a method for pruning frequent itemsets based on background knowledge represented by a Bayesian network. The interestingness of an itemset is defined as the abso...
Szymon Jaroszewicz, Dan A. Simovici
IPPS
1998
IEEE
13 years 11 months ago
High Performance Data Mining Using Data Cubes on Parallel Computers
On-Line Analytical Processing techniques are used for data analysis and decision support systems. The multidimensionality of the underlying data is well represented by multidimens...
Sanjay Goil, Alok N. Choudhary
CAEPIA
2003
Springer
14 years 18 days ago
Text Mining Using the Hierarchical Syntactical Structure of Documents
One of the most important tasks for determining association rules consists of calculating all the maximal frequent itemsets. Specifically, some methods to obtain these itemsets hav...
Roxana Dánger, José Ruiz-Shulcloper,...
IJSI
2008
122views more  IJSI 2008»
13 years 7 months ago
Mining Gene Expression Data using Domain Knowledge
Biology is now an information-intensive science and various research areas, like molecular biology, evolutionary biology or environmental biology, heavily depend on the availabilit...
Nicolas Pasquier, Claude Pasquier, Laurent Brisson...
KDD
2004
ACM
160views Data Mining» more  KDD 2004»
14 years 7 months ago
k-TTP: a new privacy model for large-scale distributed environments
Secure multiparty computation allows parties to jointly compute a function of their private inputs without revealing anything but the output. Theoretical results [2] provide a gen...
Bobi Gilburd, Assaf Schuster, Ran Wolff