Sciweavers

2227 search results - page 70 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
PAKDD
2007
ACM
224views Data Mining» more  PAKDD 2007»
15 years 6 months ago
Graph Nodes Clustering Based on the Commute-Time Kernel
This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel...
Luh Yen, François Fouss, Christine Decaeste...
103
Voted
ICDM
2007
IEEE
206views Data Mining» more  ICDM 2007»
15 years 6 months ago
A Novel Rule Weighting Approach in Classification Association Rule Mining
Classification Association Rule Mining (CARM) is a recent Classification Rule Mining (CRM) approach that builds an Association Rule Mining (ARM) based classifier using Classificat...
Yanbo J. Wang, Qin Xin, Frans Coenen
SAC
2008
ACM
15 years 1 days ago
Mining fault-tolerant frequent patterns efficiently with powerful pruning
The mining of frequent patterns in databases has been studied for several years. However, the real-world data tends to be dirty and frequent pattern mining which extracts patterns...
Jhih-Jie Zeng, Guanling Lee, Chung-Chi Lee
101
Voted
DOLAP
2004
ACM
15 years 6 months ago
A new OLAP aggregation based on the AHC technique
Nowadays, decision support systems are evolving in order to handle complex data. Some recent works have shown the interest of combining on-line analysis processing (OLAP) and data...
Riadh Ben Messaoud, Omar Boussaid, Sabine Rabas&ea...
KDD
2012
ACM
164views Data Mining» more  KDD 2012»
13 years 3 months ago
SeqiBloc: mining multi-time spanning blockmodels in dynamic graphs
Blockmodelling is an important technique for decomposing graphs into sets of roles. Vertices playing the same role have similar patterns of interactions with vertices in other rol...
Jeffrey Chan, Wei Liu, Christopher Leckie, James B...