期刊
COGNITIVE COMPUTATION
卷 7, 期 3, 页码 346-358出版社
SPRINGER
DOI: 10.1007/s12559-014-9295-7
关键词
Uncertain graph; Classification; Extreme Learning Machine
资金
- National Natural Science Foundation of China [61173029, 61272182]
- New Century Excellent Talents in University [NCET-11-0085]
The problem of graph classification has attracted much attention in recent years. The existing work on graph classification has only dealt with precise and deterministic graph objects. However, the linkages between nodes in many real-world applications are inherently uncertain. In this paper, we focus on classification of graph objects with uncertainty. The method we propose can be divided into three steps: Firstly, we put forward a framework for classifying uncertain graph objects. Secondly, we extend the traditional algorithm used in the process of extracting frequent subgraphs to handle uncertain graph data. Thirdly, based on Extreme Learning Machine (ELM) with fast learning speed, a classifier is constructed. Extensive experiments on uncertain graph objects show that our method can produce better efficiency and effectiveness compared with other methods.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据