Sciweavers

164 search results - page 15 / 33
» Clustering Rules Using Empirical Similarity of Support Sets
Sort
View
AI
2006
Springer
14 years 12 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth
TJS
2010
182views more  TJS 2010»
14 years 10 months ago
A novel unsupervised classification approach for network anomaly detection by k-Means clustering and ID3 decision tree learning
This paper presents a novel host-based combinatorial method based on k-Means clustering and ID3 decision tree learning algorithms for unsupervised classification of anomalous and ...
Yasser Yasami, Saadat Pour Mozaffari
ICPR
2008
IEEE
15 years 6 months ago
Effective scene matching with local feature representatives
Scene matching measures the similarity of scenes in photos and is of central importance in applications where we have to properly organize large amount of digital photos by scene ...
Shugao Ma, Weiqiang Wang, Qingming Huang, Shuqiang...
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
16 years 5 days ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
SP
2008
IEEE
140views Security Privacy» more  SP 2008»
14 years 11 months ago
Knowledge support and automation for performance analysis with PerfExplorer 2.0
The integration of scalable performance analysis in parallel development tools is difficult. The potential size of data sets and the need to compare results from multiple experime...
Kevin A. Huck, Allen D. Malony, Sameer Shende, Ala...