International Journal of Networked and Distributed Computing

<Previous Article In Issue
Next Article In Issue>
Volume 7, Issue 4, September 2019, Pages 149 - 157

Efficient Searching for Essential API Member Sets based on Inclusion Relation Extraction

Authors
Yushi Kondoh*, Masashi Nishimoto, Keiji Nishiyama, Hideyuki Kawabata, Tetsuo Hironaka
Graduate School of Information Sciences, Hiroshima City University, Hiroshima, Japan
*Corresponding author. Email: kondoh@ca.info.hiroshima-cu.ac.jp
Corresponding Author
Yushi Kondoh
Received 23 March 2019, Accepted 20 May 2019, Available Online 24 September 2019.
DOI
10.2991/ijndc.k.190911.002How to use a DOI?
Keywords
API member set; frequent pattern mining; application development; open source repositories; Android
Abstract

Search tools for Application Programming Interface (API) usage patterns extracted from open source repositories could provide useful information for application developers. Unlike ordinary document retrieval, API member sets obtained by mining are often similar to each other and are mixtures of several unimportant and/or irrelevant elements. Thus, an API member set search tool needs to have the ability to extract an essential part of each API member set and to be equipped with an efficient searching interface. We propose a method to improve the searchability of API member sets by utilizing inclusion graphs among API member sets that are automatically extracted from source code. The proposed method incorporates the frequent pattern mining to obtain inclusion graphs and offers the user a way to search appropriate API member sets smoothly and intuitively by using a GUI. In this paper, we describe the details of our method and the design and implementation of the prototype and discuss the usability of the proposed tool.

Copyright
© 2019 The Authors. Published by Atlantis Press SARL.
Open Access
This is an open access article distributed under the CC BY-NC 4.0 license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)
View full text (HTML)

<Previous Article In Issue
Next Article In Issue>
Journal
International Journal of Networked and Distributed Computing
Volume-Issue
7 - 4
Pages
149 - 157
Publication Date
2019/09/24
ISSN (Online)
2211-7946
ISSN (Print)
2211-7938
DOI
10.2991/ijndc.k.190911.002How to use a DOI?
Copyright
© 2019 The Authors. Published by Atlantis Press SARL.
Open Access
This is an open access article distributed under the CC BY-NC 4.0 license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

risenwbib
TY  - JOUR
AU  - Yushi Kondoh
AU  - Masashi Nishimoto
AU  - Keiji Nishiyama
AU  - Hideyuki Kawabata
AU  - Tetsuo Hironaka
PY  - 2019
DA  - 2019/09/24
TI  - Efficient Searching for Essential API Member Sets based on Inclusion Relation Extraction
JO  - International Journal of Networked and Distributed Computing
SP  - 149
EP  - 157
VL  - 7
IS  - 4
SN  - 2211-7946
UR  - https://doi.org/10.2991/ijndc.k.190911.002
DO  - 10.2991/ijndc.k.190911.002
ID  - Kondoh2019
ER  -