ARTÍCULO
TITULO

Graph Matching - Graph Matching With a Dual-Step EM Algorithm

Cross    
A D J    
Hancock    
E R    

Resumen

No disponible

 Artículos similares

       
 
Alessio Martino, Luca Baldini and Antonello Rizzi    
Granular Computing is a powerful information processing paradigm, particularly useful for the synthesis of pattern recognition systems in structured domains (e.g., graphs or sequences). According to this paradigm, granules of information play the pivotal... ver más
Revista: Algorithms

 
Maximilian Hoffmann and Ralph Bergmann    
Similarity-based retrieval of semantic graphs is a core task of Process-Oriented Case-Based Reasoning (POCBR) with applications in real-world scenarios, e.g., in smart manufacturing. The involved similarity computation is usually complex and time-consumi... ver más
Revista: Algorithms

 
Dominik Köppl    
Although graph theory has already been introduced in spatial reasoning, current spatial database systems do not provide out-of-the-box routing on geometric points that are not matched on the graph. Methods that connect new reference locations to the grap... ver más
Revista: Algorithms

 
Yanhao Li and Wei Liu    
Event prediction is a knowledge inference problem that predicts the consequences or effects of an event based on existing information. Early work on event prediction typically modeled the event context to predict what would happen next. Moreover, the pre... ver más
Revista: Applied Sciences

 
Hasan Abu-Rasheed, Christian Weber, Johannes Zenkert, Mareike Dornhöfer and Madjid Fathi    
In modern industrial systems, collected textual data accumulates over time, offering an important source of information for enhancing present and future industrial practices. Although many AI-based solutions have been developed in the literature for a do... ver más
Revista: Informatics