Faculty Profiles - ISHIKAWA, Yoshiharu

Papers - ISHIKAWA, Yoshiharu

Division display 221 - 240 of about 320 ／ All the affair displays >>

Hierarchical Histograms for Exploratory Analysis of Spatio-Temporal Array Data Reviewed

Jing Zhao, Yoshiharu Ishikawa, Lei Chen, Chuan Xiao, Kento Sugiura

IEICE Transactions on Information and Systems Vol. E102-D ( 4 ) page： 788-799 2019.4

Autocompletion for Prefix-Abbreviated Input Reviewed

Sheng Hu, Chuan Xiao, Jianbin Qin, Yoshiharu Ishikawa, Qiang Ma

ACM SIGMOD International Conference on Management of Data (SIGMOD 2019) page： 211-228 2019.6

Language：English

Query autocompletion (QAC) is an important interactive feature that assists users in formulating queries and saving keystrokes. Due to the convenience it brings to users, QAC has been adopted in many applications, including Web search engines, integrated development environments (IDEs), and mobile devices. For existing QAC methods, users have to manually type delimiters to separate keywords in their inputs. In this paper, we propose a novel QAC paradigm through which users may abbreviate keywords by prefixes and do not have to explicitly separate them. Such paradigm is useful for applications where it is inconvenient to specify delimiters, such as desktop search, text editors, and input method editors. E.g., in an IDE, users may input getnev and we suggest GetNextValue. We show that the query processing method for traditional QAC, which utilizes a trie index, is inefficient under the new problem setting. A novel indexing and query processing scheme is hence proposed to efficiently complete queries. To suggest meaningful results, we devise a ranking method based on a Gaussian mixture model, taking into consideration the way in which users abbreviate keywords, as opposed to the traditional ranking method that merely considers popularity. Efficient top-k query processing techniques are developed on top of the new index structure. Experiments demonstrate the effectiveness of the new QAC paradigm and the efficiency of the proposed query processing method.

DOI： 10.1145/3299869.3319858

Scope-aware Code Completion with Discriminative Modeling Reviewed

Sheng Hu, Chuan Xiao, Yoshiharu Ishikawa

Journal of Information Processing (JIP) Vol. 27 page： 469-478 2019.8

Language：English Publishing type：Research paper (scientific journal)

Code completion is a traditional popular feature for API access in integrated development environments (IDEs). It not only frees programmers from remembering specific details about an API but also saves keystrokes and corrects typographical errors. Existing methods for code completion usually suggest APIs based on statistics in code bases described by language models. However, they neglect the fact that the user's input is also very useful for ranking, as the underlying patterns can be used to improve the accuracy of predictions of intended APIs. In this paper, we propose a novel method to improve the quality of code completion by incorporating the users' acronym-like input conventions and the APIs' scope context into a discriminative model. The users' input conventions are learned using a logistic regression model by extracting features from collected training data. The weights in the discriminative model are learned using a support vector machine (SVM). To improve the real-time efficiency of code completion, we employ a trie to index and store the scope context information. An efficient top-k algorithm is developed. Experiments show that our proposed method outperforms the baseline methods in terms of both effectiveness and efficiency.

DOI： 10.2197/ipsjjip.27.469

多次元データ分析のための可視化推薦システム

野田昌太郎, 杉浦健人, 石川佳治

第18回情報技術フォーラム（FIT 2019） page： D-002 2019.9

データベースのスキーマ情報を活用した機械学習

志村薫, 杉浦健人, 石川佳治

第18回情報技術フォーラム（FIT 2019） page： D-008 2019.9

略語のフルネームのスケーラブルな推測

高明敏, 肖川, 石川佳治

第18回情報技術フォーラム（FIT 2019） page： D-009 2019.9

センサストリーム処理のための近似的耐障害性保証

高尾大樹, 石川佳治, 杉浦健人

情報処理学会研究報告 Vol. 2019-DBS-169 ( 12 ) page： (no page no.) 2019.9

Efficient Framework for Processing Top-k Queries with Replication in Mobile Ad Hoc Networks Reviewed

Yuya Sasaki, Takahiro Hara, Yoshiharu Ishikawa

GeoInformatica Vol. 23 ( 4 ) page： 591-620 2019.10

Language：English Publishing type：Research paper (scientific journal)

This article addresses the top-k query processing problem on mobile ad hoc networks (MANETs). Top-k query processing is common to retrieve only highly important data items. However, methods for top-k query processing are not enough efficient and accurate in MANET environments. For improving the efficiency and accuracy, replication is a promising technique that each node in MANETs replicates data items retained by other nodes into its storage. Therefore, we fully combine the top-k query processing with data replication. We propose a framework that efficiently processes top-k queries based on a new replication strategy. We develop new replication strategy FReT (topology-Free Replication for Top-k query). FReT determines near-optimal allocations of replicas. It advantages efficient top-k query processing from limited search area without maintenance costs even if mobile nodes move. Our top-k query processing methods retrieve the exact answer with small overhead and delay by gradually increasing the search area based on FReT. We demonstrate, through extensive experiments, that FReT and query processing methods function well in terms of small delay and overhead without sacrificing exactness of the query result.

DOI： 10.1007/s10707-019-00363-0

Approximate Fault Tolerance for Sensor Stream Processing Reviewed

Daiki Takao, Kento Sugiura, Yoshiharu Ishikawa

Proceedings of the 31st Australasian Database Conference (ADC 2020) page： -- 2020.1

トライ木及びGMMに基づく略語のフルネームのスケーラブルな推測手法

高明敏, 肖川, 石川佳治

第12回データ工学と情報マネジメントに関するフォーラム (DEIM Forum 2020) 2020.3

チェックポインティングを考慮した近似的耐障害性保証

高尾大樹, 杉浦健人, 石川佳治

第12回データ工学と情報マネジメントに関するフォーラム (DEIM Forum 2020) page： H3-4 2020.3

並列ストリーム処理システムにおけるDBを用いた内部状態の共有手法

杉浦健人, 石川佳治

第12回データ工学と情報マネジメントに関するフォーラム (DEIM Forum 2020) page： I8-1 2020.3

多次元データの探索分析のための多様性を考慮した可視化システム

野田昌太郎, 杉浦健人, 石川佳治

第12回データ工学と情報マネジメントに関するフォーラム (DEIM Forum 2020) page： A8-3 2020.3

データベースのスキーマ情報を活用した機械学習

志村薫, 杉浦健人, 石川佳治

第12回データ工学と情報マネジメントに関するフォーラム (DEIM Forum 2020) page： D8-5 2020.3

メニーコアシステムにおける分散ストリーム処理システムの性能評価 - スループットに関する評価 -

德増直紀, 杉浦健人, 石川佳治

情報処理学会第82回全国大会 page： 7M-01 2020.3

メニーコアシステムにおける分散ストリーム処理システムの性能評価 - 遅延に関する評価 -

牧田直樹, 杉浦健人, 石川佳治

情報処理学会第82回全国大会 page： 7M-02 2020.3

RDBMSによる3D TINデータベース実装手法

田中玲史, 杉浦健人, 石川佳治

情報処理学会第82回全国大会 page： 5N-01 2020.3

Compressed Indexing for Trajectories Constrained in Road Networks Reviewed

Satoshi Koide, Chuan Xiao, Yoshiharu Ishikawa

Vol. J103-D ( 5 ) page： 393 - 402 2020.5

Multiple Regular Expression Pattern Monitoring over Probabilistic Event Streams Reviewed

Kento Sugiura, Yoshiharu Ishikawa

IEICE Transactions on Information and Systems Vol. E103-D ( 5 ) page： 982 - 991 2020.5

Fast Subtrajectory Similarity Search in Road Networks under Weighted Edit Distance Constraints Reviewed

Satoshi Koide, Chuan Xiao, Yoshiharu Ishikawa

Proceedings of the VLDB Endowment (PVLDB) Vol. 13 ( 11 ) page： 2188 - 2201 2020.7

　 PREV - NEXT 　

<ISHIKAWA, Yoshiharu>

Papers - ISHIKAWA, Yoshiharu