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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

36 篇 会议
2 篇 期刊文献
1 册 图书

馆藏范围

39 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

34 篇 工学
- 30 篇 计算机科学与技术...
- 20 篇 软件工程
- 6 篇 信息与通信工程
- 2 篇 动力工程及工程热...
- 2 篇 建筑学
- 2 篇 生物工程
- 1 篇 材料科学与工程（可...
- 1 篇 电气工程
- 1 篇 控制科学与工程
- 1 篇 土木工程
- 1 篇 水利工程
- 1 篇 测绘科学与技术
- 1 篇 交通运输工程
- 1 篇 农业工程
- 1 篇 生物医学工程（可授...
18 篇 理学
- 17 篇 数学
- 5 篇 统计学（可授理学、...
- 2 篇 物理学
- 2 篇 生物学
- 1 篇 化学
- 1 篇 系统科学
7 篇 医学
- 7 篇 临床医学
6 篇 管理学
- 6 篇 图书情报与档案管...
- 1 篇 管理科学与工程(可...
1 篇 法学
- 1 篇 社会学
1 篇 农学
- 1 篇 作物学

主题

3 篇 pattern recognit...
3 篇 artificial intel...
2 篇 support vector m...
2 篇 pattern matching
2 篇 graphic methods
2 篇 graph neural net...
2 篇 clustering algor...
1 篇 internet of thin...
1 篇 image fusion
1 篇 aggregates
1 篇 binding energy
1 篇 database filteri...
1 篇 computational co...
1 篇 magnetic resonan...
1 篇 trees (mathemati...
1 篇 image segmentati...
1 篇 algorithms
1 篇 subgraph isomorp...
1 篇 computer graphic...
1 篇 region-adjacency...

机构

4 篇 univ bern dept c...
2 篇 institute of com...
2 篇 univ ca foscari ...
1 篇 dipartimento di ...
1 篇 research group a...
1 篇 institute for in...
1 篇 normandie univ e...
1 篇 universitat poli...
1 篇 department of in...
1 篇 dipartimento di ...
1 篇 ben gurion univ ...
1 篇 faculty of mathe...
1 篇 université de ly...
1 篇 cnrs umr5516 f-4...
1 篇 dipartimento di ...
1 篇 pattern recognit...
1 篇 univ sherbrooke ...
1 篇 university of to...
1 篇 school of artifi...
1 篇 department of al...

作者

4 篇 bunke h
3 篇 hancock edwin r.
3 篇 kropatsch walter...
2 篇 jiang xiaoyi
2 篇 glantz r
2 篇 riesen kaspar
2 篇 pelillo m
2 篇 brun luc
1 篇 solnon christine
1 篇 kiouche abd erra...
1 篇 glantz roland
1 篇 ferrer miquel
1 篇 e cruz rafael me...
1 篇 haxhimusa yll
1 篇 behanova andrea
1 篇 foggia pasquale
1 篇 fischer s
1 篇 guidobaldi c.
1 篇 rossi luca
1 篇 laurent christop...

语言

39 篇 英文

检索条件"任意字段=4th IAPR International Workshop on Graph Based Representations in Pattern Recognition, GbRPR 2003"

共 39 条记录，以下是11-20 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Constructing stochastic pyramids by MIDES – maximal independent directed edge set

Constructing stochastic pyramids by MIDES – maximal indepen...

引用

4th iapr international workshop on graph based representations in pattern recognition, gbrpr 2003

作者： Haxhimusa, Yll Glantz, Roland Kropatsch, Walter G. Pattern Recognition and Image Processing Group 183/2 Institute for Computer Aided Automation Vienna University of Technology Favoritenstrasse 9 ViennaA-1040 Austria Dipartimento di Informatica Università di Ca’ Foscari di Venezia Via Torino 155 MestreVE30172 Italy

ISBN: (纸本)354040452X

We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than 2.0. thus, the new method yields a higher reduction factor than the stochastic decimation algorithm (MIS) and maximal independent edge set (MIES), in all tests. this means the number of vertices in the subgraph induced by any set of contractible edges is reduced to half or less by a single parallel contraction. the lower bound of the reduction factor becomes crucial with large images. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Detecting Abnormal Communication patterns in IoT Networks Using graph Neural Networks 13th

Detecting Abnormal Communication Patterns in IoT Networks U...

引用

13th iapr-TC-15 international workshop on graph-based representations in pattern recognition, gbrpr 2023

作者： Carletti, Vincenzo Foggia, Pasquale Vento, Mario Department of Information Engineering Electrical Engineering and Applied Mathematics University of Salerno Fisciano Italy

ISBN: (纸本)9783031427947

Nowadays, millions of Internet of things (IoT) devices communicate over the Internet, thus becoming potential targets for cyberattacks. Due to the limited hardware capabilities of these devices, host-based countermeasures are unlikely to be deployed on them, making network traffic analysis the only reasonable way to detect malicious activities. In this paper, we face the problem of identifying abnormal communications in IoT networks using graph-based anomaly detection methods. Although anomaly detection has already been applied to graph-based data, most existing methods have been used for static graphs, with the aim of detecting anomalous nodes. In our case, the graphs represent snapshots of the network traffic, and change with time. In this paper we compare different graph-based methods, and different graph representations of the network traffic, using two large datasets of real IoT data. © 2023, the Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Comparing string representations and distances in a natural images classification task

Comparing string representations and distances in a natural ...

引用

5th iapr international workshop on graph-based representations in pattern recognition, gbrpr 2005

作者： Ros, Julien Laurent, Christophe Jolion, Jean-Michel Simand, Isabelle France Telecom R and D TECH IRIS 4 rue du Clos Courtel 35512 Cesson Sevigne Cedex France LIRIS PRE CNRS 3672 INSA INSA Lyon 9621 Villeurbanne cedex France

this paper shows how strings can be used in a natural images classification task. We propose to build an attributed string from a set of regions of interest detected thanks to an interest point detector. these salient zones are characterized by local signatures describing singularities and they are linked by using graph seriation algorithms and perceptual methods. Once each image is represented by a string of signatures, we propose to use string-based edit distances and an ordered histograms-based distance in order to perform the classification task. Experiments have shown that whereas seriation algorithms give approximately the same results, the ordered histogram based distance is more efficient for the considered application. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Image analysis

来源：评论

学校读者我要写书评

暂无评论

A subpath kernel for learning hierarchical image representations 10

A subpath kernel for learning hierarchical image representat...

引用

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

作者： Cui, Yanwei Chapel, Laetitia Lefèvre, Sébastien University Bretagne-Sud Vannes56000 France

ISBN: (纸本)9783319182230

Tree kernels have demonstrated their ability to deal with hierarchical data, as the intrinsic tree structure often plays a discriminative role. While such 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 content. this is particularly true in remote sensing, where such representations allow for revealing different objects of interest at various scales through a tree structure. However, the induced trees are unordered and the nodes are equipped with numerical features. In this paper, we propose a new structured kernel for hierarchical image representations which is built on the concept of subpath kernel. Experimental results on both artificial and remote sensing datasets show that the proposed kernel manages to deal with the hierarchical nature of the data, leading to better classification rates. © Springer international Publishing Switzerland 2015.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

graph edit distance with node splitting and merging, and its application to diatom identification

Graph edit distance with node splitting and merging, and its...

引用

4th international workshop on graph based representations in pattern recognition

作者： Ambauen, R Fischer, S Bunke, H Univ Bern Dept Comp Sci CH-3012 Bern Switzerland

ISBN: (纸本)354040452X

A new graph matching scheme based on an extended set of edit operations, which include the splitting and merging of nodes, is proposed in this paper. this scheme is useful in applications where the nodes of the considered graphs represent regions extracted by some segmentation procedure from an image. To demonstrate the feasibility of the proposed method, its application to the automatic identification of diatoms (unicellular algae) is described.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Self-organizing graph edit distance

Self-organizing graph edit distance

引用

4th international workshop on graph based representations in pattern recognition

作者： Neuhaus, M Bunke, H Univ Bern Dept Comp Sci CH-3012 Bern Switzerland

ISBN: (纸本)354040452X

this paper addresses the issue of learning graph edit distance cost functions for numerically labeled graphs from a corpus of sample graphs. We propose a system of self-organizing maps representing attribute distance spaces that encode edit operation costs. the self-organizing maps are iteratively adapted to minimize the edit distance of those graphs that are required to be similar. To demonstrate the learning effect, the distance model is applied to graphs representing line drawings and diatoms.

关键词： Self organizing maps

来源：评论

学校读者我要写书评

暂无评论

A Polynomial Algorithm for Submap Isomorphism Application to Searching patterns in Images

A Polynomial Algorithm for Submap Isomorphism Application to...

引用

7th iapr-TC-15 international workshop on graph-based representations in pattern recognition, gbrpr 2009

作者： Damiand, Guillaume De La Higuera, Colin Janodet, Jean-Christophe Samuel, Émilie Solnon, Christine Université de Lyon France Université Lyon 1 LIRIS UMR5205 CNRS F-69622 France CNRS UMR5516 F-42023 Laboratoire Hubert Curien Université de Saint-Etienne - Jean Monnet France

ISBN: (纸本)3642021239

In this paper, we address the problem of searching for a pattern in a plane graph, i.e., a planar drawing of a planar graph. To do that, we propose to model plane graphs with 2-dimensional combinatorial maps, which provide nice data structures for modelling the topology of a subdivision of a plane into nodes, edges and faces. We define submap isomorphism, we give a polynomial algorithm for this problem, and we show how this problem may be used to search for a pattern in a plane graph. First experimental results show the validity of this approach to efficiently search for patterns in images. © 2009 Springer Berlin Heidelberg.

关键词： graph theory

来源：评论

学校读者我要写书评

暂无评论

theoretical analysis and experimental comparison of graph matching algorithms for database filtering

Theoretical analysis and experimental comparison of graph ma...

引用

4th international workshop on graph based representations in pattern recognition

作者： Irniger, C Bunke, H Univ Bern Dept Comp Sci CH-3012 Bern Switzerland

ISBN: (纸本)354040452X

In structural pattern recognition, an unknown pattern is often transformed into a graph that is matched against a database in order to find the most similar prototype in the database. graph matching is a powerful yet computationally expensive procedure. If the sample graph is matched against a large database of model graphs, the size of the database is introduced as an additional factor into the overall complexity of the matching process. Database filtering procedures are used to reduce the impact of this additional factor. In this paper we report the results of a basic study on the relation between filtering efficiency and graph matching algorithm performance, using different graph matching algorithms for isomorphism and subgraph-isomorphism.

关键词： graph isomorphism subgraph isomorphism database filtering

来源：评论

学校读者我要写书评

暂无评论

graph-based Deep Learning on the Swiss River Network 13th

Graph-Based Deep Learning on the Swiss River Network

引用

13th iapr-TC-15 international workshop on graph-based representations in pattern recognition, gbrpr 2023

作者： Fankhauser, Benjamin Bigler, Vidushi Riesen, Kaspar Institute of Computer Science University of Bern Bern Switzerland Institute for Optimisation and Data Analysis Bern University of Applied Sciences Biel Switzerland

ISBN: (纸本)9783031427947

Major European rivers have their sources in the Swiss Alps. Data from these rivers and their tributaries have been collected for decades with consistent quality. We use GIS data to extract the structure of each river and link this structure to 81 river water stations (that measure both water temperature and discharge). Since the water temperature of a river is strongly dependent on the air temperature, we also include 44 weather stations (which measure, for instance, air or soil temperature). based on this large data corpus, we present in this paper a novel graph representing the water network of Switzerland. Our goal is to accelerate the research of the complex relationships at the (Swiss) water bodies. In particular, we present different graph-based pattern recognition tasks that can be solved on the novel water body graph. In a first evaluation, we use graph-based methods to solve two of these tasks, outperforming current state-of-the-art systems by several percentage points. © 2023, the Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Water temperature

来源：评论

学校读者我要写书评

暂无评论

A new median graph algorithm

A new median graph algorithm

引用

4th international workshop on graph based representations in pattern recognition

作者： Hlaoui, A Wang, SR Univ Sherbrooke Dept Math & Informat Sherbrooke PQ J1K 2R1 Canada

ISBN: (纸本)354040452X

Median graph is an important new concept introduced to represent a set of graphs by a representative graph. Computing the median graph is an NP-Complete problem. In this paper, we propose an approximate algorithm for computing the median graph. Our algorithm performs in two steps. It first carries out a node reduction process using a clustering method to extract a subset of most representative node labels. It then searches for the median graph candidates from the reduced subset of node labels according to a deterministic strategy to explore the candidate space. Comparison with the genetic search based algorithm will be reported. this algorithm can be used to build a graph clustering algorithm.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共4页 << < 1 2 3 4 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：