Filters








7 Hits in 6.5 sec

Optimal encoding of graph homomorphism energy using fuzzy information aggregation operators

P.N. Suganthan, H. Yan, E.K. Teoh, D.P. Mital
1998 Pattern Recognition  
The attributed relational graph matching (ARG) strategy is a well-known approach to object/ pattern recognition.  ...  chosen for all models by trial-and-error for the parameters in the function.  ...  HOMOMORPHIC ARG MATCHING BY POTTS MFT NETWORKS In this paper, the Potts MFT neural network based homomorphic ARG matching scheme is employed to perform the recognition.  ... 
doi:10.1016/s0031-3203(97)00067-8 fatcat:jru7fkitwrfjhajibyuqqvt2yq

Exact and Inexact Graph Matching: Methodology and Applications [chapter]

Kaspar Riesen, Xiaoyi Jiang, Horst Bunke
2010 Managing and Mining Graph Data  
The present chapter reviews some fundamental concepts of both paradigms and shows two recent applications of graph matching in the fields of information retrieval and pattern recognition.  ...  The process of evaluating the similarity of graphs is referred to as graph matching. Two approaches to this task exist, viz. exact and inexact graph matching.  ...  In [83] the optimization procedure is stabilized by means of a Potts MFT network.  ... 
doi:10.1007/978-1-4419-6045-0_7 dblp:series/ads/RiesenJB10 fatcat:mr2bpz5xwnbiva5x3mxbzqrnhm

Indexing with Well-Founded Total Order for Faster Subgraph Isomorphism Detection [chapter]

Markus Weber, Marcus Liwicki, Andreas Dengel
2011 Lecture Notes in Computer Science  
In experiments performed on random sample graphs, the number of permutations has been decreased to a fraction of 10 −18 in average compared to the original approach by Messmer.  ...  In this paper an extension of index-based subgraph matching is proposed.  ...  A further group of suboptimal methods are approximate methods, they are based on neural networks, such Hopfield network, Kohonen map or Potts MFT neural net.  ... 
doi:10.1007/978-3-642-20844-7_19 fatcat:aitfthndofdlhpilkyiggnbwa4

Faster subgraph isomorphism detection by well-founded total order indexing

Markus Weber, Marcus Liwicki, Andreas Dengel
2012 Pattern Recognition Letters  
Using this weight function, a well-founded total order is defined on the weights of the labels. Inversions which violate the order are not allowed.  ...  In this paper an extension to index-based subgraph matching is proposed.  ...  A further group of suboptimal methods are approximative methods, they are based on neural networks [24] , such as the Hopfield network, Kohonen map [25] or Potts MFT neural net.  ... 
doi:10.1016/j.patrec.2012.04.017 fatcat:c6ginmh53jabplpamvrt66ic3m

A high-bias, low-variance introduction to Machine Learning for physicists [article]

Pankaj Mehta, Marin Bukov, Ching-Hao Wang, Alexandre G.R. Day, Clint Richardson, Charles K. Fisher, David J. Schwab
2019 arXiv   pre-print
Topics covered in the review include ensemble models, deep learning and neural networks, clustering and data visualization, energy-based models (including MaxEnt models and Restricted Boltzmann Machines  ...  A notable aspect of the review is the use of Python Jupyter notebooks to introduce modern ML/statistical packages to readers using physics-inspired datasets (the Ising Model and Monte-Carlo simulations  ...  This analytic expression allows us to implement the Gaussian VAE in a straight forward way using neural networks. The computational graph for this implementation is shown in Fig. 74 .  ... 
arXiv:1803.08823v2 fatcat:vmtp62jyvjfxhpidpdcozfnza4

Recent developments in graph matching

H. Bunke
Proceedings 15th International Conference on Pattern Recognition. ICPR-2000  
In many applications, for example, in pattern recognition and computer vision, it is required to measure the similarity of objects.  ...  When graphs are used for the representation of structured objects, then the problem of measuring object similarity turns into the problem of computing the similarity of graphs, which is also known as graph  ...  Acknowledgement The author wants to thank Dr. X. Jiang for continuous collaboration and intensive exchange of ideas.  ... 
doi:10.1109/icpr.2000.906030 dblp:conf/icpr/Bunke00 fatcat:vl46dj3uo5aiphnnshyeua73ne

Fake BTS Attacks of GSM System on Software Radio Platform

Yubo Song, Kan Zhou, Xi Chen
2012 Journal of Networks  
The first paper, "Extensive Design for Attack's Recognition and Resistance of Survivable Network" by Hui Xu and Xiang Gu, gives a solution of attack defense of survivable network based on extentics.  ...  In the second paper, "A Graph Clustering Algorithm Providing Scalability" by Lei Huang, Jiabing Wang and Xing He, proposes a new scalable graph clustering method called APANC (Affinity Propagation And  ...  , neural networks, immune-based and so on.  ... 
doi:10.4304/jnw.7.2.275-281 fatcat:3ejjimllcvewjeifopbvhl3zmi