7623 search results - page 397 / 1525 » Algorithmic Features of Eclat |
157
click to vote
MLDM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We describe an algorithm called TargetCluster for the discretization of continuous targets in subgroup discovery. The algorithm identifies patterns in the target data an...
240
click to vote
CCGRID
2010
IEEE
15 years 4 months ago
2010
IEEE
Data-intensive parallel applications on clouds need to deploy large data sets from the cloud's storage facility to all compute nodes as fast as possible. Many multicast algori...
228
click to vote
WWW
2011
ACM
15 years 1 months ago
2011
ACM
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
190
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
A number of updates for density matrices have been developed recently that are motivated by relative entropy minimization problems. The updates involve a softmin calculation based...
199
click to vote
ICAC
2006
IEEE
16 years 26 days ago
2006
IEEE
— In this short paper, we give a brief overview a simulation environment, SimEAC, which was designed for testing algorithms with strong autonomic features. SimEAC enables a user ...