Sciweavers

2227 search results - page 146 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
3DIM
2003
IEEE
15 years 6 months ago
A Discrete Reeb Graph Approach for the Segmentation of Human Body Scans
Segmentation of 3D human body (HB) scan is a very challenging problem in applications exploiting human scan data. To tackle this problem, this paper proposes a topological approac...
Yijun Xiao, Paul Siebert, Naoufel Werghi
111
Voted
ENGL
2007
180views more  ENGL 2007»
15 years 22 days ago
Biological Data Mining for Genomic Clustering Using Unsupervised Neural Learning
— The paper aims at designing a scheme for automatic identification of a species from its genome sequence. A set of 64 three-tuple keywords is first generated using the four type...
Shreyas Sen, Seetharam Narasimhan, Amit Konar
ICDM
2006
IEEE
132views Data Mining» more  ICDM 2006»
15 years 6 months ago
High Quality, Efficient Hierarchical Document Clustering Using Closed Interesting Itemsets
High dimensionality remains a significant challenge for document clustering. Recent approaches used frequent itemsets and closed frequent itemsets to reduce dimensionality, and to...
Hassan H. Malik, John R. Kender
97
Voted
CASCON
2004
129views Education» more  CASCON 2004»
15 years 2 months ago
Building predictors from vertically distributed data
Due in part to the large volume of data available today, but more importantly to privacy concerns, data are often distributed across institutional, geographical and organizational...
Sabine M. McConnell, David B. Skillicorn
IOR
2011
175views more  IOR 2011»
14 years 7 months ago
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
Balabhaskar Balasundaram, Sergiy Butenko, Illya V....