Multi-Graph Frequent Approximate Subgraph Mining For Image Clustering

PROGRESS IN ARTIFICIAL INTELLIGENCE AND PATTERN RECOGNITION, IWAIPR 2018(2018)

引用 0|浏览11
暂无评分
摘要
In data mining, frequent approximate subgraph (FAS) mining techniques has taken the full attention of several applications, where some approximations are allowed between graphs for identifying important patterns. In the last four years, the application of FAS mining algorithms over multi-graphs has reported relevant results in different pattern recognition tasks like supervised classification and object identification. However, to the best of our knowledge, there is no reported work where the patterns identified by a FAS mining algorithm over multi-graph collections are used for image clustering. Thus, in this paper, we explore the use of multi-graph FASs for image clustering. Some experiments are performed over image collections for showing that by using multi-graph FASs under the bag of features image approach, the image clustering results reported by using simple-graph FAS can be improved.
更多
查看译文
关键词
Approximate multi-graph matching, Approximate multi-graph mining, Multi-graph clustering
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要