Sciweavers

2227 search results - page 247 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
137
Voted
ICDE
2007
IEEE
129views Database» more  ICDE 2007»
15 years 10 months ago
Ontology-driven Rule Generalization and Categorization for Market Data
—Radio Frequency Identification (RFID) is an emerging technique that can significantly enhance supply chain processes and deliver customer service improvements. RFID provides use...
Dongwoo Won, Dennis McLeod
121
Voted
TVCG
2010
141views more  TVCG 2010»
15 years 1 months ago
Fast Construction of k-Nearest Neighbor Graphs for Point Clouds
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
Michael Connor, Piyush Kumar
ENTCS
2006
162views more  ENTCS 2006»
15 years 3 months ago
Adaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search Plans
The current paper makes two contributions for the graph pattern matching problem of model transformation tools. First, model-sensitive search plan generation is proposed for patte...
Gergely Varró, Katalin Friedl, Dánie...
122
Voted
ESWS
2009
Springer
15 years 10 months ago
Neighborhood-Based Tag Prediction
We consider the problem of tag prediction in collaborative tagging systems where users share and annotate resources on the Web. We put forward HAMLET, a novel approach to automatic...
Adriana Budura, Sebastian Michel, Philippe Cudr&ea...
167
Voted
ICDE
2009
IEEE
173views Database» more  ICDE 2009»
15 years 1 months ago
Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database
There is a huge wealth of sequence data available, for example, customer purchase histories, program execution traces, DNA, and protein sequences. Analyzing this wealth of data to ...
Bolin Ding, David Lo, Jiawei Han, Siau-Cheng Khoo