KDD
2010
ACM
13 years 10 months ago
2010
ACM
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
KDD
2010
ACM
13 years 10 months ago
2010
ACM
Influence maximization, defined by Kempe, Kleinberg, and Tardos (2003), is the problem of finding a small set of seed nodes in a social network that maximizes the spread of influe...
KDD
2010
ACM
13 years 10 months ago
2010
ACM
Information diffusion and virus propagation are fundamental processes talking place in networks. While it is often possible to directly observe when nodes become infected, observi...
KDD
2010
ACM
13 years 10 months ago
2010
ACM
KDD
2010
ACM
13 years 10 months ago
2010
ACM
KDD
2010
ACM
13 years 10 months ago
2010
ACM
Recent advances in linear classification have shown that for applications such as document classification, the training can be extremely efficient. However, most of the existing t...
DAWAK
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Data mining is an iterative process. Users issue series of similar data mining queries, in each consecutive run slightly modifying either the definition of the mined dat...
DIS
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. One important challenge in data mining is to extract interesting knowledge and useful information for expert users. Since data mining algorithms extracts a huge quantity ...
ADMA
2005
Springer
13 years 10 months ago
2005
Springer
Web transaction data between web visitors and web functionalities usually convey users’ task-oriented behavior patterns. Clustering web transactions, thus, may capture such infor...
ADMA
2005
Springer
13 years 10 months ago
2005
Springer
A precondition of existing ensemble-based distributed data mining techniques is the assumption that contributing data are identically and independently distributed. However, this a...