Sciweavers

227 search results - page 31 / 46
» Fitting a graph to vector data
Sort
View
COMPGEOM
2006
ACM
15 years 1 months ago
I/O-efficient batched union-find and its applications to terrain analysis
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
Pankaj K. Agarwal, Lars Arge, Ke Yi
IDA
2010
Springer
14 years 8 months ago
Selecting the Links in BisoNets Generated from Document Collections
According to Koestler, the notion of a bisociation denotes a connection between pieces of information from habitually separated domains or categories. In this paper, we consider a ...
Marc Segond, Christian Borgelt
88
Voted
SDM
2009
SIAM
149views Data Mining» more  SDM 2009»
15 years 7 months ago
Near-optimal Supervised Feature Selection among Frequent Subgraphs.
Graph classification is an increasingly important step in numerous application domains, such as function prediction of molecules and proteins, computerised scene analysis, and an...
Alexander J. Smola, Arthur Gretton, Hans-Peter Kri...
81
Voted
SCIA
2005
Springer
166views Image Analysis» more  SCIA 2005»
15 years 3 months ago
Clustering Based on Principal Curve
Clustering algorithms are intensively used in the image analysis field in compression, segmentation, recognition and other tasks. In this work we present a new approach in clusteri...
Ioan Cleju, Pasi Fränti, Xiaolin Wu
JMLR
2008
94views more  JMLR 2008»
14 years 10 months ago
Using Markov Blankets for Causal Structure Learning
We show how a generic feature selection algorithm returning strongly relevant variables can be turned into a causal structure learning algorithm. We prove this under the Faithfuln...
Jean-Philippe Pellet, André Elisseeff