Sciweavers

2497 search results - page 180 / 500
» A Partial-Repeatability Approach to Data Mining
Sort
View
KDD
2009
ACM
179views Data Mining» more  KDD 2009»
15 years 5 months ago
Identifying graphs from noisy and incomplete data
There is a growing wealth of data describing networks of various types, including social networks, physical networks such as transportation or communication networks, and biologic...
Galileo Mark S. Namata Jr., Lise Getoor
150
Voted
IDA
2011
Springer
14 years 5 months ago
A parallel, distributed algorithm for relational frequent pattern discovery from very large data sets
The amount of data produced by ubiquitous computing applications is quickly growing, due to the pervasive presence of small devices endowed with sensing, computing and communicatio...
Annalisa Appice, Michelangelo Ceci, Antonio Turi, ...
80
Voted
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
15 years 5 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
80
Voted
ICDM
2007
IEEE
96views Data Mining» more  ICDM 2007»
15 years 4 months ago
The Chosen Few: On Identifying Valuable Patterns
Constrained pattern mining extracts patterns based on their individual merit. Usually this results in far more patterns than a human expert or a machine learning technique could m...
Björn Bringmann, Albrecht Zimmermann
75
Voted
DMIN
2006
113views Data Mining» more  DMIN 2006»
14 years 11 months ago
Performance Evaluation of Two Data Mining Techniques of Network Alarms Analysis
In large telecommunication networks, alarms are usually useful for identifying faults and, therefore solving them. However, for large systems the number of alarms produced is so la...
Jacques-H. Bellec, M. Tahar Kechadi, Joe Carthy