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...
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...
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...
Manuel Gomez-Rodriguez, Jure Leskovec, Andreas Kra...
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...
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...
Mikolaj Morzy, Tadeusz Morzy, Marek Wojciechowski,...
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 ...
Web transaction data between web visitors and web functionalities usually convey users’ task-oriented behavior patterns. Clustering web transactions, thus, may capture such infor...
A precondition of existing ensemble-based distributed data mining techniques is the assumption that contributing data are identically and independently distributed. However, this a...
Yan Xing, Michael G. Madden, Jim Duggan, Gerard Ly...