A Fuzzy-Interval Based Approach For Explicit Graph Embedding

Muhammad Muzzamil Luqman1,2, Josep Llados2, Jean-Yves Ramel1, Thierry Brouard1 1

Laboratoire d'Informatique, Université François Rabelais de Tours, France 2 Computer Vision Center, Universitat Autònoma de Barcelona, Spain {mluqman, josep}@cvc.uab.es, {ramel, brouard}@univ-tours.fr

ICPR’2010 contest GEPR Sunday, 22 August 2010

Introduction Proposed method Conclusion

Introduction

Graph embedding (whats and whys) “ … is a methodology aimed at representing a whole graph (possibly with attributes attached to its nodes and edges) as a point in a suitable vectorial space … ” “ Graph embedding, in this sense, is a real bridge joining the two worlds: once the object at hand has been described in terms of graphs, and the latter represented in the vectorial space, all the problems of matching, learning and clustering can be performed using classical Statistical Pattern Recognition algorithms. ”

ICPR’2010 contest GEPR http://nerone.diiie.unisa.it/contest/description.shtml

-2

Introduction Proposed method Conclusion

Introduction

Explicit graph embedding

“… one vector per graph … ” ICPR’2010 contest GEPR http://nerone.diiie.unisa.it/contest/description.shtml

-3

Introduction Proposed method Conclusion

Proposed feature vector

Encode details on the structure, topology and geometry of underlying graph

Fig. The proposed feature vector

Length of feature vector: 1+1+w+(m)+(n)

-4

Introduction Proposed method Conclusion

Features for node degrees

-5

1. Start with node-degrees of all the graphs in dataset (learning - if available)

2. Histogram based binning technique for obtaining an initial set of bins [1] 3. Arrange these initial set of bins to define fuzzy intervals (i.e. features) 1. 3-bins forms 1-fuzzy interval (as used for GEPR) 2. Fuzzy zones of (full, medium, low) membership around each fuzzy interval 3. Membership weights of 1.00, 0.66, 0.34

4.

For each graph in dataset (testing) compute the “w” features for its node degrees (i.e. the cardinality of each fuzzy interval)

Number of features for node-degrees = w

Introduction Proposed method Conclusion -6

Features for node-attributes

For each node-attribute (Ki)

1. Start with the values of the “Ki” node-attribute of all the graphs in dataset (learning – iff) 2. Histogram based binning technique for obtaining an initial set of bins [1] 3. Arrange these initial set of bins to define fuzzy intervals (i.e. features) 1. 3-bins forms 1-fuzzy interval (as used for GEPR) 2. Fuzzy zones of (full, medium, low) membership around each fuzzy interval 3. Membership weights of 1.00, 0.66, 0.34 4. For each graph in dataset (testing) compute the “Kxi” features for its “Ki” node-attribute (i.e. the cardinality of each fuzzy interval)

Number of features for node-attributes = m =

∑Kxi

Introduction Proposed method Conclusion -7

Features for edge-attributes

For each edge-attribute (Li)

1. Start with the values of the “Li” edge-attribute of all the graphs in dataset (learning – iff) 2. Histogram based binning technique for obtaining an initial set of bins [1] 3. Arrange these initial set of bins to define fuzzy intervals (i.e. features) 1. 3-bins forms 1-fuzzy interval (as used for GEPR) 2. Fuzzy zones of (full, medium, low) membership around each fuzzy interval 3. Membership weights of 1.00, 0.66, 0.34 4. For each graph in dataset (testing) compute the “Lxi” features for its “Li” edge-attribute (i.e. the cardinality of each fuzzy interval)

Number of features for edge-attributes = n =

∑Lxi

Introduction Proposed method Conclusion

Conclusion

Explicit graph embedding for undirected attributed graphs Proposed feature vector encodes details on, 1. the structure of graph 2. attributes of nodes

3. attributes of edges A basic fuzzy approach to incorporate robustness against graph-deformations In future planning to extend this work for directed attributed graphs

-8

Introduction Proposed method Conclusion

References

[1] Colot, O., Olivier, C., C., P., A., E.M.: Information criteria and abrupt changes in probability laws. In: Signal Processing VII : Theories and Applications. pp. 1855-1858 (1994)

-9

A Fuzzy-Interval Based Approach For Explicit Graph ...

Aug 22, 2010 - Muhammad Muzzamil Luqman1,2, Josep Llados2, Jean-Yves Ramel1, Thierry Brouard1. 1 Laboratoire d'Informatique, Université François ...

227KB Sizes 0 Downloads 276 Views

Recommend Documents

A Fuzzy-Interval Based Approach for Explicit Graph ... - Springer Link
number of edges, node degrees, the attributes of nodes and the attributes of edges in ... The website [2] for the 20th International Conference on Pattern Recognition. (ICPR2010) ... Graph embedding, in this sense, is a real bridge joining the.

A Fuzzy-Interval Based Approach for Explicit Graph ... - Springer Link
Computer Vision Center, Universitat Autónoma de Barcelona, Spain. {mluqman ... number of edges, node degrees, the attributes of nodes and the attributes.

A Graph-Partitioning Based Approach for Parallel Best ... - icaps 2017
GRAZHDA* seeks to approximate the partitioning of the actual search space graph by partitioning the domain tran- sition graph, an abstraction of the state space ...

A Partition-Based Approach to Graph Mining
Proceedings of the 22nd International Conference on Data Engineering (ICDE'06) ... volves splitting a dataset into subsets, learning/mining from one or more of ...

A Partition-Based Approach to Graph Mining
ral data can be modeled as graphs. ... Proceedings of the 22nd International Conference on Data Engineering ...... CPU, 2.5GB RAM and 73GB hard disk.

Vessels-Cut: A Graph Based Approach to Patient ...
est path between the graph nodes that contain the vessel endpoints. The edge weights compound local image and seed intensity information and vessel path.

A Graph-based Algorithm for Scheduling with Sum ...
in a real wireless networking environment is ignored, 2) It is not obvious how to choose an appropriate disk radius d because there is no clear relation between d ...

A Graph-based Algorithm for Scheduling with Sum ...
I. INTRODUCTION. In a wireless ad hoc network, a group of nodes communicate ... In addition to these advantages, by analyzing the algorithm, we have found a ...

A textual graph-based modeling framework for education ... - GitHub
Item 1 - 6 - Proc-2013-1-3-15.pdf (A visual DPF tool implemented by our students) ... Elements (in the signature) having the same name are considered ... {LOCAL PATH ON YOUR COMPUTER}/no.hib.dpf.text.updatesite/target/site. 8. Open the ...

A new approach for perceptually-based fitting strokes ...
CEIG - Spanish Computer Graphics Conference (2015). Jorge Lopez-Moreno and ... [MSR09] notwith- c⃝ The Eurographics Association 2015. ... is typical: stroke preprocessing precedes feature detection which precedes a hybrid-based classifier (Kara and

A new optimization based approach for push recovery ... - Amazon AWS
predictive control and very similar to [17], with additional objectives for the COM. Some models went beyond the LIP ... A stabilization algorithm based on predictive optimization is computed to bring the model to a static ..... the hand contact in (

DualSum: a Topic-Model based approach for ... - Research at Google
−cdn,k denotes the number of words in document d of collection c that are assigned to topic j ex- cluding current assignment of word wcdn. After each sampling ...

A Morphology-Based Approach for Interslice ... - IEEE Xplore
damental cases: one-to-one, one-to-many, and zero-to-one corre- spondences. The proposed interpolation process is iterative. One iteration of this process ...

A Holistic Approach for Semantic-Based Game ... - Antonios Liapis
generation solution that would identify suitable Web information sources and enrich game content with semantic .... information — or more appropriately, the human engineers insert their real-world assumptions (e.g. on ..... 2020 Investing in human

A Network Pruning Based Approach for Subset-Specific ...
framework for top-k influential detection to incorporate γ. Third, we ... online social networks, we believe that it is useful in other domains ... campaign which aims to focus only on nodes which are sup- .... In [10], an alternate approach is pro-

A Convex Hull Approach for the Reliability-based Design Optimization ...
The proposed approach is applied to the reliability-based design of a ... design optimization, nonlinear transient dynamic problems, data mining, ..... clearer visualization of the response behavior, it is projected on the (response, length) ...

A Convex Hull Approach for the Reliability-Based ...
available Finite Element software. However, these ..... the explicit software ANSYS/LS-DYNA and the ..... Conferences – Design Automation Conference. (DAC) ...

A Domain Knowledge-based Approach for Automatic ...
extracted from approximately 100 commercial invoices and we obtained very ... step we exploit domain-knowledge about possible OCR mis- takes to generate a set ..... [13] Wikipedia. Codice fiscale — Wikipedia, the free encyclopedia, 2011.

A Gauss Function Based Approach for Unbalanced ...
to achieve interoperability, especially in web scale, becomes .... a concept ci in O1, we call the procedure to find the se- ...... Web Conference(WWW), 2007.

A Dependency-based Word Reordering Approach for ...
data. The results in their studies show that translation performance is significantly improved in BLEU score over baseline systems. Some extended approaches use syntax information to modify translation models which are called syntax-based SMT approac

A Model-Based Approach for Making Ecological ...
Currently, a user of the DISTANCE software (Thomas et al., 2006) can ... grazed) accounting for variable detection probability but they have rather limited options ...

A sensitivity-based approach for pruning architecture of ...
It may not work properly when the rel- evance values of all Adalines concerned are very close one another. This case may mostly happen to Adalines with low.

A Synthetic-Vision Based Steering Approach for Crowd Simulation - Inria
Virtual Crowd is a wide topic that raises numerous problems in- cluding population ... however obtained at the cost of some limitations, such as restricting the total number of ... processing optic flows acquired with physical systems and extract-.