| Project/Area Number |
14380144
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (B)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
計算機科学
|
|---|
| Research Institution | Osaka University |
|---|
Principal Investigator |
INOUE Katsuro Osaka University, Graduate School of Information Science and Technology, Professor, 大学院・情報科学研究科, 教授 (20168438)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
KUSUMOTO Shinji Osaka University, Graduate School of Information Science and Technology, Associate Professor, 大学院・情報科学研究科, 助教授 (30234438)
MATSUSHITA Makoto Osaka University, Graduate School of Information Science and Technology, Assistant Professor, 大学院・情報科学研究科, 助手 (60304028)
YAMAMOTO Tetsuo Ritsumeikan University, College of Information Science and Engineering, Lecture, 情報理工学部, 講師
|
|---|
| Project Period (FY) |
2002 – 2004
|
| Project Status |
Completed (Fiscal Year 2004)
|
| Budget Amount *help |
¥11,900,000 (Direct Cost: ¥11,900,000)
Fiscal Year 2004: ¥3,900,000 (Direct Cost: ¥3,900,000)
Fiscal Year 2003: ¥4,000,000 (Direct Cost: ¥4,000,000)
Fiscal Year 2002: ¥4,000,000 (Direct Cost: ¥4,000,000)
|
|---|
| Keywords | Software / Component / Search system / Java / Internet / Library / reuse / JAVA / カテゴリ検索 / 自動分類 / 潜在的意味解析手法LSA / 識別子 / 類似度 / クラスタ / プログラム部品 / プログラムメトリクス / 検索 |
|---|
| Research Abstract |
In this research, we have developed a component search system, named SPARS-J, which treats the source files of Java classes as components. In the system, we use a novel ranking method to narrow retrieved software components from reusable libraries. We define a component rank model based on a graph representation scheme of the component library. In this model, a collection of software components is represented as a weighted directed graph, i.e., the nodes of the graph correspond to components and the edges linking the nodes correspond to cross component usage. Similar components are clustered into one node so that the effect of duplicated components is removed. The nodes in the graph are ranked by their weights, which are defined as the elements of the eigenvector of an adjacent matrix for the directed graph. The resulting rank, named component rank, is used to prioritize the query result so that highly ranked components are quickly seen by the user. The idea behind component rank originates from computing impact factors (called influence weights) of published papers. This approach has been extended to ranking Web documents on the Internet. SPARS-J has been applied to various collections of Java programs, such as JDK, programs downloaded from the Internet, and business applications from two companies. The results show that a class frequently invoked by other classes (such as those that implement fundamental and standard data structures) generally has a high rank, and that nonstandard and special classes typically have a low ranking. Two companies use SPARS-J for automatic management of their software assets, and SPARS-J shows very promising results.
|
