Sciweavers

156 search results - page 10 / 32
» The UCI KDD Archive of Large Data Sets for Data Mining Resea...
Sort
View
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
14 years 8 months ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li
APNOMS
2008
Springer
13 years 9 months ago
Application of Data Mining to Network Intrusion Detection: Classifier Selection Model
As network attacks have increased in number and severity over the past few years, intrusion detection system (IDS) is increasingly becoming a critical component to secure the netwo...
Huy Anh Nguyen, Deokjai Choi
KDD
2008
ACM
116views Data Mining» more  KDD 2008»
14 years 8 months ago
Volatile correlation computation: a checkpoint view
Recent years have witnessed increased interest in computing strongly correlated pairs in very large databases. Most previous studies have been focused on static data sets. However...
Wenjun Zhou, Hui Xiong
KDD
2008
ACM
167views Data Mining» more  KDD 2008»
14 years 8 months ago
A sequential dual method for large scale multi-class linear svms
Efficient training of direct multi-class formulations of linear Support Vector Machines is very useful in applications such as text classification with a huge number examples as w...
S. Sathiya Keerthi, S. Sundararajan, Kai-Wei Chang...
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 8 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang