書目名稱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é)科排名
作者: exigent 時間: 2025-3-22 00:17 作者: 假裝是你 時間: 2025-3-22 04:05 作者: Sarcoma 時間: 2025-3-22 06:40
https://doi.org/10.1007/978-3-663-04923-4s. One of its main constraints is that it requires an adequate definition of edit costs, which are application dependent. These costs eventually determine which graphs are considered similar or not in a concrete application. Several methods have been presented to learn these costs to avoid manually 作者: transdermal 時間: 2025-3-22 12:05
Herwart Opitz,Johannes Bielefeldeen presented. Nevertheless, these algorithms usually cannot be used in real applications due to runtime restrictions. For this reason, other graph-matching algorithms have also been used that compute an approximation of the graph correspondence with lower runtime. Clearly, in a real application, th作者: 一大塊 時間: 2025-3-22 16:17
https://doi.org/10.1007/978-3-663-04924-1e to adapt their size and structure to the individual handwriting and represent binary relationships that might exist within the handwriting. We observe an increasing number of graph-based keyword spotting frameworks in the last years. In general, keyword spotting allows to retrieve instances of an 作者: 一大塊 時間: 2025-3-22 20:44 作者: nascent 時間: 2025-3-22 22:38 作者: 干旱 時間: 2025-3-23 04:59
https://doi.org/10.1007/978-3-663-02705-8lasses according to their reported biological functions. The goal of this database is to provide a platform for investigating the classification of RNA using graph-based methods. The molecules are represented by graphs representing the sequence and base-pairs of the RNA, with a number of labelling s作者: INTER 時間: 2025-3-23 07:45 作者: Cabg318 時間: 2025-3-23 13:03 作者: TEN 時間: 2025-3-23 16:08 作者: 無孔 時間: 2025-3-23 18:46 作者: packet 時間: 2025-3-23 23:24
Models and Methods of Magnetotelluricsuch surfaces can be efficiently represented by the pair of dual plane graphs: neighborhood (primal) graph and its dual. By defining orientation of edges in the primal graph and use of Local Binary Patters (LBPs), we can categorize the vertices corresponding to the pixel into critical (maximum, minim作者: 眉毛 時間: 2025-3-24 04:34 作者: 浮雕 時間: 2025-3-24 09:48 作者: 輕率的你 時間: 2025-3-24 11:40
Amit Kumar Tripathi,Abhishek Kumar Singhtunately, common graph coloring strategies usually focus on minimizing the number of colors without any concern for the sizes of each color class, thus producing highly skewed color class distributions. However, to guarantee efficiency in parallel computations, but also in other application contexts作者: exorbitant 時間: 2025-3-24 15:39 作者: interpose 時間: 2025-3-24 22:41 作者: 邪惡的你 時間: 2025-3-24 23:52 作者: Limerick 時間: 2025-3-25 06:29
Experimental Evaluation of Subgraph Isomorphism Solvers,f a pattern graph into a target graph. In the pattern recognition community, the most well-known SI solvers are VF2, VF3, and RI. SI is also widely studied in the constraint programming community, and many constraint-based SI solvers have been proposed since Ullman, such as LAD and Glasgow, for exam作者: 聯(lián)想記憶 時間: 2025-3-25 09:18
GEDLIB: A C++ Library for Graph Edit Distance Computation,resent GEDLIB, a C++ library for exactly or approximately computing .. Many existing algorithms for . are already implemented in GEDLIB. Moreover, GEDLIB is designed to be easily extensible: for implementing new edit cost functions and . algorithms, it suffices to implement abstract classes containe作者: 木訥 時間: 2025-3-25 13:56 作者: dissolution 時間: 2025-3-25 17:24
Sub-optimal Graph Matching by Node-to-Node Assignment Classification,een presented. Nevertheless, these algorithms usually cannot be used in real applications due to runtime restrictions. For this reason, other graph-matching algorithms have also been used that compute an approximation of the graph correspondence with lower runtime. Clearly, in a real application, th作者: ILEUM 時間: 2025-3-25 20:07
Cross-Evaluation of Graph-Based Keyword Spotting in Handwritten Historical Documents,e to adapt their size and structure to the individual handwriting and represent binary relationships that might exist within the handwriting. We observe an increasing number of graph-based keyword spotting frameworks in the last years. In general, keyword spotting allows to retrieve instances of an 作者: 煞費苦心 時間: 2025-3-26 01:45 作者: FECK 時間: 2025-3-26 07:44
Solving the Graph Edit Distance Problem with Variable Partitioning Local Search,oblem. This paper presents an adapted version of . (VPLS) matheuristic for solving the GED problem. The main idea in VPLS is to perform local searches in the solution space of a . (MILP). A local search is done in a small neighborhood defined based on a set of special variables. Those special variab作者: CIS 時間: 2025-3-26 09:54 作者: 仲裁者 時間: 2025-3-26 13:26
Event Prediction Based on Unsupervised Graph-Based Rank-Fusion Models,nks of a query, defined according to different criteria, into a graph. Later, we embed the generated graph into a feature space, creating fusion vectors. These vectors are then used to train a predictor to determine if an input (even multimodal) object refers to an event or not. Performed experiment作者: hegemony 時間: 2025-3-26 16:49
Generalized Median Graph via Iterative Alternate Minimizations, for simple classes of graphs. In this paper, we propose an efficient approach based on block coordinate descent to compute a generalized median graph from a set of graphs. This approach relies on a clear definition of the optimization process and handles labeling on both edges and nodes. This itera作者: 拖債 時間: 2025-3-27 00:20
An Hypergraph Data Model for Expert Finding in Multimedia Social Networks,ular social media networks – particularly interesting for . (SNA) applications – that combine information on users, belonging to one or more social communities, together with all the multimedia contents that can be generated and used in the related environments. In this work, we present a novel . te作者: Verify 時間: 2025-3-27 04:26 作者: 水土 時間: 2025-3-27 07:56
Congratulations! Dual Graphs Are Now Orientated!,uch surfaces can be efficiently represented by the pair of dual plane graphs: neighborhood (primal) graph and its dual. By defining orientation of edges in the primal graph and use of Local Binary Patters (LBPs), we can categorize the vertices corresponding to the pixel into critical (maximum, minim作者: osteopath 時間: 2025-3-27 11:49 作者: 類型 時間: 2025-3-27 17:14 作者: 形容詞詞尾 時間: 2025-3-27 18:26 作者: 口味 時間: 2025-3-28 00:13
An Attributed Graph Embedding Method Using the Tree-Index Algorithm,ive of strengthening the vertex labels. For each iteration of the tree-index method, we compute a probability distribution in terms of the frequency of the strengthened labels. With each probability distribution, we compute a Shannon entropy to measure the uncertainty of the strengthened labels. For作者: 故意釣到白楊 時間: 2025-3-28 02:50 作者: 最小 時間: 2025-3-28 09:34
Network Time Series Analysis Using Transfer Entropy,nformation theoretic tools for characterising information flow between time series, and how to infer networks representing time series data. We explore two different approaches. The first uses transfer entropy as a means of characterising information flow and measures network similarity using Jensen作者: agitate 時間: 2025-3-28 11:21 作者: Intentional 時間: 2025-3-28 17:43
Experimental Evaluation of Subgraph Isomorphism Solvers,straint-based solvers, appear to be challenging for VF2 and VF3. In this paper, we widen this study by considering a large test suite coming from eight benchmarks. We show that, as expected for an NP-complete problem, the solving time of an instance does not depend on its size, and that some small i作者: Nonconformist 時間: 2025-3-28 18:55
A Database and Evaluation for Classification of RNA Molecules Using Graph Methods,m used in bioinformatics for DNA and RNA comparison, and demonstrate the superiority of graph kernels even on a string representation. The highest classification rate is obtained by the WL-OA algorithm using base labels and base-pair connections.作者: 傾聽 時間: 2025-3-28 23:45 作者: 易改變 時間: 2025-3-29 03:31 作者: FRAX-tool 時間: 2025-3-29 08:22
https://doi.org/10.1007/978-3-663-02705-8m used in bioinformatics for DNA and RNA comparison, and demonstrate the superiority of graph kernels even on a string representation. The highest classification rate is obtained by the WL-OA algorithm using base labels and base-pair connections.作者: Tailor 時間: 2025-3-29 13:11
https://doi.org/10.1007/978-1-4899-3113-9isomorphism, namely VF3P, based on a redesign of the well known algorithm VF3. The effectiveness of VF3P has been experimentally proven on a publicly available dataset of very large graphs, confirming that the algorithm is able to efficiently scale w.r.t. the number of used CPUs without affecting th作者: 凝乳 時間: 2025-3-29 18:55
https://doi.org/10.1007/978-3-663-04923-4oposed optimisation functions. We conclude that these functions return different edit costs and therefore, they have to be considered application dependent and not only a technicality of the method, as it has been considered so far.作者: 打算 時間: 2025-3-29 23:12
https://doi.org/10.1007/978-3-663-04924-1storical documents. We observe a direct relationship between parameter settings and the actual handwriting. We also propose different ensemble strategies that allow to keep up with individually optimised systems without . knowledge of a certain manuscript. Such a system can potentially be applied to new documents without prior optimisation.作者: 起來了 時間: 2025-3-30 01:55
Models and Methods of Magnetotelluricsotone cubic interpolation. In this paper, we define orientation of edges in the dual graph such that it remains consistent with the primal graph. Further we deliver the necessary and sufficient conditions for merging of two adjacent slope regions.作者: locus-ceruleus 時間: 2025-3-30 07:31 作者: 積習(xí)已深 時間: 2025-3-30 09:11
https://doi.org/10.1007/978-3-319-05035-5based approach with a new measure of inadmissibility for edges based on neighbourhood analysis. Frames closest to the centroid of each cluster are used to build the summary. Experimental comparisons on two standard datasets clearly indicate the advantage of our solution.作者: 大范圍流行 時間: 2025-3-30 15:01 作者: 尊重 時間: 2025-3-30 18:42 作者: 外表讀作 時間: 2025-3-30 23:14
Cross-Evaluation of Graph-Based Keyword Spotting in Handwritten Historical Documents,storical documents. We observe a direct relationship between parameter settings and the actual handwriting. We also propose different ensemble strategies that allow to keep up with individually optimised systems without . knowledge of a certain manuscript. Such a system can potentially be applied to new documents without prior optimisation.作者: Diastole 時間: 2025-3-31 02:50
Congratulations! Dual Graphs Are Now Orientated!,otone cubic interpolation. In this paper, we define orientation of edges in the dual graph such that it remains consistent with the primal graph. Further we deliver the necessary and sufficient conditions for merging of two adjacent slope regions.作者: 改進(jìn) 時間: 2025-3-31 07:43 作者: Aviary 時間: 2025-3-31 10:42
A Graph-Theoretic Framework for Summarizing First-Person Videos,based approach with a new measure of inadmissibility for edges based on neighbourhood analysis. Frames closest to the centroid of each cluster are used to build the summary. Experimental comparisons on two standard datasets clearly indicate the advantage of our solution.作者: 狂亂 時間: 2025-3-31 17:19 作者: AMBI 時間: 2025-3-31 20:43 作者: 高度表 時間: 2025-4-1 01:33
https://doi.org/10.1007/978-3-662-02065-4 of a network can be achieved. We apply the resulting method to fMRI activation networks to evaluate the qualitative and quantitative characterisations. The entropic measurement turns out to be an effective tool to identify the differences in the structure of Alzheimer’s disease by selecting the most salient anatomical brain regions.作者: narcissism 時間: 2025-4-1 05:46 作者: Optimum 時間: 2025-4-1 08:02 作者: Anthology 時間: 2025-4-1 13:37
