Sciweavers

2227 search results - page 43 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
ICDM
2009
IEEE
197views Data Mining» more  ICDM 2009»
14 years 10 months ago
A Linear-Time Graph Kernel
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
Shohei Hido, Hisashi Kashima
100
Voted
ICDAR
2009
IEEE
15 years 7 months ago
2D CAD Data Mining Based on Spatial Relation
In this research, we propose CAD data mining technique to obtain semantic elements without prior knowledge about plans being designed. Our method consists of two steps. The first ...
Hiroaki Kizu, Junko Yamamoto, Takeshi Takeda, Keij...
KDD
2010
ACM
327views Data Mining» more  KDD 2010»
15 years 4 months ago
Cold start link prediction
In the traditional link prediction problem, a snapshot of a social network is used as a starting point to predict, by means of graph-theoretic measures, the links that are likely ...
Vincent Leroy, Berkant Barla Cambazoglu, Francesco...
GD
2008
Springer
15 years 1 months ago
An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
J. Joseph Fowler, Carsten Gutwenger, Michael J&uum...
115
Voted
SIGMOD
2000
ACM
173views Database» more  SIGMOD 2000»
15 years 4 months ago
Efficient Algorithms for Mining Outliers from Large Data Sets
In this paper, we propose a novel formulation for distance-based outliers that is based on the distance of a point from its kth nearest neighbor. We rank each point on the basis o...
Sridhar Ramaswamy, Rajeev Rastogi, Kyuseok Shim