Rinji Suzuki, Kazuhiro Akiyama, T. Kumamoto, Akiyo Nadamoto
{"title":"Analysis of High-value Reviews based on Sentiment","authors":"Rinji Suzuki, Kazuhiro Akiyama, T. Kumamoto, Akiyo Nadamoto","doi":"10.1145/3366030.3366038","DOIUrl":"https://doi.org/10.1145/3366030.3366038","url":null,"abstract":"When people use online shopping, they often refer reviews which are written about the products. They can understand the product more deeply by reading the reviews. The review has a star rating that shows what other people think about the product. The star rating is not always appropriate for the evaluation of the product. There are so many reviews and it is difficult to find the review that affects the users' willingness to buy. We call such review \"high-value review\". Our proposed high-value review does not depend on the number of star ratings. The high-value review is that people find useful information when they read the review and they think it is a good review. In this paper, we investigate the relation between high-value reviews and their sentiment of clause based on four hypotheses. Our analyzing sentiment is three-axis which are positive/negative/neutral. Finally, we extract the characteristics of high-value reviews from the results of our investigate.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"17 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132603268","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}
Yuto Tsukagoshi, Takahiro Kawamura, Y. Sei, Yasuyuki Tahara, Akihiko Ohsuga
{"title":"Knowledge Graph of University Campus Issues and Application of Completion Methods","authors":"Yuto Tsukagoshi, Takahiro Kawamura, Y. Sei, Yasuyuki Tahara, Akihiko Ohsuga","doi":"10.1145/3366030.3366042","DOIUrl":"https://doi.org/10.1145/3366030.3366042","url":null,"abstract":"Contemporary societies face many urban issues. To address these issues, governments, corporations and individuals should disclose and share their related statistical and sensory data. However, existing published data appear in various formats and contain defects. Therefore, few problems have been solved using these data. In this research, we sought to address this problem, by considering a university campus as a microcosm of society, designed data integration schema, and consolidated data into a knowledge graph. We then, applied and modified existing completion methods. In particular, regarding the bicycle environment, we trained our knowledge graph and evaluated it with the conventional method and our proposed derivative method, respectively. Using approximately 650 parking data with various dates and times, our method correctly estimated 54.5 more bicycles than the conventional method by comparing each time's mean absolute error.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"27 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132657268","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}
Ada Bagozi, D. Bianchini, V. D. Antonellis, Massimiliano Garda, M. Melchiori
{"title":"Exploiting Blockchain and Smart Contracts for Data Exploration As a Service","authors":"Ada Bagozi, D. Bianchini, V. D. Antonellis, Massimiliano Garda, M. Melchiori","doi":"10.1145/3366030.3366075","DOIUrl":"https://doi.org/10.1145/3366030.3366075","url":null,"abstract":"Digital transformation and the adoption of ICT technologies in the factory of the future are growing faster and faster. In particular, data exploration methods and techniques are enabling the development of data-intensive Remote Monitoring Services for anomaly detection and predictive maintenance purposes. Remote Monitoring Services involve different actors across organizations. The Original Equipment Manufacturer explores high volume of data collected by sensors on the monitored machines to provide anomaly detection and predictive maintenance services. Insurance agencies may provide support to sustain maintenance costs. Spare parts suppliers can schedule the delivery of mechanical parts required for maintenance interventions. In this scenario, trust among participants becomes a critical issue. On the one hand, providers of anomaly detection and predictive maintenance services as well as insurance agencies must trust the way machines have been used by collecting and analysing sensors data. On the other hand, owners of monitored machines must trust the use of collected data to implement services, based on which maintenance costs are calculated. The goal of this paper is to leverage blockchain and smart contracts to ensure the required level of trust when implementing data exploration for Remote Monitoring Services. Events occurring on the monitored machines are stored as transactions in a blockchain-based system, to ensure non repudiation. Moreover, trust-demanding services are implemented as smart contracts, to guarantee the required level of trustworthiness among participants. The approach is integrated with a tool for data exploration in the digital factory, and has been validated taking into account performances and cost requirements.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133405634","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}
Alexander Dudko, Tatiana Endrjukaite, Leon R. Roose
{"title":"Open Routed Energy Distribution Network based on a Concept of Energy Router in Smart Grid","authors":"Alexander Dudko, Tatiana Endrjukaite, Leon R. Roose","doi":"10.1145/3366030.3366036","DOIUrl":"https://doi.org/10.1145/3366030.3366036","url":null,"abstract":"As the electricity generation is shifting to renewable energy sources (RES), the grid infrastructure faces multiple challenges, such as intermittency and volatility of a wide range RES. A high penetration of renewables requires profound changes to the current energy distribution system. The conventional grid is increasingly becoming a bottleneck for expanding the share of RES because of its rigid architecture, which is built around centralized energy source. We propose a new energy exchange model for a routed energy distribution system, which can perform electricity routing based on smart routing algorithms and presented protocols. We utilize a concept of an energy router device that controls energy flows and utilizes protocols stack to smartly route the energy between houses in the grid. This paper describes current results with several experimental networks of multiple houses interconnected through energy routers.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131699759","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}
{"title":"Building a Semantic Model for Linking and Visualizing Patent Citations (SeMViPaC)","authors":"Farag Saad, René Hackl-Sommer","doi":"10.1145/3366030.3366110","DOIUrl":"https://doi.org/10.1145/3366030.3366110","url":null,"abstract":"Patents are a high-quality resource of information that is currently insufficiently leveraged. In times when continuously rising prices for basic knowledge access threaten to throttle academic research everywhere, this is a resource that can not be longer neglected. Thus, in the project we plan to extract and semantically describe citations from patents. Furthermore, we will establish linking and data integration between disparate data sources, i.e. linking patents with resources in the LOD (Linked Open Data) cloud. Based on the developed semantic citation model a visualization tool to explore and gain better insight and understanding of the extracted citation data will be developed and made available to the public.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130306121","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}
{"title":"Predicting the Category of Fire Department Operations","authors":"Kevin Pirklbauer, R. Findling","doi":"10.1145/3366030.3366113","DOIUrl":"https://doi.org/10.1145/3366030.3366113","url":null,"abstract":"Voluntary fire departments have limited human and material resources. Machine learning aided prediction of fire department operation details can benefit their resource planning and distribution. While there is previous work on predicting certain aspects of operations within a given operation category, operation categories themselves have not been predicted yet. In this paper we propose an approach to fire department operation category prediction based on location, time, and weather information, and compare the performance of multiple machine learning models with cross validation. To evaluate our approach, we use two years of fire department data from Upper Austria, featuring 16.827 individual operations, and predict its major three operation categories. Preliminary results indicate a prediction accuracy of 61%. While this performance is already noticeably better than uninformed prediction (34% accuracy), we intend to further reduce the prediction error utilizing more sophisticated features and models.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132405955","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}
{"title":"Fatten Features and Drop Wastes: Finding Repeaters' Reviews by Feature Generation and Feature Selection","authors":"Naoki Muramoto, Hiromi Shiraga, Kilho Shin, Hiroaki Ohshima","doi":"10.1145/3366030.3366133","DOIUrl":"https://doi.org/10.1145/3366030.3366133","url":null,"abstract":"In this paper, we proposed a method for determining whether a given restaurant review comment is a repeater's review, or not. We often use restaurant review sites to decide which restaurant to go to. When we read a restaurant review comment, we can know whether the reviewer is a repeater of the restaurant. If a certain restaurant has many repeaters, the restaurant must be great. However, restaurant review sites usually do not provide a \"revisit rate\". Therefore, we tackle a problem for determining whether a review is a repeater's review, or not. There are many sentences in a review comment that are completely not useful for determining whether the review is a repeater review, such as what was ordered, what was delicious, or how was the price. To confront such difficulties, we have taken the following approach. First, very various features are extracted from review comments so as not to miss the features that represent repeaters' reviews. Next, from the very various features, only the necessary features that really contribute to the classification is selected by a feature selection method. Finally, classification is performed using a classifier. We have implemented the proposed method using super-CWC [12], a state-of-the-art feature selection method, and SVM. The experimental results show that the proposed method is better than other methods.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128250574","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}
Dina Sharafeldeen, Alsayed Algergawy, B. König-Ries
{"title":"Towards Knowledge Graph Construction using Semantic Data Mining","authors":"Dina Sharafeldeen, Alsayed Algergawy, B. König-Ries","doi":"10.1145/3366030.3366035","DOIUrl":"https://doi.org/10.1145/3366030.3366035","url":null,"abstract":"Over the last few years, constructing knowledge graphs for new domains and linking them to existing ones has gained significant attention, especially in domains which have experienced a tremendous increase in available data such as biodiversity research. To this end, in this paper, we introduce a new semantic data mining-based approach to support the (semi-)automatic generation of a biodiversity knowledge graph. The proposed approach exploits and links information from several biodiversity-related resources, including the Encyclopedia of Life (EOL), the Global Biodiversity Information Facility (GBIF), and the Global Biotic Interactions (GLOBI). In particular, we adopt a data mining technique to extract association rules that support the construction of an initial species interactions knowledge graph. We then make use of available biodiversity resources to enrich the knowledge graph. We believe that this graph will support scientists from the biodiversity domain to gain new insights and enrich the data interoperability.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126021600","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}
{"title":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","authors":"","doi":"10.1145/3366030","DOIUrl":"https://doi.org/10.1145/3366030","url":null,"abstract":"","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133341136","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}
{"title":"URL-based Phishing Detection using the Entropy of Non-Alphanumeric Characters","authors":"Eint Sandi Aung, H. Yamana","doi":"10.1145/3366030.3366064","DOIUrl":"https://doi.org/10.1145/3366030.3366064","url":null,"abstract":"Phishing is a type of personal information theft in which phishers lure users to steal sensitive information. Phishing detection mechanisms using various techniques have been developed. Our hypothesis is that phishers create fake websites with as little information as possible in a webpage, which makes it difficult for content- and visual similarity-based detections by analyzing the webpage content. To overcome this, we focus on the use of Uniform Resource Locators (URLs) to detect phishing. Since previous work extracts specific special-character features, we assume that non-alphanumeric (NAN) character distributions highly impact the performance of URL-based detection. We hence propose a new feature called the entropy of NAN characters for URL-based phishing detection. Experimental evaluation with balanced and imbalanced datasets shows 96% ROC AUC on the balanced dataset and 89% ROC AUC on the imbalanced dataset, which increases the ROC AUC as 5 to 6% from without adopting our proposed feature.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115595893","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}