Filters








74 Hits in 6.1 sec

Product graph-based higher order contextual similarities for inexact subgraph matching

Anjan Dutta, Josep Lladós, Horst Bunke, Umapada Pal
<span title="">2018</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jm6w2xclfzguxnhmnmq5omebpi" style="color: black;">Pattern Recognition</a> </i> &nbsp;
This is done by considering the tensor product graph (TPG) of two graphs to be matched, where each node is an ordered pair of nodes of the operand graphs.  ...  Experimental results shown on synthetic as well as real benchmarks illustrate that higher order contextual similarities add discriminating power and allow one to find approximate solutions to the subgraph  ...  Therefore, in this paper we propose an inexact subgraph matching methodology based on tensor product graph (TPG).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.patcog.2017.12.003">doi:10.1016/j.patcog.2017.12.003</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5ubxanxmtfazhgvb4ilarg2a6e">fatcat:5ubxanxmtfazhgvb4ilarg2a6e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200310185931/https://ore.exeter.ac.uk/repository/bitstream/handle/10871/39224/1702.00391v1.pdf;jsessionid=5EDDA65DCF8FD1CD50C97358E204754A?sequence=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e8/f1/e8f12beec7089c82308cb4759864993551f4bf1a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.patcog.2017.12.003"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Subgraph spotting in graph representations of comic book images

Thanh Nam Le, Muhammad Muzzamil Luqman, Anjan Dutta, Pierre Héroux, Christophe Rigaud, Clément Guérin, Pasquale Foggia, Jean-Christophe Burie, Jean-Marc Ogier, Josep Lladós, Sébastien Adam
<span title="">2018</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6r4znskbk5h2ngu345slqsm6eu" style="color: black;">Pattern Recognition Letters</a> </i> &nbsp;
In this paper we address the problem of lack of freely available ground-truthed datasets for subgraph spotting and present a new dataset for subgraph spotting in graph representations of comic book images  ...  Graph-based representations are the most powerful data structures for extracting, representing and preserving the structural information of underlying data.  ...  In this paper we present our recent work on the research problem of subgraph spotting. This work was initiated for organizing a  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.patrec.2018.06.017">doi:10.1016/j.patrec.2018.06.017</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jpspfs3b3jemlh62uvtjfh7zs4">fatcat:jpspfs3b3jemlh62uvtjfh7zs4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200309173512/https://ore.exeter.ac.uk/repository/bitstream/handle/10871/39237/PRL2018_SSGCI.pdf;jsessionid=E8A8FEDBA4390D7EE1C2952EAF77A29F?sequence=2" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2c/b6/2cb678b3570017d0b80be2e66bd85b0b8588c98a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.patrec.2018.06.017"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Graph-based Text Representation and Matching: A Review of the State of the Art and Future Challenges

Ahmed Hamza Osman, Omar Mohammed Barukub
<span title="">2020</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/q7qi7j4ckfac7ehf3mjbso4hne" style="color: black;">IEEE Access</a> </i> &nbsp;
In addition, the graph matching taxonomy implements three main categories based on the matching approach, including structural-, semantic-, and similarity-based approaches.  ...  The main issues of graph representation, such as research topics and the sub-taxonomy of graph models for web documents, are introduced and categorized.  ...  This step allowed for quick identification and elimination of non-matches. 3) SIMILARITY-BASED MATCHING APPROACH The inexact matching approaches examined in the preceding section all relied on the similarity  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/access.2020.2993191">doi:10.1109/access.2020.2993191</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wkss6xzzcneujfe6ynnmbydhsa">fatcat:wkss6xzzcneujfe6ynnmbydhsa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201107141359/https://ieeexplore.ieee.org/ielx7/6287639/8948470/09088989.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5f/ba/5fbaaf7df33225d5a6c337203f7d70edd5662418.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/access.2020.2993191"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> ieee.com </button> </a>

Matched Filters for Noisy Induced Subgraph Detection [article]

Daniel L. Sussman, Youngser Park, Carey E. Priebe, Vince Lyzinski
<span title="2019-07-01">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We propose a solution to this problem via a graph matching matched filter: centering and padding the smaller adjacency matrix and applying graph matching methods to align it to the larger network.  ...  Under a statistical model for correlated pairs of graphs, which yields a noisy copy of the small graph within the larger graph, the resulting optimization problem can be guaranteed to recover the true  ...  and higher-order contextual approaches.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1803.02423v3">arXiv:1803.02423v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/utibt33qbbbrha2iggbjdjpxyi">fatcat:utibt33qbbbrha2iggbjdjpxyi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200826182538/https://arxiv.org/pdf/1803.02423v2.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c9/8e/c98e066533fbd21921e43c0e50445aa5479911d2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1803.02423v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Comparing Protein Interaction Networks via a Graph Match-and-Split Algorithm [article]

Manikandan Narayanan, Richard M. Karp
<span title="2007-02-01">2007</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The method is based on an algorithm we developed to identify matching subgraphs between two graphs.  ...  Our algorithm framework also admits quite general connectivity and local matching criteria that define when two subgraphs match and constitute a conserved module.  ...  Acknowledgments We thank Jayanth Kumar Kannan for valuable discussions that led to the algorithm.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/q-bio/0702001v1">arXiv:q-bio/0702001v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ctsbyelhdvbf7ftdsj6sieylnq">fatcat:ctsbyelhdvbf7ftdsj6sieylnq</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-q-bio0702001/q-bio0702001.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/q-bio/0702001v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Spatial Location in Integrated Circuits through Infrared Microscopy

Raphaël Abelé, Jean-Luc Damoiseaux, Redouane El Moubtahij, Jean-Marc Boi, Daniele Fronte, Pierre-Yvan Liardet, Djamal Merad
<span title="2021-03-20">2021</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/taedaf6aozg7vitz5dpgkojane" style="color: black;">Sensors</a> </i> &nbsp;
the inexact matching arising from noises on graphs.  ...  In this paper, we present an infrared microscopy based approach for structures' location in integrated circuits, to automate their secure characterization.  ...  [54] matches our constraints. Indeed, their approach is based on the computation of higher order similarities between pairwise nodes and edges of input graphs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/s21062175">doi:10.3390/s21062175</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/33804619">pmid:33804619</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC8003807/">pmcid:PMC8003807</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/paavhth52vhjrpxogxswso2sxi">fatcat:paavhth52vhjrpxogxswso2sxi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210715183420/https://hal-amu.archives-ouvertes.fr/hal-03225649/document" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e6/73/e6732d7107e45af3f06b829f9c94a5e7c6e32d13.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/s21062175"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8003807" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

Neural Graph Matching for Pre-training Graph Neural Networks [article]

Yupeng Hou, Binbin Hu, Wayne Xin Zhao, Zhiqiang Zhang, Jun Zhou, Ji-Rong Wen
<span title="2022-03-03">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this paper, we present a novel Graph Matching based GNN Pre-Training framework, called GMPT.  ...  In this way, we can learn adaptive representations for a given graph when paired with different graphs, and both node- and graph-level characteristics are naturally considered in a single pre-training  ...  For the proposed graph matching methods, we adopt dot production for the sim(•) function and select τ = 0.07 in Eqn. (3.5) .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2203.01597v1">arXiv:2203.01597v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fq6zrtbbcvdd5dgcxp2cgwgazy">fatcat:fq6zrtbbcvdd5dgcxp2cgwgazy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220307203340/https://arxiv.org/pdf/2203.01597v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/6e/aa/6eaacc3c03b4227bb2808719214216a80ed542b0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2203.01597v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Visual summaries for graph collections

David Koop, Juliana Freire, Claudio T. Silva
<span title="">2013</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/553mn3ftxzcw3dqndtflgqwduq" style="color: black;">2013 IEEE Pacific Visualization Symposium (PacificVis)</a> </i> &nbsp;
We present an algorithm to compute a single summary graph that efficiently encodes an entire collection of graphs by finding and merging similar nodes and edges.  ...  Instead of only merging nodes and edges that are exactly the same, we use domain-specific comparison functions to collapse similar nodes and edges which allows us to generate more compact representations  ...  We can generate an order of node merges for each match based on their costs. We can make this ordering global by integrating the orders at each level.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/pacificvis.2013.6596128">doi:10.1109/pacificvis.2013.6596128</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/apvis/KoopFS13.html">dblp:conf/apvis/KoopFS13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pmncmn6kofbgzilswgybwvi3xq">fatcat:pmncmn6kofbgzilswgybwvi3xq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20151123112921/http://vgc.poly.edu:80/~dakoop/pubs/graph-summaries.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ac/fb/acfb6f2966e553c48e5df968e7763f2514edae0d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/pacificvis.2013.6596128"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Constraint, Optimization, and Hierarchy: Reviewing Stereoscopic Correspondence of Complex Features

Graeme A. Jones
<span title="">1997</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dsarpzh6wfgadnyijwv5l6gh2i" style="color: black;">Computer Vision and Image Understanding</a> </i> &nbsp;
Despite the tercal matching is discussed at some length including suggestions minology most methods are highly similar but often offer on how hierarchical constraints may be formally embedded novel developments  ...  This search for homologs of image features in sequences of images is known as the correspondence To extract three dimensional data from a pair of images, it is essential to solve the correspondence problem  ...  This represents an upper limit on the size of the search problem as, in practice, tion of locating the mapping of this subgraph onto the model graph is known as subgraph isomorphism or inexact some constraint  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1006/cviu.1996.0482">doi:10.1006/cviu.1996.0482</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3h3bhoibtzfcxkjuort3p4z324">fatcat:3h3bhoibtzfcxkjuort3p4z324</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20080424173145/http://dircweb.king.ac.uk/papers/jones97a/cviu.ps.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/cc/b6/ccb65dd4edad4b057c51805bf14cd6bb0bdd4288.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1006/cviu.1996.0482"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Structural matching by discrete relaxation

R.C. Wilson, E.R. Hancock
<span title="">1997</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3px634ph3vhrtmtuip6xznraqi" style="color: black;">IEEE Transactions on Pattern Analysis and Machine Intelligence</a> </i> &nbsp;
In consequence of this assumed model the consistency of match is gauged by a compound exponential function of a higher-order Hamming distance between symbolic relations; there is a single exponential associated  ...  These exponential functions naturally soften the symbolic constraints represented by the relational mappings, The method may be operated without the need for an explicit null matching process.  ...  For this reason, we base our criterion on the average superclique matching probability.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/34.601251">doi:10.1109/34.601251</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/w3ihevhvqzetlcg3wik3gjvthe">fatcat:w3ihevhvqzetlcg3wik3gjvthe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130530053905/http://www.bmva.org/bmvc/1994/bmvc-94-004.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c1/89/c1892f3fcc4860e3b4c1235ec9094be4521df2b1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/34.601251"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Challenges, Techniques, and Trends of Simple Knowledge Graph Question Answering: A Survey

Mohammad Yani, Adila Alfa Krisnadhi
<span title="2021-06-30">2021</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dmr4kpn2yreovpdxpdiqtjcrnu" style="color: black;">Information</a> </i> &nbsp;
Simple questions are the most common type of questions used for evaluating a knowledge graph question answering (KGQA).  ...  Knowledge graph question answering (KGQA) systems are systems whose aim is to automatically answer natural language questions (NLQs) over knowledge graphs (KGs).  ...  Semantic matching models such as RESCALL [57] and TATEC [58] can be extended for future KGQA for matching facts by exploring similarity-based scoring functions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/info12070271">doi:10.3390/info12070271</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/so5vmq7pkbdj3alkfnxf6xjchq">fatcat:so5vmq7pkbdj3alkfnxf6xjchq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210702185940/https://res.mdpi.com/d_attachment/information/information-12-00271/article_deploy/information-12-00271.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c9/45/c9458ed2f791ce6c0fd7409fd8bad8f032e3f6e5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/info12070271"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>

Utility map reconstruction

J. P. De Knecht, J. G. M. Schavemaker, M. J. T. Reinders, A. M. Vossepoel
<span title="">2001</span> <i title="Informa UK Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5bs7dystenbhbe6dcjwszk233u" style="color: black;">International Journal of Geographical Information Science</a> </i> &nbsp;
In this paper we describe a new system for the reconstruction of geometric map elements as developed in the Dutch TopSpin-PNEM project 'Knowledge-based conversion of utility maps'.  ...  This is done using a map correspondence between the utility map and the base map based on mutual topography and relational information supplied by a map interpretation module.  ...  Acknowledgments This work is sponsored by TopSpin in the project 'Knowledge-based conversion of utility maps (for the Provinciale Noord-brabantse Energie Maatschappij PNEM)'.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1080/136588100750058670">doi:10.1080/136588100750058670</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ina46kxnczamddk55eyllr37lm">fatcat:ina46kxnczamddk55eyllr37lm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20030320042428/http://www.ph.tn.tudelft.nl:80/People/albert/papers/UK-552R4.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/55/72/5572689eabadfd3a10b1216814e7d313c9f03bdb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1080/136588100750058670"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> tandfonline.com </button> </a>

Approximate Graph Matching in Software Engineering

Segla Kpodjedo
<span title="">2009</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qjdq73uwobgdxnahtgyqdrsouu" style="color: black;">2009 16th Working Conference on Reverse Engineering</a> </i> &nbsp;
Second, in order to retrieve such node matches, we resorted to the concept of local node similarity which consists in analyzing viii nodes' neighborhoods to assess for each possible node match the likelihood  ...  Building on the work done for generic AGM problems, we propose MADMatch, a Many-to-many Approximate Diagram Matching algorithm based on an ETGM formulation.  ...  It is often divided in two classes: exact graph matching and approximate graph matching (also referred to as inexact graph matching).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/wcre.2009.49">doi:10.1109/wcre.2009.49</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/wcre/Kpodjedo99a.html">dblp:conf/wcre/Kpodjedo99a</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5towdepxtrc6zmtq6hubbv6p3q">fatcat:5towdepxtrc6zmtq6hubbv6p3q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180721131226/https://publications.polymtl.ca/670/1/2011_HinnoutondjiKpodjedo.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/19/33/19336c392a3742440ea69d3dc9113b9c4ce36afc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/wcre.2009.49"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Modeling trajectory of dynamic clusters in image time-series for spatio-temporal reasoning

P. Heas, M. Datcu
<span title="">2005</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4odsbtjobjalfki6xxabjpdu6y" style="color: black;">IEEE Transactions on Geoscience and Remote Sensing</a> </i> &nbsp;
The hierarchy is composed of two inference steps: an unsupervised modeling of dynamic clusters resulting in a graph of trajectories, and an interactive learning procedure based on graphs which leads to  ...  New products have arisen from this intensive acquisition process: high-resolution satellite image time-series (SITS).  ...  Giros for stimulating discussions and for carefully preprocessing the data. The data were made available by the French Space Agency (CNES) from the ADAM project.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tgrs.2005.847791">doi:10.1109/tgrs.2005.847791</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uiarpp3dw5e4figd4fyktlzx7e">fatcat:uiarpp3dw5e4figd4fyktlzx7e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808213627/http://www.disp.uniroma2.it/geoinformation/download/Image-time-series.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/75/20/75205b4133247d88646dba8f87f15b745c3dae2e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tgrs.2005.847791"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Semantic Knowledge Representations for Soft Data Fusion [chapter]

Claire Laudy
<span title="2011-09-09">2011</span> <i title="InTech"> Efficient Decision Support Systems - Practice and Challenges From Current to Future </i> &nbsp;
Therefore, information fusion based on graphs structures is a major stake Sambhoos et al. (2008) relates about Inexact Graph Matching for real-time Fusion.  ...  The authors propose an inexact graph matching technique using a similarity measure between the nodes and arcs. A model of a situation of interest is drawn, using a graph structure.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5772/17762">doi:10.5772/17762</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/k6dmtrhxenfudcp575c2ykgbee">fatcat:k6dmtrhxenfudcp575c2ykgbee</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170815135310/http://cdn.intechopen.com/pdfs/19331/InTech-Semantic_knowledge_representations_for_soft_data_fusion.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9a/86/9a86b854e88ed2f018817ab1ee9c309f785be825.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5772/17762"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 74 results