Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services最新文献

筛选
英文 中文
Towards Linked Data for Wikidata Revisions and Twitter Trending Hashtags 面向维基数据修订和Twitter趋势标签的关联数据
Paula Dooley, Bojan Bozic
{"title":"Towards Linked Data for Wikidata Revisions and Twitter Trending Hashtags","authors":"Paula Dooley, Bojan Bozic","doi":"10.1145/3366030.3366048","DOIUrl":"https://doi.org/10.1145/3366030.3366048","url":null,"abstract":"This paper uses Twitter as a microblogging platform to link hashtags, which relate the message to a topic that is shared among users, to Wikidata, a central knowledge base of information relying on its members and machine bots to keeping its content up to date. The data is stored in a highly structured format, with the added SPARQL Protocol And RDF Query Language (SPARQL) endpoint to allow users to query its knowledge base. Our research, designs and implements a process to stream live Twitter tweets and to parse existing Wikidata revision XML files provided by Wikidata. Furthermore, we identify if a correlation exists between the top Twitter hashtags and Wikidata revisions over a seventy-seven-day period. We have used statistical evaluation tools, such as 'Jaccard Ratio' and 'Kolmogorov-Smirnov' to investigate a significant statistical correlation between Twitter hashtags and Wikidata revisions over the studied period.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"21 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":"115607577","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 Privacy-Preserving Query System using Fully Homomorphic Encryption with Real-World Implementation for Medicine-Side Effect Search 基于全同态加密的药物副作用搜索隐私保护查询系统
Yusheng Jiang, T. Noguchi, Nobuyuki Kanno, Yoshiko Yasumura, Takuya Suzuki, Yu Ishimaki, H. Yamana
{"title":"A Privacy-Preserving Query System using Fully Homomorphic Encryption with Real-World Implementation for Medicine-Side Effect Search","authors":"Yusheng Jiang, T. Noguchi, Nobuyuki Kanno, Yoshiko Yasumura, Takuya Suzuki, Yu Ishimaki, H. Yamana","doi":"10.1145/3366030.3366061","DOIUrl":"https://doi.org/10.1145/3366030.3366061","url":null,"abstract":"The preservation of privacy during a search has become a serious problem in recent years. There is an increasing requirement to ensure that user queries are not abused by a third party, including the search provider. Fully homomorphic encryption (FHE) can conduct addition and multiplication directly over ciphertext. Using FHE, privacy, concerning both the user queries and the database of the search provider, can be protected. In this paper, we propose a privacy-preserving query system model. We implemented the proposed model in a real-world medicine side-effect query system. We applied a filtering technique, prior to the query deployment, to reduce the size of the database and used multi-threading to accelerate the search. The system was tested 10,000 times with a random query, using a database comprising 40,000 records of simulation data, and completed 99.84% of the queries within 60 seconds (s), proving the real-world applicability of our system.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"87 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":"122112030","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}
引用次数: 5
Extending Linked USDL by Trust Assertion 通过信任断言扩展链接wsdl
W. Bauer, N. Kryvinska, J. Dorn, Owen Sacco
{"title":"Extending Linked USDL by Trust Assertion","authors":"W. Bauer, N. Kryvinska, J. Dorn, Owen Sacco","doi":"10.1145/3366030.3366057","DOIUrl":"https://doi.org/10.1145/3366030.3366057","url":null,"abstract":"Since a decade researchers of information systems try to generalize descriptions of services and service transactions to enable automatic discovery and matchmaking of services to empower the vision of the digitalization of the service industry. Industry 4.0. is an actual challenge that requires those generic descriptions of services to enable search, comparison and matchmaking of service requests and service advertisements by the use of semantics of services. The Unified Service Description Language (USDL) is the most cited and popular research strand were researchers try to unify the vocabulary and description of service transactions for the purposes of digitalizing services not only from a technical perspective, but also from a business view to facilitate the trade of services on the web. But the research in USDL is by history an informatics driven matter due to its' growth out of the SOA paradigm. This article proposes an extension of the business perspective of Linked USDL by linking it to the Trust Assertion Ontology (TAO), so that the trustworthiness evaluation of a service offer is incorporated into the USDL model. This research fills a gap of USDL, so that it can be better applied for describing service interactions in business environments.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"103 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":"130414581","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}
引用次数: 2
A Theoretical Approach to Discover Mutual Friendships from Social Graph Networks 从社交图谱网络中发现相互友谊的理论方法
S. Singh, C. Leung, Fan Jiang, A. Cuzzocrea
{"title":"A Theoretical Approach to Discover Mutual Friendships from Social Graph Networks","authors":"S. Singh, C. Leung, Fan Jiang, A. Cuzzocrea","doi":"10.1145/3366030.3366077","DOIUrl":"https://doi.org/10.1145/3366030.3366077","url":null,"abstract":"Due to popularity of social networking in the current era of big data, many social networking sites (e.g., Facebook) has been generating huge volumes of social data. In this paper, we aim to discover interesting relationships in a undirected (social) graph via a theoretical approach. Specifically, we examine the graph theory and linear algebra approaches to find mutual friendships from social networks represented in the form of big graphs or big graph databases.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"30 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":"126271583","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}
引用次数: 15
Generating Anthropomorphism of Subject and Verb by Transformation Matrix 用变换矩阵生成主谓拟人化
Katsurou Takahashi, Hiroaki Ohshima, Kilho Shin
{"title":"Generating Anthropomorphism of Subject and Verb by Transformation Matrix","authors":"Katsurou Takahashi, Hiroaki Ohshima, Kilho Shin","doi":"10.1145/3366030.3366096","DOIUrl":"https://doi.org/10.1145/3366030.3366096","url":null,"abstract":"In this paper, given the subject-verb pairs, we propose a computational model to express the difference of the meaning of a verb when the subject has changed. We propose a method to generate metaphorical expressions consist of subject-verb pairs from the model. \"Airship swims\" is one of the example. It is the expression about the event that an airship flies in the sky gracefully. There are a few reasons why the expression is accepted for people. \"airship flie\" and the motion of a sea creature, for example \"whale swims\" represent both \"the normal move in a space\" and there is a similarity. Given the input (\"airship,\" \"fly\"), we propose a method to detect a verb \"swims\" to generate metaphorical expressions considering these similarity. At first, we test which vectorization method is the best as the vectorization of a subject-verb pair. We calculate a transformation matrix to conserve between the meaning of (non-human subject, verb) pairs and the meaning of (\"man\", verb) pairs. We calcurate the transformation matrix between them using the stable meaning verbs as the anchors. In this paper, we test an hypothesis that we can use these transformation matrices to find an appropriate verb considering the difference of the meaning occured from the subjects. We gather 67 cases of target figurative expressions from Web. We evaluated the proposed method by defining the information retrieval problem of verbs.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"52 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":"126507889","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
A Robust and Scalable Pipeline for the Real-time Processing and Analysis of Massive 3D Spatial Streams 一个鲁棒和可扩展的管道,用于实时处理和分析海量三维空间流
Salman Ahmed Shaikh, Jun Lee, Akiyoshi Matono, Kyoung-Sook Kim
{"title":"A Robust and Scalable Pipeline for the Real-time Processing and Analysis of Massive 3D Spatial Streams","authors":"Salman Ahmed Shaikh, Jun Lee, Akiyoshi Matono, Kyoung-Sook Kim","doi":"10.1145/3366030.3366105","DOIUrl":"https://doi.org/10.1145/3366030.3366105","url":null,"abstract":"With the increase in the use of 3D scanner to sample the earth surface, there is a surge in the availability of 3D spatial data. 3D spatial data contains a wealth of information and can be of potential use if integrated, processed and analyzed in real-time. The 3D spatial data is generated as continuous data stream, however due to its size, velocity and inherent noise, it is processed offline. Many applications require real-time processing and analysis of spatial stream, for-instance, forest fire management, real-time road traffic analysis, disaster engulfed areas monitoring, etc., however they suffer from slow offline processing of traditional systems. This paper presents and demonstrates a robust and scalable pipeline for the real-time processing and analysis of 3D spatial streams. An experimental evaluation is also presented to prove the effectiveness of the proposed framework.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"05 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":"130452729","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
Flexible Community Search Algorithm on Attributed Graphs 属性图的灵活社区搜索算法
Shohei Matsugu, Hiroaki Shiokawa, H. Kitagawa
{"title":"Flexible Community Search Algorithm on Attributed Graphs","authors":"Shohei Matsugu, Hiroaki Shiokawa, H. Kitagawa","doi":"10.1145/3366030.3366049","DOIUrl":"https://doi.org/10.1145/3366030.3366049","url":null,"abstract":"How can the most appropriate community be found given an attributed graph and a user-specified query node? The community search algorithm is currently an essential graph data management tool to find a community suited to a user-specified query node. Although community search algorithms are useful in various web-based applications and services, they have trouble handling attributed graphs due to the strict topological constraints of traditional algorithms. In this paper, we propose an accurate community search algorithm for attributed graphs. To overcome current limitations, we define a new attribute-driven community search problem class called the Flexible Attributed Truss Community (F-ATC). The advantage of the F-ATC problem is that it relaxes topological constraints, allowing diverse communities to be explored. Consequently, the community search accuracy is enhanced compared to traditional community search algorithms. Additionally, we present a novel heuristic algorithm to solve the F-ATC problem. This effective algorithm detects more accurate communities from attributed graphs than the traditional algorithms. Finally, extensive experiments are conducted using real-world attributed graphs to demonstrate that our approach achieves a higher accuracy than the state-of-the-art method.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"34 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":"115119112","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}
引用次数: 4
Reverse-Transliteration of Hebrew script for Entity Disambiguation 实体消歧义的希伯来文反音译
Aaron Christianson, Maral Dadvar, K. Eckert
{"title":"Reverse-Transliteration of Hebrew script for Entity Disambiguation","authors":"Aaron Christianson, Maral Dadvar, K. Eckert","doi":"10.1145/3366030.3366099","DOIUrl":"https://doi.org/10.1145/3366030.3366099","url":null,"abstract":"JudaicaLink is a novel domain-specific knowledge base for Jewish culture, history, and studies. JudaicaLink is built by extracting structured, multilingual knowledge from different sources and it is mainly used for contextualization and entity linking. One of the main challenges in the process of aggregating Jewish digital resources is the use of the Hebrew script. The proof of materials in German central cataloging systems is based on the conversion of the original script of the publication into the Latin script, known as Romanization. Many of our datasets, especially those from library catalogs, contain Hebrew authors' names and titles which are only in Latin script without their Hebrew script. Therefore, it is not possible to identify them in and link them to other corresponding Hebrew resources. To overcome this problem, we designed a reverse-transliteration model which reconstructs the Hebrew script from the Romanization and consequently makes the entities more accessible.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"42 20","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120849678","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
Personalized Service Delivery using Reinforcement Learning in Fog and Cloud Environment 在雾和云环境中使用强化学习的个性化服务交付
C. Dehury, S. Srirama
{"title":"Personalized Service Delivery using Reinforcement Learning in Fog and Cloud Environment","authors":"C. Dehury, S. Srirama","doi":"10.1145/3366030.3366055","DOIUrl":"https://doi.org/10.1145/3366030.3366055","url":null,"abstract":"The ability to fulfil the resource demand in runtime is encouraging the businesses to migrate to cloud. Recently, to provide real-time cloud services and to save network resources, fog computing is introduced. To further improve the quality of service in delivery process, Artificial Intelligence is being applied extensively. However, the state-of-the-art in this regard is still immature as it mainly focuses at either fog or cloud. To address this issue, a novel reinforcement learning-based personalized service delivery (RLPSD) mechanism is proposed in this paper, which allows the service provider to combine the fog and cloud environments, while providing the service. RLPSD distributes the user's service requests between fog and cloud, considering the users' constraints (e.g. the distance from fog), thus resulting in personalized service delivery. The proposed RLPSD algorithm is implemented and evaluated in terms of its success rate, percentage of service requests' distribution, learning rate, discount factor, etc.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"46 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":"129696090","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}
引用次数: 8
A Design of an Anti-Phishing Training System Collaborated with Multiple Organizations 多机构协同反网络钓鱼培训系统设计
Masayuki Higashino
{"title":"A Design of an Anti-Phishing Training System Collaborated with Multiple Organizations","authors":"Masayuki Higashino","doi":"10.1145/3366030.3366086","DOIUrl":"https://doi.org/10.1145/3366030.3366086","url":null,"abstract":"Phishing is a dangerous threat to organizations. A sender of a phishing email pretends to be a trusted person to steal valuable information, including personal identity data and credentials. If a targeted organization is sent a large number of attack emails, many members will be stolen valuable information. As a result, there are cases where the damage spreads by attack techniques in which targeted attack emails are sent in chaining from the account to other organizations. It is difficult to defend from such an attack by a single organization alone. In this paper, we design a system that can share information about phishing attack emails quickly and perform an anti-phishing training between multiple organizations. This system semi-automatically detoxifies and anonymizes attack emails received by an organization and shares it with multiple organizations. Each organization becomes possible to perform semiautomatic and continuous anti-phishing training using current attacking information.","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":"130389825","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}
引用次数: 5
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信