書目名稱Graph-Based Representations in Pattern Recognition影響因子(影響力)學(xué)科排名
書目名稱Graph-Based Representations in Pattern Recognition網(wǎng)絡(luò)公開度
書目名稱Graph-Based Representations in Pattern Recognition網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Graph-Based Representations in Pattern Recognition被引頻次
書目名稱Graph-Based Representations in Pattern Recognition被引頻次學(xué)科排名
書目名稱Graph-Based Representations in Pattern Recognition年度引用
書目名稱Graph-Based Representations in Pattern Recognition年度引用學(xué)科排名
書目名稱Graph-Based Representations in Pattern Recognition讀者反饋
書目名稱Graph-Based Representations in Pattern Recognition讀者反饋學(xué)科排名
作者: 不可思議 時(shí)間: 2025-3-21 21:04
An Entropic Edge Assortativity Measureapply our novel assortativity characterization to both artificial random graphs and real-world networks. The experimental results demonstrate that our measure is effective in characterizing the structural complexity of networks and classifying networks that belong to different complexity classes.作者: 泥沼 時(shí)間: 2025-3-22 01:29
Coupled-Feature Hypergraph Representation for Feature Selectionnew data representation, we use a new information theoretic criterion referred to as multivariate mutual information to measure the high-order feature combinations with respect to the class labels. Therefore, we construct a coupled feature hypergraph to model the high-order relations among features.作者: 可用 時(shí)間: 2025-3-22 07:49 作者: Organization 時(shí)間: 2025-3-22 09:46
Incremental Embedding Within a Dissimilarity-Based Framework point somehow violates the usual separation between training and test sets since both sets should be jointly processed and is an important limitation in many practical applications where the test set is unbounded and unknown during the learning phase. Moreover, requiring the whole universe represen作者: analogous 時(shí)間: 2025-3-22 13:34
Consensus of Two Graph Correspondences Through a Generalisation of the Bipartite Graph Matchingon and also the graph matching could be reduced. We present a consensus method which, given two correspondences between two pairs of attributed graphs generated by separate entities and with different attribute domains, enounces a final correspondence consensus considering the existence of outliers.作者: analogous 時(shí)間: 2025-3-22 20:40
A Hypergraph Matching Framework for Refining Multi-source Feature Correspondences of the hypergraph through higher order clustering. Our method is invariant to scale variation of objects because of its capability for characterizing higher order structure. Furthermore, our method is computationally more efficient than existing hypergraph matching methods because the feature match作者: fledged 時(shí)間: 2025-3-22 22:45
VF2 Plus: An Improved version of VF2 for Biological Graphs2 algorithm that enable it to compete with more recently proposed graph matching techniques. Finally, we evaluate the effectiveness of these enhancement by comparing the matching performance both with the original VF2 and with several recent algorithms, using both the widely known MIVIA graph databa作者: Agnosia 時(shí)間: 2025-3-23 04:25 作者: 眨眼 時(shí)間: 2025-3-23 08:42 作者: 脫毛 時(shí)間: 2025-3-23 12:48
https://doi.org/10.1007/978-3-030-52414-2new data representation, we use a new information theoretic criterion referred to as multivariate mutual information to measure the high-order feature combinations with respect to the class labels. Therefore, we construct a coupled feature hypergraph to model the high-order relations among features.作者: FLOAT 時(shí)間: 2025-3-23 14:23 作者: 強(qiáng)化 時(shí)間: 2025-3-23 20:57 作者: Exposition 時(shí)間: 2025-3-23 22:13
https://doi.org/10.1057/9780230501737on and also the graph matching could be reduced. We present a consensus method which, given two correspondences between two pairs of attributed graphs generated by separate entities and with different attribute domains, enounces a final correspondence consensus considering the existence of outliers.作者: 釘牢 時(shí)間: 2025-3-24 06:03 作者: Peculate 時(shí)間: 2025-3-24 10:11
https://doi.org/10.1007/978-3-322-88117-52 algorithm that enable it to compete with more recently proposed graph matching techniques. Finally, we evaluate the effectiveness of these enhancement by comparing the matching performance both with the original VF2 and with several recent algorithms, using both the widely known MIVIA graph databa作者: ANTI 時(shí)間: 2025-3-24 13:59
Graph-Based Representations in Pattern Recognition作者: antiquated 時(shí)間: 2025-3-24 16:14
Approximation of Graph Edit Distance in Quadratic Timeoblem (LSAP). The optimal solution for this simplified GED problem can be computed in cubic time and is eventually used to derive a suboptimal solution for the original GED problem. Yet, for large scale graphs and/or large scale graph sets the cubic time complexity remains a severe handicap of this 作者: 深淵 時(shí)間: 2025-3-24 19:07 作者: 錯(cuò) 時(shí)間: 2025-3-25 01:58
An Entropic Edge Assortativity Measurelay a vital role in the structural properties of complex networks. Most of the existing assortativity measures have been developed on the basis of vertex degree information. However, there is a significant amount of additional information residing in the edges in a network, such as the edge directio作者: 走調(diào) 時(shí)間: 2025-3-25 06:39
A Subpath Kernel for Learning Hierarchical Image Representationssuch kernels have been successfully applied to various domains such as nature language processing and bioinformatics, they mostly concentrate on ordered trees and whose nodes are described by symbolic data. Meanwhile, hierarchical representations have gained increasing interest to describe image con作者: Intact 時(shí)間: 2025-3-25 08:09 作者: NORM 時(shí)間: 2025-3-25 13:33 作者: Talkative 時(shí)間: 2025-3-25 16:39
Incremental Embedding Within a Dissimilarity-Based Frameworky with a few set of machine learning methods. This last decade has seen majors advancements aiming to link these two fields. The two majors research fields in this direction concern the design of new graph and string kernels and different explicit embedding schemes of structural data. Explicit embed作者: 山崩 時(shí)間: 2025-3-25 21:54
A First Step Towards Exact Graph Edit Distance Using Bipartite Graph Matching an optimal assignment of local graph structures which can be established in polynomial time. However, as this approach considers the local structural properties of the graphs only, it yields sub-optimal solutions that overestimate the true edit distance in general. Recently, several attempts for re作者: 過(guò)于光澤 時(shí)間: 2025-3-26 00:18 作者: 白楊魚 時(shí)間: 2025-3-26 07:07
Revisiting Volgenant-Jonker for Approximating Graph Edit Distancerted how the VJ algorithm can be tuned for this task. To this end, we revisit VJ and propose a series of refinements that improve both the speed and memory footprint without sacrificing accuracy in the GED approximation. We quantify the effectiveness of these optimisations by measuring distortion be作者: neolith 時(shí)間: 2025-3-26 10:10 作者: Carbon-Monoxide 時(shí)間: 2025-3-26 13:37
Kite Recognition by Means of Graph Matchingle on high-resolution satellite images. Identified at first in the Near East, their area of distribution is getting larger and larger. This wide distribution gives new dimensions in the interpretation of these structures. Consequently, a large scale recognition of kites will help archeologists to un作者: 形容詞 時(shí)間: 2025-3-26 19:39 作者: cunning 時(shí)間: 2025-3-26 23:41 作者: 癡呆 時(shí)間: 2025-3-27 04:40
Improving Hausdorff Edit Distance Using Structural Node Contextecent years. The Hausdorff edit distance is a quadratic-time matching procedure for labeled graphs which reduces the edit distance to a correspondence problem between local substructures. In its original formulation, nodes and their adjacent edges have been considered as local substructures. In this作者: Infusion 時(shí)間: 2025-3-27 05:34
Learning Graph Model for Different Dimensions Image Matchingyperspectral images is a challenge task due to the high dimensional nature of the data. The matching task becomes more difficult when images with different dimensions, such as a hyperspectral image and an RGB image, have to be matched. In this paper, we address this problem by investigating structur作者: 公理 時(shí)間: 2025-3-27 11:29
VF2 Plus: An Improved version of VF2 for Biological GraphsNP-Complete problem. However, several algorithms exist that are fast enough on commonly encountered graphs so as to be practically usable; among them, for more than a decade VF2 has been the state of the art algorithm used to solve this problem and it is still the reference algorithm for many applic作者: 脆弱么 時(shí)間: 2025-3-27 15:34
Modelling of the Microfiltration Processoblem (LSAP). The optimal solution for this simplified GED problem can be computed in cubic time and is eventually used to derive a suboptimal solution for the original GED problem. Yet, for large scale graphs and/or large scale graph sets the cubic time complexity remains a severe handicap of this 作者: 使殘廢 時(shí)間: 2025-3-27 20:25
https://doi.org/10.1007/0-306-46878-6hat would represent that point-set according to some properties. Such a representation would allow us to match two objects (graphs) by exploiting topological properties instead of solely relying on geometrical properties. The Delaunay triangulation is a common out off-the-shelf strategy to triangula作者: 表主動(dòng) 時(shí)間: 2025-3-28 00:50 作者: Carcinogenesis 時(shí)間: 2025-3-28 04:34
Modelling the Economy and the Environmentsuch kernels have been successfully applied to various domains such as nature language processing and bioinformatics, they mostly concentrate on ordered trees and whose nodes are described by symbolic data. Meanwhile, hierarchical representations have gained increasing interest to describe image con作者: PANT 時(shí)間: 2025-3-28 10:06
https://doi.org/10.1007/978-3-030-52414-2ion can lead to substantial loss of information. Hypergraph representations, on the other hand, allow vertices to be multiply connected by hyperedges and can hence capture multiple or higher order relationships among features. Due to their effectiveness in representing multiple relationships, in thi作者: foliage 時(shí)間: 2025-3-28 12:52 作者: 漫不經(jīng)心 時(shí)間: 2025-3-28 15:12 作者: 愛了嗎 時(shí)間: 2025-3-28 21:40 作者: 否決 時(shí)間: 2025-3-29 02:42 作者: muscle-fibers 時(shí)間: 2025-3-29 06:57
https://doi.org/10.1007/978-1-4020-4479-3rted how the VJ algorithm can be tuned for this task. To this end, we revisit VJ and propose a series of refinements that improve both the speed and memory footprint without sacrificing accuracy in the GED approximation. We quantify the effectiveness of these optimisations by measuring distortion be作者: HAIRY 時(shí)間: 2025-3-29 07:49 作者: 破譯密碼 時(shí)間: 2025-3-29 15:07
https://doi.org/10.1007/978-3-540-71453-8le on high-resolution satellite images. Identified at first in the Near East, their area of distribution is getting larger and larger. This wide distribution gives new dimensions in the interpretation of these structures. Consequently, a large scale recognition of kites will help archeologists to un作者: synchronous 時(shí)間: 2025-3-29 15:35
https://doi.org/10.1007/978-1-84628-374-1edges. Such a matching is often required in pattern recognition applications since graphs extracted from images are generally labeled with features vectors computed from raw data which are naturally subject to noise. This paper describes an extended version of a Binary Linear Program (BLP) for solvi作者: artifice 時(shí)間: 2025-3-29 23:33 作者: 鍍金 時(shí)間: 2025-3-30 02:08 作者: persistence 時(shí)間: 2025-3-30 04:18 作者: 蹣跚 時(shí)間: 2025-3-30 09:00
https://doi.org/10.1007/978-3-322-88117-5NP-Complete problem. However, several algorithms exist that are fast enough on commonly encountered graphs so as to be practically usable; among them, for more than a decade VF2 has been the state of the art algorithm used to solve this problem and it is still the reference algorithm for many applic作者: Mendacious 時(shí)間: 2025-3-30 12:31 作者: nugatory 時(shí)間: 2025-3-30 19:11
https://doi.org/10.1007/978-3-540-71453-8using a graph representation of the kites. We propose a similarity measure and a kite identification process that can highlights the preservation state of the kites. We also construct from real images a benchmark of kite graphs that can be used by other researchers.作者: 聯(lián)想 時(shí)間: 2025-3-30 20:44 作者: 決定性 時(shí)間: 2025-3-31 04:46
https://doi.org/10.1007/978-1-4471-0157-4 directly evaluated. This paper consists of two parts. First, we provide a graph database repository annotated with low level information like graph edit distances and their matching correspondences. Second, we propose a set of performance evaluation metrics to assess the performance of GED methods.作者: amyloid 時(shí)間: 2025-3-31 05:00
https://doi.org/10.1007/978-3-658-19409-3 on diverse graph data sets, we demonstrate that the proposed generalization of Hausdorff edit distance can significantly improve the accuracy of graph classification while maintaining low computational complexity.作者: Individual 時(shí)間: 2025-3-31 10:02 作者: ANT 時(shí)間: 2025-3-31 13:47
Approximation of Graph Edit Distance in Quadratic Time particular, we introduce several greedy assignment algorithms for approximating GED. In an experimental evaluation we show that there is great potential for further speeding up the GED computation. Moreover, we empirically confirm that the distances obtained by this procedure remain sufficiently accurate for graph based pattern classification.作者: plasma-cells 時(shí)間: 2025-3-31 17:53 作者: Prologue 時(shí)間: 2025-4-1 01:17
