Sciweavers

3265 search results - page 114 / 653
» Representing Groups on Graphs
Sort
View
ICCS
2007
Springer
15 years 5 months ago
Conceptual Graphs as Cooperative Formalism to Build and Validate a Domain Expertise
Abstract. This work takes place in the general context of the construction and validation of a domain expertise. It aims at the cooperation of two kinds of knowledge, heterogeneous...
Rallou Thomopoulos, Jean-François Baget, Ol...
CVPR
2012
IEEE
13 years 6 months ago
Non-negative low rank and sparse graph for semi-supervised learning
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering and classification. This paper proposes a novel no...
Liansheng Zhuang, Haoyuan Gao, Zhouchen Lin, Yi Ma...
COMPGEOM
2011
ACM
14 years 7 months ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang
ICDM
2006
IEEE
149views Data Mining» more  ICDM 2006»
15 years 10 months ago
Pattern Mining in Frequent Dynamic Subgraphs
Graph-structured data is becoming increasingly abundant in many application domains. Graph mining aims at finding interesting patterns within this data that represent novel knowl...
Karsten M. Borgwardt, Hans-Peter Kriegel, Peter Wa...
ECEASST
2006
305views more  ECEASST 2006»
15 years 3 months ago
The ParMol Package for Frequent Subgraph Mining
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...
Thorsten Meinl, Marc Wörlein, Olga Urzova, In...