Sciweavers

2227 search results - page 93 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
99
Voted
EPIA
2009
Springer
15 years 7 months ago
An Algorithm to Discover the k-Clique Cover in Networks
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
Luís Cavique, Armando B. Mendes, Jorge M. A...
CVPR
2009
IEEE
16 years 6 months ago
Learning Signs from Subtitles: A Weakly Supervised Approach to Sign Language Recognition
This paper introduces a fully-automated, unsupervised method to recognise sign from subtitles. It does this by using data mining to align correspondences in sections of videos. Bas...
Helen Cooper, Richard Bowden
SDM
2009
SIAM
251views Data Mining» more  SDM 2009»
15 years 9 months ago
High Performance Parallel/Distributed Biclustering Using Barycenter Heuristic.
Biclustering refers to simultaneous clustering of objects and their features. Use of biclustering is gaining momentum in areas such as text mining, gene expression analysis and co...
Alok N. Choudhary, Arifa Nisar, Waseem Ahmad, Wei-...
106
Voted
ICDM
2003
IEEE
104views Data Mining» more  ICDM 2003»
15 years 6 months ago
Localized Prediction of Continuous Target Variables Using Hierarchical Clustering
In this paper, we propose a novel technique for the efficient prediction of multiple continuous target variables from high-dimensional and heterogeneous data sets using a hierarch...
Aleksandar Lazarevic, Ramdev Kanapady, Chandrika K...
BTW
1999
Springer
157views Database» more  BTW 1999»
15 years 5 months ago
Database Primitives for Spatial Data Mining
Abstract: Spatial data mining algorithms heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a singl...
Martin Ester, Stefan Grundlach, Hans-Peter Kriegel...