检索结果-内蒙古大学图书馆

10th IAPR-TC-15 international workshop on graph-based representations in pattern recognition, GbRPR 2015

ISBN: (纸本)9783319182230

the proceedings contain 36 papers. the special focus in this conference is on graph-based Representation, graph Matching, graph Clustering and graph-based Applications. the topics include: Approximation of graph edit distance in quadratic time;data graph formulation as the minimum-weight maximum-entropy problem;an entropic edge assortativity measure;a subpath kernel for learning hierarchical image representations;coupled-feature hypergraph representation for feature selection;reeb graphs through local binary patterns;incremental embedding within a dissimilarity-based framework;a first step towards exact graph edit distance using bipartite graph matching;consensus of two graph correspondences through a generalisation of the bipartite graph matching;revisiting Volgenant-Jonker for approximating graph edit distance;a hypergraph matching framework for refining multi-source feature correspondences;a tool for solving substitution-tolerant subgraph isomorphism;a graph database repository and performance evaluation metrics for graph edit distance;learning graph model for different dimensions image matching;report on the first contest on graph matching algorithms for pattern search in biological databases;large-scale graph indexing using binary embeddings of node contexts;on the influence of node centralities on graph edit distance for graph classification;a quantum Jensen-Shannon graph kernel using discrete-time quantum walks;density based cluster extension and dominant sets clustering;salient object segmentation from stereoscopic images;causal video segmentation using superseeds and graph matching;fast minimum spanning tree based clustering algorithms on local neighborhood graph and graph based lymphatic vessel wall localisation and tracking.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimal clustering with missing values

引用

BMC BIOINFORMATICS 2019年第12期20卷 321-321页

作者： Boluki, Shahin Dadaneh, Siamak Zamani Qian, Xiaoning Dougherty, Edward R. Texas A&M Univ Dept Elect & Comp Engn MS3128 TAMU College Stn TX 77843 USA TEES AgriLife Ctr Bioinformat & Genom Syst Engn College Stn TX 77843 USA

BackgroundMissing values frequently arise in modern biomedical studies due to various reasons, including missing tests or complex profiling technologies for different omics measurements. Missing values can complicate the application of clustering algorithms, whose goals are to group points based on some similarity criterion. A common practice for dealing with missing values in the context of clustering is to first impute the missing values, and then apply the clustering algorithm on the completed *** consider missing values in the context of optimal clustering, which finds an optimal clustering operator with reference to an underlying random labeled point process (RLPP). We show how the missing-value problem fits neatly into the overall framework of optimal clustering by incorporating the missing value mechanism into the random labeled point process and then marginalizing out the missing-value process. In particular, we demonstrate the proposed framework for the Gaussian model with arbitrary covariance structures. Comprehensive experimental studies on both synthetic and real-world RNA-seq data show the superior performance of the proposed optimal clustering with missing values when compared to various clustering *** clustering with missing values obviates the need for imputation-based pre-processing of the data, while at the same time possessing smaller clustering errors.

关键词： Clustering Missing data Optimal design pattern recognition

来源：评论

学校读者我要写书评

暂无评论

A Survey on Applications of Bipartite graph Edit Distance 11th

A Survey on Applications of Bipartite Graph Edit Distance

引用

11th IAPR-TC15 international workshop on graph-based representations in pattern recognition (GbRPR)

作者： Stauffer, Michael Tschachtli, thomas Fischer, Andreas Riesen, Kaspar Univ Appl Sci & Arts Northwestern Switzerland Inst Informat Syst Riggenbachstr 16 CH-4600 Olten Switzerland Univ Fribourg Dept Informat CH-1700 Fribourg Switzerland Univ Appl Sci & Arts Western Switzerland Inst Complex Syst CH-1705 Fribourg Switzerland Univ Pretoria Dept Informat Pretoria South Africa

ISBN: (纸本)9783319589619;9783319589602

About ten years ago, a novel graph edit distance framework based on bipartite graph matching has been introduced. this particular framework allows the approximation of graph edit distance in cubic time. this, in turn, makes the concept of graph edit distance also applicable to larger graphs. In the last decade the corresponding paper has been cited more than 360 times. Besides various extensions from the methodological point of view, we also observe a great variety of applications that make use of the bipartite graph matching framework. the present paper aims at giving a first survey on these applications stemming from six different categories (which range from document analysis, over biometrics to malware detection).

关键词： Applications of bipartite graph matching graph-based pattern representations

来源：评论

学校读者我要写书评

暂无评论

An analysis of the feasibility of graph compression techniques for indexing regular path qeries 5

An analysis of the feasibility of graph compression techniqu...

引用

5th international workshop on graph Data Management Experiences and Systems, GRADES 2017

作者： Tetzel, Frank Voigt, Hannes Paradies, Marcus Lehner, Wolfgang Dresden Database Systems Group Technische Universität Dresden Germany SAP SE Germany

ISBN: (纸本)9781450350389

Regular path queries (RPQs) are a fundamental part of recent graph query languages like SPARQL and PGQL. they allow the definition of recursive path structures through regular expressions in a declarative pattern matching environment. We study the use of the K2-tree graph compression technique to materialize RPQ results with low memory consumption for indexing. Compact index representations enable the efficient storage of multiple indexes for varying RPQs. © 2017 ACM.

关键词： pattern matching

来源：评论

学校读者我要写书评

暂无评论

Cypher-based graph pattern matching in gradoop 5

Cypher-based graph pattern matching in gradoop

引用

5th international workshop on graph Data Management Experiences and Systems, GRADES 2017

作者： Junghanns, Martin Kießling, Max Averbuch, Alex Petermann, Andre Rahm, Erhard University of Leipzig and ScaDS Dresden/Leipzig Germany

ISBN: (纸本)9781450350389

graph pattern matching is an important and challenging operation on graph data. Typical use cases are related to graph analytics. Since analysts are otten non-programmers, a graph system will only gain acceptance, if there is a comprehensible way to declare pattern matching queries. However, respective query languages are currently only supported by graph databases but not by distributed graph processing systems. To enable pattern matching on a large scale, we implemented the declarative graph query language Cypher within the distributed graph analysis platform Gradoop. Using LDBC graph data, we show that our query engine is scalable for operational as well as analytical workloads. tte implementation is open-source and easy to extend for further research. © 2017 ACM.

关键词： pattern matching

来源：评论

学校读者我要写书评

暂无评论

Unsupervised and scalable algorithm for learning node representations 5

Unsupervised and scalable algorithm for learning node repres...

引用

5th international Conference on Learning representations, ICLR 2017

作者： Pimentel, Tiago Veloso, Adriano Ziviani, Nivio Brazil Kunumi Brazil

Representation learning is one of the foundations of Deep Learning and allowed big improvements on several Machine Learning fields, such as Neural Machine Translation, Question Answering and Speech recognition. Recent works have proposed new methods for learning representations for nodes and edges in graphs. In this work, we propose a new unsupervised and efficient method, called here Neighborhood based Node Embeddings (NBNE), capable of generating node embeddings for very large graphs. this method is based on SkipGram and uses nodes' neighborhoods as contexts to generate representations. NBNE achieves results comparable or better than state-of-the-art feature learning algorithms in three different datasets and, differently from our main baseline (Node2Vec), which needs to have its parameters tuned in a validation set, is completely unsupervised. © 5th international Conference on Learning representations, ICLR 2017 - workshop Track Proceedings. All Rights Reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

5th international workshop on graph Data Management Experiences and Systems, GRADES 2017 - Co-located with SIGMOD/PODS 2017

5th International Workshop on Graph Data Management Experien...

引用

5th international workshop on graph Data Management Experiences and Systems, GRADES 2017

ISBN: (纸本)9781450350389

the proceedings contain 13 papers. the topics discussed include: SPARQL graph pattern processing with Apache Spark;entropy-based selection of graph cuboids;cypher-based graph pattern matching in Gradoop;Cytosm: declarative property graph queries without data migration;can modern graph processing engines run concurrent queries?;towards a property graph generator for benchmarking;PGX.D Async : a scalable distributed graph pattern matching engine;Granula: towards fine-grained performance analysis of large-scale graph processing platforms;graphGen: adaptive graph extraction and analytics over relational databases;extending SQL for computing shortest paths;do we need specialized graph databases? benchmarking real-time social networking applications;and finding top k shortest simple paths with improved space efficiency.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Using PEGs for automatic extraction of memory access descriptions to support data-parallel pattern recognition 17

Using PEGs for automatic extraction of memory access descrip...

引用

8th workshop on Parallel Programming and Run-Time Management Techniques for Many-Core Architectures and 6th workshop on Design Tools and Architectures For Multicore Embedded Computing Platforms, PARMA-DITAM 2017

作者： Auras-Rodríguez, María H. Zimmermann, Anthony Ascheid, Gerd Leupers, Rainer Institute for Communication Technologies and Embedded Systems RWTH Aachen University Aachen52056 Germany

ISBN: (纸本)9781450348775

In this paper, we present a novel approach that assists in the task of data-parallel pattern recognition. the classification of program code into parallel patterns relies mainly in the extraction of characteristics that describe memory access operations. Our tool automatically generates static decidable memory access characterizations using a Program Expression graph (PEG) representation of input programs. We analyze the main properties of PEGs that favor the corresponding extraction algorithm in comparison to other input representations. Additionally, we demonstrate the effectiveness of our proposed method using the PolyBench kernels for the recognition of the data-parallel patterns that drive the Bones skeleton-based parallellizing compiler, targeting as case study modern embedded platforms (i.e. Keystone II and Parallella Board). © 2017 ACM.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

A Novel 2D Contour Description Generalized Curvature Scale Space 6th

A Novel 2D Contour Description Generalized Curvature Scale S...

引用

6th international workshop on representations, Analysis and recognition of Shape and Motion from Imaging Data (RFMI)

作者： Benkhlifa, Ameni Ghorbel, Faouzi Univ Manouba Natl Sch Comp Sci Grift Grp Cristal Lab Manouba 2010 Tunisia

ISBN: (纸本)9783319606545;9783319606538

Here, we intend to propose a 2D contour descriptor that we call Generalized Curvature Scale Space (GCSS) based on the iso-curvature levels, and the curvature scale space (CSS) descriptor. We start by computing the curvature in different scales and extract the points which have the same curvature values as the maximums in each scale. Each CSS image is represented by a set of key points. the Dynamic Time Warping (DTW) similarity measure is used. We reach a significant rate in image recognition using two data sets (HMM GPD and MPEG7 CE Shape-1 Part-B set).

关键词： pattern recognition Contour 2D Curvature Iso-curvature CSS

来源：评论

学校读者我要写书评

暂无评论

36th international Conference on Conceptual Modeling, ER 2017 held in Conjuction with the 3rd international workshop on Modeling for Ambient Assistance and Healthy Ageing, AHA 2017, 6th international workshop on Modeling and Management of Big Data, MoBiD 2017, 4th international workshop on Conceptual Modeling in Requirements and Business Analysis, MREBA 2017, 5th international workshop on Ontologies and Conceptual Modeling, OntoCom 2017 and 4th workshop on Quality of Models and Models of Quality, QMMQ 2017

36th International Conference on Conceptual Modeling, ER 201...

引用

36th international Conference on Conceptual Modeling, ER 2017 held in Conjuction with the 3rd international workshop on Modeling for Ambient Assistance and Healthy Ageing, AHA 2017, 6th international workshop on Modeling and Management of Big Data, MoBiD 2017, 4th international workshop on Conceptual Modeling in Requirements and Business Analysis, MREBA 2017, 5th international workshop on Ontologies and Conceptual Modeling, OntoCom 2017 and 4th workshop on Quality of Models and Models of Quality, QMMQ 2017

ISBN: (纸本)9783319706245

the proceedings contain 22 papers. the special focus in this conference is on Conceptual Modeling. the topics include: Towards an ontology for strategic decision making: the Case of quality in rapid software development projects;detecting bad smells of refinement in goal-oriented requirements analysis;Requirements engineering for data warehouses (RE4DW): From strategic goals to multidimensional model;towards formal strategy analysis with goal models and semantic web technologies;assisting process modeling by identifying business process elements in natural language texts;Using multidimensional concepts for detecting problematic Sub-KPIs in analysis systems;automatically annotating business process models with ontology concepts at design-time;OPL-ML: A modeling language for representing ontology pattern languages;Evaluating quality issues in BPMN models by extending a technical debt software platform;data modelling for dynamic monitoring of vital signs: Challenges and perspectives;utility-driven data management for data-intensive applications in fog environments;Assessing the positional planimetric accuracy of DBpedia georeferenced resources;Assessing the completeness evolution of DBpedia: A case study;towards care systems using model-driven adaptation and monitoring of autonomous multi-clouds;clustering event traces by behavioral similarity;goal-based selection of visual representations for big data analytics;A four V’s design approach of NoSQL graph databases;towards efficient and informative omni-channel customer relationship management;stream clustering of chat messages with applications to twitch streams;towards consistent demarcation of enterprise design domains.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：