Sciweavers

177 search results - page 29 / 36
» Mining fault tolerant frequent patterns using pattern growth...
Sort
View
KDD
2009
ACM
160views Data Mining» more  KDD 2009»
14 years 2 months ago
Clustering event logs using iterative partitioning
The importance of event logs, as a source of information in systems and network management cannot be overemphasized. With the ever increasing size and complexity of today’s even...
Adetokunbo Makanju, A. Nur Zincir-Heywood, Evangel...
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
14 years 1 months ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
14 years 8 months ago
Tell me something I don't know: randomization strategies for iterative data mining
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
Heikki Mannila, Kai Puolamäki, Markus Ojala, ...
SOFTWARE
2002
13 years 7 months ago
Temporal Probabilistic Concepts from Heterogeneous Data Sequences
We consider the problem of characterisation of sequences of heterogeneous symbolic data that arise from a common underlying temporal pattern. The data, which are subject to impreci...
Sally I. McClean, Bryan W. Scotney, Fiona Palmer
CINQ
2004
Springer
189views Database» more  CINQ 2004»
14 years 1 months ago
Employing Inductive Databases in Concrete Applications
In this paper we present the application of the inductive database approach to two practical analytical case studies: Web usage mining in Web logs and financial data. As far as co...
Rosa Meo, Pier Luca Lanzi, Maristella Matera, Dani...