Sciweavers

1599 search results - page 151 / 320
» Theoretical Frameworks for Data Mining
Sort
View
ADMA
2006
Springer
121views Data Mining» more  ADMA 2006»
14 years 3 months 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
PAKDD
2004
ACM
183views Data Mining» more  PAKDD 2004»
14 years 3 months ago
Constraint-Based Graph Clustering through Node Sequencing and Partitioning
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...
Yu Qian, Kang Zhang, Wei Lai
PAKDD
2009
ACM
157views Data Mining» more  PAKDD 2009»
14 years 2 months ago
Analysis of Variational Bayesian Matrix Factorization
Abstract. Recently, the variational Bayesian approximation was applied to probabilistic matrix factorization and shown to perform very well in experiments. However, its good perfor...
Shinichi Nakajima, Masashi Sugiyama
AUSDM
2008
Springer
246views Data Mining» more  AUSDM 2008»
13 years 11 months ago
A New Evaluation Measure for Imbalanced Datasets
The area of imbalanced datasets is still relatively new, and it is known that the use of overall accuracy is not an appropriate evaluation measure for imbalanced datasets, because...
Cheng G. Weng, Josiah Poon
SDM
2007
SIAM
81views Data Mining» more  SDM 2007»
13 years 11 months ago
A PAC Bound for Approximate Support Vector Machines
We study a class of algorithms that speed up the training process of support vector machines (SVMs) by returning an approximate SVM. We focus on algorithms that reduce the size of...
Dongwei Cao, Daniel Boley