Sciweavers

2227 search results - page 153 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
KDD
2002
ACM
155views Data Mining» more  KDD 2002»
16 years 1 months ago
SyMP: an efficient clustering approach to identify clusters of arbitrary shapes in large data sets
We propose a new clustering algorithm, called SyMP, which is based on synchronization of pulse-coupled oscillators. SyMP represents each data point by an Integrate-and-Fire oscill...
Hichem Frigui
106
Voted
ICML
2007
IEEE
16 years 1 months ago
Adaptive mesh compression in 3D computer graphics using multiscale manifold learning
This paper investigates compression of 3D objects in computer graphics using manifold learning. Spectral compression uses the eigenvectors of the graph Laplacian of an object'...
Sridhar Mahadevan
179
Voted
SIGMOD
2007
ACM
232views Database» more  SIGMOD 2007»
16 years 28 days ago
BLINKS: ranked keyword searches on graphs
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
Haixun Wang, Hao He, Jun Yang 0001, Philip S. Yu
107
Voted
DMIN
2006
131views Data Mining» more  DMIN 2006»
15 years 2 months ago
Use of Data Mining to Determine Cheating in Online Student Assessment
are proposing a model to help organizations detect and prevent cheats in online assessments. First we analyze different student personalities, stress situations generated by onlin...
Alberto Ochoa, Amol Wagholikar
VLDB
2005
ACM
140views Database» more  VLDB 2005»
15 years 6 months ago
Loadstar: Load Shedding in Data Stream Mining
In this demo, we show that intelligent load shedding is essential in achieving optimum results in mining data streams under various resource constraints. The Loadstar system intro...
Yun Chi, Haixun Wang, Philip S. Yu