Sciweavers

4085 search results - page 202 / 817
» Benchmarking Data Mining Algorithms
Sort
View
ADMA
2006
Springer
121views Data Mining» more  ADMA 2006»
16 years 15 days ago
A New Polynomial Time Algorithm for Bayesian Network Structure Learning
We propose a new algorithm called SCD for learning the structure of a Bayesian network. The algorithm is a kind of constraintbased algorithm. By taking advantage of variable orderi...
Sanghack Lee, Jihoon Yang, Sungyong Park
PLDI
1998
ACM
15 years 10 months ago
A Study of Dead Data Members in C++ Applications
Object-oriented applications may contain data members that can be removed from the application without a ecting program behavior. Such \dead" data members may occur due to un...
Peter F. Sweeney, Frank Tip
ICDM
2007
IEEE
138views Data Mining» more  ICDM 2007»
16 years 25 days ago
Bandit-Based Algorithms for Budgeted Learning
We explore the problem of budgeted machine learning, in which the learning algorithm has free access to the training examples’ labels but has to pay for each attribute that is s...
Kun Deng, Chris Bourke, Stephen D. Scott, Julie Su...
GECCO
2008
Springer
250views Optimization» more  GECCO 2008»
15 years 7 months ago
Community detection in social networks with genetic algorithms
A new genetic algorithm to detect communities in social networks is presented. The algorithm uses a fitness function able to identify groups of nodes in the network having dense ...
Clara Pizzuti
IDA
2007
Springer
15 years 6 months ago
Approximate mining of frequent patterns on streams
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
Claudio Silvestri, Salvatore Orlando