Sciweavers

4009 search results - page 120 / 802
» Clustering on Complex Graphs
Sort
View
151
Voted
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
16 years 4 months ago
Event detection from evolution of click-through data
Previous efforts on event detection from the web have focused primarily on web content and structure data ignoring the rich collection of web log data. In this paper, we propose t...
Qiankun Zhao, Tie-Yan Liu, Sourav S. Bhowmick, Wei...
154
Voted
ICDM
2009
IEEE
139views Data Mining» more  ICDM 2009»
15 years 1 months ago
Frequent Pattern Discovery from a Single Graph with Quantitative Itemsets
In this paper, we focus on a single graph whose vertices contain a set of quantitative attributes. Several networks can be naturally represented in this complex graph. An example i...
Yuuki Miyoshi, Tomonobu Ozaki, Takenao Ohkawa
134
Voted
JSYML
2010
95views more  JSYML 2010»
14 years 10 months ago
Some natural decision problems in automatic graphs
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
Dietrich Kuske, Markus Lohrey
153
Voted
ICMCS
2007
IEEE
180views Multimedia» more  ICMCS 2007»
15 years 10 months ago
Discrete Regularization for Perceptual Image Segmentation via Semi-Supervised Learning and Optimal Control
In this paper, we present a regularization approach on discrete graph spaces for perceptual image segmentation via semisupervised learning. In this approach, first, a spectral cl...
Hongwei Zheng, Olaf Hellwich
EUROPAR
2008
Springer
15 years 5 months ago
Reducing Kernel Development Complexity in Distributed Environments
Setting up generic and fully transparent distributed services for clusters implies complex and tedious kernel developments. More flexible approaches such as user-space libraries ar...
Adrien Lebre, Renaud Lottiaux, Erich Focht, Christ...