Sciweavers

2370 search results - page 65 / 474
» A Structured Set of Higher-Order Problems
Sort
View
ADC
2003
Springer
182views Database» more  ADC 2003»
14 years 2 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
TCS
2008
13 years 8 months ago
Absolute versus probabilistic classification in a logical setting
Suppose we are given a set W of logical structures, or possible worlds, a set of logical formulas called possible data and a logical formula . We then consider the classification p...
Sanjay Jain, Eric Martin, Frank Stephan
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
14 years 2 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
14 years 6 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
CISIS
2008
IEEE
13 years 11 months ago
Simplified Bluetooth Scatternet Formation Using Maximal Independent Sets
Bluetooth standard allows the creation of piconets, with one node serving as its master and up to seven nodes serving as slaves. A Bluetooth ad hoc network can also be formed by in...
Nejib Zaguia, Ivan Stojmenovic, Yassine Daadaa