Efficient Subgraph Mining in Multi-Relational Networks

**計畫名稱：**Efficient Subgraph Mining in Multi-Relational Networks

**所屬單位：**資訊系

**研究團隊：**Information Retrieval Lab

**計畫主持人：**鄭卜壬

**研究人員：**林庭竹

**資源需求：**C & C++(gcc, g++), Java, Python, Perl, Matlab, PHP-CLI

**使用期間：**2008/12~

**研究主題：**

Efficient Subgraph Mining in Multi-Relational Networks

**研究內容概述：**

Subgraph searching problem is an interesting research direction in the Web or many other social environments. However, there are many problems in the searching of graph. One of the most difficult problems is the cost of computation. When we apply more conditions in the searching algorithms, the computational time is longer and more costly due to there is a huge number of links and vertices in a graph. Thus, we want to apply the OpenMP parallel method to speed up the computation of subgraph searching.

詳細計畫內容 | 回到上一頁 |