Sciweavers

310 search results - page 33 / 62
» Communication Efficient Distributed Mining of Association Ru...
Sort
View
IJNSEC
2010
112views more  IJNSEC 2010»
14 years 7 months ago
Detecting Connection-Chains: A Data Mining Approach
A connection-chain refers to a mechanism in which someone recursively logs into a host, then from there logs into another host, and so on. Connection-chains represent an important...
Ahmad Almulhem, Issa Traoré
CAEPIA
2003
Springer
15 years 5 months 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,...
KDD
1995
ACM
130views Data Mining» more  KDD 1995»
15 years 4 months ago
Compression-Based Evaluation of Partial Determinations
Our work tackles the problem of finding partial determinations in databases and proposes a compressionbased measure to evaluate them. Partial determinations can be viewed as gener...
Bernhard Pfahringer, Stefan Kramer
104
Voted
IPPS
1999
IEEE
15 years 4 months ago
Optimization Rules for Programming with Collective Operations
We study how several collective operations like broadcast, reduction, scan, etc. can be composed efficiently in complex parallel programs. Our specific contributions are: (1) a fo...
Sergei Gorlatch, Christoph Wedler, Christian Lenga...
95
Voted
CINQ
2004
Springer
125views Database» more  CINQ 2004»
15 years 5 months ago
The Hows, Whys, and Whens of Constraints in Itemset and Rule Discovery
Many researchers in our community (this author included) regularly emphasize the role constraints play in improving performance of data-mining algorithms. This emphasis has led to ...
Roberto J. Bayardo