This paper presents the implementation of kDCI, an enhancement of DCI [10], a scalable algorithm for discovering frequent sets in large databases. The main contribution of kDCI re...
Salvatore Orlando, Claudio Lucchese, Paolo Palmeri...
The subfield of itemset mining is essentially a collection of algorithms. Whenever a new type of constraint is discovered, a specialized algorithm is proposed to handle it. All o...
Daniel Kifer, Johannes Gehrke, Cristian Bucila, Wa...
This paper focuses on the application of a new ACO-based automatic programming algorithm to the classification task of data mining. This new model, called GBAP algorithm, is based ...
Given large, multi-million node graphs (e.g., FaceBook, web-crawls, etc.), how do they evolve over time? How are they connected? What are the central nodes and the outliers of the...
U. Kang, Charalampos E. Tsourakakis, Ana Paula App...
An important problem in data mining is detecting changes in large data sets. Although there are a variety of change detection algorithms that have been developed, in practice it c...
Chris Curry, Robert L. Grossman, David Locke, Stev...