J. Data Intell.最新文献_第4页

Knowledge Graph Completion to Solve University Campus Issues 知识图谱补全解决大学校园问题

J. Data Intell. Pub Date : 2020-09-01 DOI: 10.26421/JDI1.3-3

Yuto Tsukagoshi, Takahiro Kawamura, Y. Sei, Yasuyuki Tahara, Akihiko Ohsuga

引用次数: 1

An Efficient System for Supporting Bat Swing of Beginners in Baseball Using Wearable Sensors 利用可穿戴式传感器支持棒球初学者击球的有效系统

J. Data Intell. Pub Date : 2020-06-01 DOI: 10.26421/JDI1.2-2

Hiroaki Ito, Y. Gotoh

引用次数: 0

Efficient Vector Partitioning Algorithms for Graph Clustering 图聚类的高效向量划分算法

J. Data Intell. Pub Date : 2020-06-01 DOI: 10.26421/JDI1.2-1

Hiroaki Shiokawa, Y. Futamura

{"title":"Efficient Vector Partitioning Algorithms for Graph Clustering","authors":"Hiroaki Shiokawa, Y. Futamura","doi":"10.26421/JDI1.2-1","DOIUrl":"https://doi.org/10.26421/JDI1.2-1","url":null,"abstract":"This paper addressed the problem of finding clusters included in graph-structured data such as Web graphs, social networks, and others. Graph clustering is one of the fundamental techniques for understanding structures present in the complex graphs such as Web pages, social networks, and others. In the Web and data mining communities, the modularity-based graph clustering algorithm is successfully used in many applications. However, it is difficult for the modularity-based methods to find fine-grained clusters hidden in large-scale graphs; the methods fail to reproduce the ground truth. In this paper, we present a novel modularity-based algorithm, textit{CAV}, that shows better clustering results than the traditional algorithm. The proposed algorithm employs a cohesiveness-aware vector partitioning into the graph spectral analysis to improve the clustering accuracy. Additionally, this paper also presents a novel efficient algorithm textit{P-CAV} for further improving the clustering speed of CAV; P-CAV is an extension of CAV that utilizes the thread-based parallelization on a many-core CPU. Our extensive experiments on synthetic and public datasets demonstrate the performance superiority of our approaches over the state-of-the-art approaches.","PeriodicalId":232625,"journal":{"name":"J. Data Intell.","volume":"114 15","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113945843","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Fast and Parallel Ranking-based Clustering for Heterogeneous Graphs 基于快速并行排序的异构图聚类

J. Data Intell. Pub Date : 2020-06-01 DOI: 10.26421/JDI1.2-3

Kotaro Yamazaki, Tomoki Sato, Hiroaki Shiokawa, H. Kitagawa

引用次数: 2

A Parallelizing Method for Generation of Voronoi Diagram Using Contact Zone 利用接触区生成Voronoi图的并行化方法

J. Data Intell. Pub Date : 2020-06-01 DOI: 10.26421/JDI1.2-4

Yuuhi Okahana, Y. Gotoh

{"title":"A Parallelizing Method for Generation of Voronoi Diagram Using Contact Zone","authors":"Yuuhi Okahana, Y. Gotoh","doi":"10.26421/JDI1.2-4","DOIUrl":"https://doi.org/10.26421/JDI1.2-4","url":null,"abstract":"Due to the recent popularization of the Geographic Information System (GIS), spatial network environments that can display the changes of spatial axes on mobile devices are receiving great attention. In spatial network environments, since a query object that seeks location information selects several candidate target objects based on the search conditions, we often use a k-nearest neighbor (kNN) search, which seeks several target objects near the query object. However, since a kNN search needs to find the kNN by calculating the distance from the query to all the objects, the computational complexity might become too large based on the number of objects. To reduce this computation time in a kNN search, many researchers have proposed a search method that divides regions using a Voronoi diagram. However, since conventional methods generate Voronoi diagrams for objects in order, the processing time for generating Voronoi diagrams might become too large when the number of objects is increased. In this paper, we propose a generation method of the Voronoi diagram by parallelizing the generation of Voronoi regions using a contact zone. Our proposed method can reduce the processing time of generating the Voronoi diagram by generating Voronoi regions in parallel based on the number of targets. Our evaluation confirmed that the processing time under the proposed method was reduced about 15.9% more than conventional methods that are not parallelized.","PeriodicalId":232625,"journal":{"name":"J. Data Intell.","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125197786","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Evaluation of Input/Output Interface using Wrinkles on Clothes 利用衣服皱褶评价输入/输出界面

J. Data Intell. Pub Date : 2020-03-01 DOI: 10.26421/JDI1.1-3

Kentaro Ueda, T. Terada, M. Tsukamoto

{"title":"Evaluation of Input/Output Interface using Wrinkles on Clothes","authors":"Kentaro Ueda, T. Terada, M. Tsukamoto","doi":"10.26421/JDI1.1-3","DOIUrl":"https://doi.org/10.26421/JDI1.1-3","url":null,"abstract":"Wearable computing has created textile-based interfaces utilizing the interaction between the user and cloth for operation, as well as the touch and the pinch input operation. The user wears and uses the device in various postures, environments, and operating positions that affect the operation speed and accuracy. However, no study has assessed such factors of touching and pinching using the same input interface. One of the textile interfaces has an input interface using wrinkles on clothes. A ridge of cloth produces a wrinkle that forms naturally on clothes, and the shape of these wrinkles can be recognized by their tactile sensations. Additionally, the act touching or pinching wrinkles does not look strange to an onlooker, which reach that wrinkles have the potential suitable for the wearable computing operation. To reveal the potential, this paper evaluates the input performance using wrinkles on clothes. We designed three touch input methods and one pinch input method for the operation using wrinkles. We implemented the input and the output device which use wrinkles and carried out four evaluations. The results indicated that the pinch input reached the highest accuracy of 98% of four input methods after learning. The narrowing-down selection reached the fastest input time of 1.64 seconds of four methods after learning. The long press touch and the pinch input achieved the accuracy of 90% or more in all combination of operating environments and device positions. According to the result of the wrinkle recognition, users have a high accuracy of the identification of wrinkles of 89.4% and recognize their shape in approximately 12 seconds.","PeriodicalId":232625,"journal":{"name":"J. Data Intell.","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127129736","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

A Method for Controlling Arrival Time to Prevent Late Arrival by Manipulating Vehicle Timetable Information 一种利用车辆时刻表信息控制到达时间以防止晚点到达的方法

J. Data Intell. Pub Date : 2020-03-01 DOI: 10.26421/JDI1.1-1

Kyosuke Futami, T. Terada, M. Tsukamoto

{"title":"A Method for Controlling Arrival Time to Prevent Late Arrival by Manipulating Vehicle Timetable Information","authors":"Kyosuke Futami, T. Terada, M. Tsukamoto","doi":"10.26421/JDI1.1-1","DOIUrl":"https://doi.org/10.26421/JDI1.1-1","url":null,"abstract":"Although it is socially and ethically important not to be late for a specified arrival time, late arrivals sometimes happen to people using public transportation. Although many methods aim to smooth a user's movement by providing useful information, there are few approaches to prevent late arrivals due to psychological factors. In this research, to make a user's arrival time earlier and thus prevent late arrival, we propose a method that manipulates time allowance by presenting information based on a psychological and cognitive tendency. We apply this method to a vehicle timetable system for the purpose of preventing public transit users from arriving after a target vehicle's departure time. Our proposed timetable system manipulates the time intervals between a user's target vehicle and other vehicles by introducing fictional elements such as hidden vehicles and inserted fictional vehicles. This method uses the relationship between the time allowance and the departure time interval, and it can make a user desire and accept arriving at a station earlier. We implemented a prototype system and conducted four experiments. The evaluation results confirmed that our proposed method is effective for changing a user's time allowance and actual arrival time.","PeriodicalId":232625,"journal":{"name":"J. Data Intell.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130027007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Fast Affinity Propagation by Cell-based Indexing 基于单元格索引的快速亲和性传播

J. Data Intell. Pub Date : 2020-03-01 DOI: 10.26421/JDI1.1-4

Hiroaki Shiokawa, Tomohiro Matsushita, H. Kitagawa

引用次数: 0

Extract of Japanese Text Characteristics of Simplified Corpora using Non-negative Matrix Factorization 非负矩阵分解法提取简化语料库日语文本特征

J. Data Intell. Pub Date : 2020-03-01 DOI: 10.26421/JDI1.1-5

Koji Wajima, Kei Koqure, Toshihiro Furukawa, T. Satoh

{"title":"Extract of Japanese Text Characteristics of Simplified Corpora using Non-negative Matrix Factorization","authors":"Koji Wajima, Kei Koqure, Toshihiro Furukawa, T. Satoh","doi":"10.26421/JDI1.1-5","DOIUrl":"https://doi.org/10.26421/JDI1.1-5","url":null,"abstract":"Ways of disseminating(Verbreitungsmedien) information through different media have rapidly changed owing to technological progress, especially in the field of information and communication technologies. Reflecting the changes in terms of conditions of technological progress, communication methods, and abilities have also changed. On the Internet, contents with different expressions of difficulty are mixed even though they have almost the same contents. A user who intends to search for new things or unknown things may get confused and spend a lot of time in selecting contents that are understandable for them because there are large amounts of similar contents with different difficulties. Herein, The characteristics of relevant simplified corpora are critical for everybody. In this research, we propose a method to compare two types of documents with different difficulty, and select a characteristic related to simple of expression from various characteristics related to text. In our proposed method, thousands of text characteristics are compressed and converted by Non-negative Matrix Factorization(NMF), and a basis for characterizing the simplified document is selected. The proposed method combines the characteristics of the most conducted research using the characteristics of 32 types and 2,196 dimensions. We evaluated the text characteristics in the NMF Base of the results using a classifier. As a result of applying the proposed method to two kinds of environment white papers, it became clear that an effective basis can be selected. In Addtionally, We showed estimate of the causation relationships, Optimization of the parameter. Furthermore, We showed flexibility to other media.","PeriodicalId":232625,"journal":{"name":"J. Data Intell.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133712921","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

RevASIDE: Evaluation of Assignments of Suitable Reviewer Sets RevASIDE:评估合适的审稿人组的作业

J. Data Intell. Pub Date : 1900-01-01 DOI: 10.26421/JDI4.1-2-1

Christin Katharina Kreutz, Ralf Schenkel

引用次数: 0