Development of algorithms for the conception and the analysis of graphs and complex networks

开发图形和复杂网络的概念和分析算法

基本信息

  • 批准号:
    RGPIN-2015-04945
  • 负责人:
  • 金额:
    $ 1.6万
  • 依托单位:
  • 依托单位国家:
    加拿大
  • 项目类别:
    Discovery Grants Program - Individual
  • 财政年份:
    2019
  • 资助国家:
    加拿大
  • 起止时间:
    2019-01-01 至 2020-12-31
  • 项目状态:
    已结题

项目摘要

A graph is a mathematical object consisting of vertices connected by edges if necessary. Graphs are useful for modeling some situations or to facilitate the visualization of complex data. ******My research project is related to the graphs, namely the search graph having desired characteristics, the study of particular graphs and the representation of complex information using graphs. ******1. Searching for extreme graphs ******Since my Ph.D, I work on finding extreme graphs, graphs that have special properties. Besides allowing to identify mathematical properties of graphs or finding results in mathematical chemistry (molecules may be represented by graphs), this approach recently allowed one of my students during his Ph.D., to find a family of graphs that correspond to a robust telecommunication networks. We plan to continue in this direction and use optimization for the design of telecommunications networks. There are still relevant applications in that field, however I am now considering extending my research area to some other, related problems. ******2. The study of complex networks ******Complex networks, such as social networks are typically graphs of large size. The complex network analysis is primarily based on two aspects: the identification of important vertices and communities detection. Identification of important vertices is based upon the centrality and allows the identification of individuals who have a key role. An application may be the viral marketing problem where the goal is to identify influent individuals. Communities detection in a network is an application of clustering, an area where I work for years. ******3. The representation of complex information ******The last point, the representation of complex information, is an area in which I entered during a recent work on the representation of the writing process. This process includes a temporal component and a spatial one. Some programs allow the recording of the activity of a person while she writes with a word processor or by hand with a graphical tablet. The records yield a large amount of data that is difficult to analyse by a human. We found that such data may be modelled by a graph. This is a new representation technique that is perceived by linguists, psychologists and educationalists as an advance toward a better understanding of the phenomenon. There are reasons to believe that such a representation could be extended to other processes involving space and time, with possible applications in industrial engineering.
一个图是一个数学对象,它由必要时由边连接的顶点组成。图形对于建模某些情况或促进复杂数据的可视化非常有用。** 我的研究项目与图有关,即具有所需特征的搜索图,特定图的研究以及使用图表示复杂信息。*1.寻找极端图 ** 自从我获得博士学位以来,我一直致力于寻找极端图,即具有特殊性质的图。除了允许识别图形的数学属性或在数学化学中找到结果(分子可以用图形表示),这种方法最近允许我的一个学生在他的博士学位期间,找到对应于鲁棒电信网络的图族。我们计划继续朝着这个方向发展,并将优化用于电信网络的设计。在这个领域仍然有相关的应用,但是我现在正在考虑将我的研究领域扩展到其他一些相关的问题。2.复杂网络的研究 * 复杂网络,如社交网络,通常是大尺寸的图。复杂网络分析主要基于两个方面:重要节点的识别和社区检测。重要顶点的识别基于中心性,并允许识别具有关键作用的个体。一个应用程序可能是病毒式营销问题,其目标是识别影响力的个人。网络中的社区检测是聚类的一个应用,我在这个领域工作了多年。3.复杂信息的表征 ** 最后一点,复杂信息的表征,是我在最近的一项关于写作过程表征的工作中进入的一个领域。这一过程包括一个时间分量和一个空间分量。有些程序允许记录一个人用文字处理器或手写板书写时的活动。这些记录产生了大量难以由人类分析的数据。我们发现,这些数据可以用图来建模。这是一种新的表征技术,被语言学家、心理学家和教育学家认为是对这一现象更好理解的一种进步。有理由相信,这种表示法可以扩展到其他涉及空间和时间的过程,并可能在工业工程中应用。

项目成果

期刊论文数量(0)
专著数量(0)
科研奖励数量(0)
会议论文数量(0)
专利数量(0)

数据更新时间:{{ journalArticles.updateTime }}

{{ item.title }}
{{ item.translation_title }}
  • DOI:
    {{ item.doi }}
  • 发表时间:
    {{ item.publish_year }}
  • 期刊:
  • 影响因子:
    {{ item.factor }}
  • 作者:
    {{ item.authors }}
  • 通讯作者:
    {{ item.author }}

数据更新时间:{{ journalArticles.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ monograph.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ sciAawards.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ conferencePapers.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ patent.updateTime }}

Caporossi, Gilles其他文献

Dynamics of the Spelling Process During a Copy Task: Effects of Regularity and Frequency
Variable Neighborhood Search for extremal vertices : The AutoGraphiX-III system
  • DOI:
    10.1016/j.cor.2015.12.009
  • 发表时间:
    2017-02-01
  • 期刊:
  • 影响因子:
    4.6
  • 作者:
    Caporossi, Gilles
  • 通讯作者:
    Caporossi, Gilles

Caporossi, Gilles的其他文献

{{ item.title }}
{{ item.translation_title }}
  • DOI:
    {{ item.doi }}
  • 发表时间:
    {{ item.publish_year }}
  • 期刊:
  • 影响因子:
    {{ item.factor }}
  • 作者:
    {{ item.authors }}
  • 通讯作者:
    {{ item.author }}

{{ truncateString('Caporossi, Gilles', 18)}}的其他基金

Apprentissage automatique et optimisation pour les graphes et réseaux
图形和图像的自动化和优化学徒
  • 批准号:
    DDG-2020-00039
  • 财政年份:
    2022
  • 资助金额:
    $ 1.6万
  • 项目类别:
    Discovery Development Grant
Apprentissage automatique et optimisation pour les graphes et réseaux
图形和图像的自动化和优化学徒
  • 批准号:
    DDG-2020-00039
  • 财政年份:
    2021
  • 资助金额:
    $ 1.6万
  • 项目类别:
    Discovery Development Grant
Apprentissage automatique et optimisation pour les graphes et réseaux
图形和图像的自动化和优化学徒
  • 批准号:
    DDG-2020-00039
  • 财政年份:
    2020
  • 资助金额:
    $ 1.6万
  • 项目类别:
    Discovery Development Grant
Development of algorithms for the conception and the analysis of graphs and complex networks
开发图形和复杂网络的概念和分析算法
  • 批准号:
    RGPIN-2015-04945
  • 财政年份:
    2018
  • 资助金额:
    $ 1.6万
  • 项目类别:
    Discovery Grants Program - Individual
Development of algorithms for the conception and the analysis of graphs and complex networks
开发图形和复杂网络的概念和分析算法
  • 批准号:
    RGPIN-2015-04945
  • 财政年份:
    2017
  • 资助金额:
    $ 1.6万
  • 项目类别:
    Discovery Grants Program - Individual
Development of algorithms for the conception and the analysis of graphs and complex networks
开发图形和复杂网络的概念和分析算法
  • 批准号:
    RGPIN-2015-04945
  • 财政年份:
    2016
  • 资助金额:
    $ 1.6万
  • 项目类别:
    Discovery Grants Program - Individual
Development of algorithms for the conception and the analysis of graphs and complex networks
开发图形和复杂网络的概念和分析算法
  • 批准号:
    RGPIN-2015-04945
  • 财政年份:
    2015
  • 资助金额:
    $ 1.6万
  • 项目类别:
    Discovery Grants Program - Individual
Development of algorithms for data mining
数据挖掘算法的开发
  • 批准号:
    298138-2009
  • 财政年份:
    2013
  • 资助金额:
    $ 1.6万
  • 项目类别:
    Discovery Grants Program - Individual
Development of algorithms for data mining
数据挖掘算法的开发
  • 批准号:
    298138-2009
  • 财政年份:
    2012
  • 资助金额:
    $ 1.6万
  • 项目类别:
    Discovery Grants Program - Individual
Development of algorithms for data mining
数据挖掘算法的开发
  • 批准号:
    298138-2009
  • 财政年份:
    2011
  • 资助金额:
    $ 1.6万
  • 项目类别:
    Discovery Grants Program - Individual

相似国自然基金

固定参数可解算法在平面图问题的应用以及和整数线性规划的关系
  • 批准号:
    60973026
  • 批准年份:
    2009
  • 资助金额:
    32.0 万元
  • 项目类别:
    面上项目
Computational Methods for Analyzing Toponome Data
  • 批准号:
    60601030
  • 批准年份:
    2006
  • 资助金额:
    17.0 万元
  • 项目类别:
    青年科学基金项目

相似海外基金

DMS-EPSRC: Asymptotic Analysis of Online Training Algorithms in Machine Learning: Recurrent, Graphical, and Deep Neural Networks
DMS-EPSRC:机器学习中在线训练算法的渐近分析:循环、图形和深度神经网络
  • 批准号:
    EP/Y029089/1
  • 财政年份:
    2024
  • 资助金额:
    $ 1.6万
  • 项目类别:
    Research Grant
CAREER: Blessing of Nonconvexity in Machine Learning - Landscape Analysis and Efficient Algorithms
职业:机器学习中非凸性的祝福 - 景观分析和高效算法
  • 批准号:
    2337776
  • 财政年份:
    2024
  • 资助金额:
    $ 1.6万
  • 项目类别:
    Continuing Grant
CAREER: From Dynamic Algorithms to Fast Optimization and Back
职业:从动态算法到快速优化并返回
  • 批准号:
    2338816
  • 财政年份:
    2024
  • 资助金额:
    $ 1.6万
  • 项目类别:
    Continuing Grant
CAREER: Structured Minimax Optimization: Theory, Algorithms, and Applications in Robust Learning
职业:结构化极小极大优化:稳健学习中的理论、算法和应用
  • 批准号:
    2338846
  • 财政年份:
    2024
  • 资助金额:
    $ 1.6万
  • 项目类别:
    Continuing Grant
CRII: SaTC: Reliable Hardware Architectures Against Side-Channel Attacks for Post-Quantum Cryptographic Algorithms
CRII:SaTC:针对后量子密码算法的侧通道攻击的可靠硬件架构
  • 批准号:
    2348261
  • 财政年份:
    2024
  • 资助金额:
    $ 1.6万
  • 项目类别:
    Standard Grant
CRII: AF: The Impact of Knowledge on the Performance of Distributed Algorithms
CRII:AF:知识对分布式算法性能的影响
  • 批准号:
    2348346
  • 财政年份:
    2024
  • 资助金额:
    $ 1.6万
  • 项目类别:
    Standard Grant
CRII: CSR: From Bloom Filters to Noise Reduction Streaming Algorithms
CRII:CSR:从布隆过滤器到降噪流算法
  • 批准号:
    2348457
  • 财政年份:
    2024
  • 资助金额:
    $ 1.6万
  • 项目类别:
    Standard Grant
EAGER: Search-Accelerated Markov Chain Monte Carlo Algorithms for Bayesian Neural Networks and Trillion-Dimensional Problems
EAGER:贝叶斯神经网络和万亿维问题的搜索加速马尔可夫链蒙特卡罗算法
  • 批准号:
    2404989
  • 财政年份:
    2024
  • 资助金额:
    $ 1.6万
  • 项目类别:
    Standard Grant
CAREER: Efficient Algorithms for Modern Computer Architecture
职业:现代计算机架构的高效算法
  • 批准号:
    2339310
  • 财政年份:
    2024
  • 资助金额:
    $ 1.6万
  • 项目类别:
    Continuing Grant
CAREER: Improving Real-world Performance of AI Biosignal Algorithms
职业:提高人工智能生物信号算法的实际性能
  • 批准号:
    2339669
  • 财政年份:
    2024
  • 资助金额:
    $ 1.6万
  • 项目类别:
    Continuing Grant
{{ showInfoDetail.title }}

作者:{{ showInfoDetail.author }}

知道了