Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology最新文献

筛选
英文 中文
Differentially Private Multi-Agent Constraint Optimization 差分私有多智能体约束优化
Sankarshan Damle, Aleksei Triastcyn, B. Faltings, Sujit Gujar
{"title":"Differentially Private Multi-Agent Constraint Optimization","authors":"Sankarshan Damle, Aleksei Triastcyn, B. Faltings, Sujit Gujar","doi":"10.1145/3486622.3493929","DOIUrl":"https://doi.org/10.1145/3486622.3493929","url":null,"abstract":"Several optimization scenarios involve multiple agents that desire to protect the privacy of their preferences. There are distributed algorithms for constraint optimization that provide improved privacy protection through secure multiparty computation. However, it comes at the expense of high computational complexity and does not constitute a rigorous privacy guarantee for optimization outcomes, as the result of the computation itself may compromise agents’ preferences. In this work, we show how to achieve privacy, specifically differential privacy, through the randomization of the solving process. In particular, we present P-Gibbs, which adapts the SD-Gibbs algorithm to obtain differential privacy guarantees with much higher computational efficiency. Experiments on graph coloring and meeting scheduling show the algorithm’s privacy-performance trade-off for varying privacy budgets, and the SD-Gibbs algorithm.","PeriodicalId":89230,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"101 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83618635","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
Multi-user Online Three-Dimensional Marine Oil Spill Crisis Response System 多用户在线三维海洋溢油危机响应系统
Bingchan Li, Hongtao Ma, Bo Mao
{"title":"Multi-user Online Three-Dimensional Marine Oil Spill Crisis Response System","authors":"Bingchan Li, Hongtao Ma, Bo Mao","doi":"10.1145/3498851.3498924","DOIUrl":"https://doi.org/10.1145/3498851.3498924","url":null,"abstract":"Based on analyzing of current situation and existing problems of marine oil spill emergency drill teaching in maritime colleges, the significance of online teaching and 3D simulation is expounded. In this paper, an online 3D marine oil spill emergency drill system was is proposed, which consists of five functional modules: oil spill emergency resource editor module, accident scene editing module, oil spill accident handling deduction module, evaluation and evaluation module and drill module. The scheme design and architecture of the online teaching system of 3D simulation are given, and the functional simulation is realized. The results show that the system can enable students to carry out online exercises and give instant feedback, support the sharing of maps of exercises between different schools, and support students to collaborate remotely via the Internet.","PeriodicalId":89230,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"30 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86272438","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
Home Appliance Review Analysis Via Adversarial Reptile 家用电器评论分析通过敌对爬行动物
Tai-Jung Kan, Chia-Hui Chang
{"title":"Home Appliance Review Analysis Via Adversarial Reptile","authors":"Tai-Jung Kan, Chia-Hui Chang","doi":"10.1145/3486622.3493958","DOIUrl":"https://doi.org/10.1145/3486622.3493958","url":null,"abstract":"Studying discussion of products on social media can help manufacturers improve their products. Opinions provided through online reviews can immediately reflect whether the product is accepted by people, and which aspects of the product are most discussed. In this article, we divide the analysis of home appliances into three tasks, including named entity recognition (NER), aspect category extraction (ACE), and aspect category sentiment classification (ACSC). To improve the performance of ACSC, we combine the Reptile algorithm in meta learning with the concept of domain adversarial training to form the concept of the Adversarial Reptile algorithm. We found that the macro-F1 is improved from 68.6% (BERT fine-tuned model) to 70.3% (p-value 0.04).","PeriodicalId":89230,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"60 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77215263","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
Climbing Route Difficulty Grade Prediction and Explanation 攀爬路线难度等级预测与解释
Marina Andric, I. Ivanova, Francesco Ricci
{"title":"Climbing Route Difficulty Grade Prediction and Explanation","authors":"Marina Andric, I. Ivanova, Francesco Ricci","doi":"10.1145/3486622.3493932","DOIUrl":"https://doi.org/10.1145/3486622.3493932","url":null,"abstract":"This article focuses on sport climbing and on the design of innovative tools for supporting climbers to browse and search routes to climb. The difficulty of a route, its grade, is normally assessed by expert climbers, named route setters. A regular climber, after trying a route, may perceive it more or less difficult than the route setter. It is important to estimate this climber’s perceived difficulty of the routes in order to suggest the routes that have a target perceived difficulty as expected by the climber. We develop a knowledge-based approach that uses domain-specific features to train a predictive model. Additionally, the problem is modeled as a rating prediction task in a recommender system, using a matrix factorization approach with a custom normalization solution. The knowledge-based approach enables us to develop a grade prediction explanation functionality. In off-line experiments, we demonstrate improvements over a baseline. Moreover, we show how the proposed techniques can be exploited in an app developed by a major company offering information services to the sport climbing market.","PeriodicalId":89230,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"9 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85658873","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
Medical Inter-Specialty Referral Networks 医学专科间转诊网络
Tatiana Ermakova, Benjamin Fabian, M. Erhart, T. Czihal, D. Stillfried
{"title":"Medical Inter-Specialty Referral Networks","authors":"Tatiana Ermakova, Benjamin Fabian, M. Erhart, T. Czihal, D. Stillfried","doi":"10.1145/3498851.3498930","DOIUrl":"https://doi.org/10.1145/3498851.3498930","url":null,"abstract":"Motivated by their increasing popularity and usefulness in the English-speaking world, we model and analyze patient referral networks for medical specialties based on Germany-wide claims data from the fourth quarter of 2015. Based on the average values of local graph measures, different groups of medical specialties could be distinguished. Family physicians have almost perfect average out-degree and closeness centrality. Based on the principal components applied to local graph measures, four clusters of local medical specialties could be identified, that are characteristic for (1) orthopedists, surgeons, otolaryngologists, dermatologists and internists; (2) non-medical psychotherapists, pediatricians, gynecologists, and ophthalmologists; (3) only family physicians in Bremen and internists in Hamburg and Saarland; (4) the remaining family physicians. This study can serve as a basis for further network simulations and monitoring to achieve the desired health care outcomes, optimal resource allocation and protection against infections.","PeriodicalId":89230,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"53 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73569279","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
Multi-Task Neural Sequence Labeling for Zero-Shot Cross-Language Boilerplate Removal 基于多任务神经序列标记的零采样跨语言样板去除
Yu-hao Wu, Chia-Hui Chang
{"title":"Multi-Task Neural Sequence Labeling for Zero-Shot Cross-Language Boilerplate Removal","authors":"Yu-hao Wu, Chia-Hui Chang","doi":"10.1145/3486622.3493938","DOIUrl":"https://doi.org/10.1145/3486622.3493938","url":null,"abstract":"Although web pages are rich in resources, they are usually intertwined with advertisements, banners, navigation bars, footer copyrights and other templates, which are often not of interest to users. In this paper, we study the problem of extracting the main content and removing irrelevant information from web pages. The common solution is to classify each web component into boilerplate (noise) or main content. State-of-the-art approaches such as BoilerNet use neural sequence labeling to achieve an impressive score in CleanEval EN dataset. However, the model uses only the top 50 HTML tags as input features, which does not fully utilize the power of tag information. In addition, the most frequent 1,000 words used for text content representation cannot effectively support a real-world environment in which web pages appear in multiple languages. In this paper, we propose a multi-task learning framework based on two auxiliary tasks: depth prediction and position prediction. We explore HTML tag embedding for tag path representation learning. Further, we employ multilingual Bidirectional Encoder Representations from Transformers (BERT) for text content representation to deal with any web pages without language limitations. The experiments show that HTML tag embedding and multi-task learning frameworks achieve much higher scores than using BoilerNet on CleanEval EN datasets. Secondly, the pre-trained text block representation based on multilingual BERT will degrade the performance on EN test sets; however, zero-shot experiments on three languages (Chinese, Japanese, and Thai) have a performance consistent with the five-fold cross-validation of the respective language, which indicates the possibility of providing cross-lingual support in one model.","PeriodicalId":89230,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"25 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73718976","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
Addressing Scalability Issues in Semantics-Driven Recommender Systems 解决语义驱动推荐系统中的可扩展性问题
Mounir M. Bendouch, F. Frasincar, T. Robal
{"title":"Addressing Scalability Issues in Semantics-Driven Recommender Systems","authors":"Mounir M. Bendouch, F. Frasincar, T. Robal","doi":"10.1145/3486622.3493963","DOIUrl":"https://doi.org/10.1145/3486622.3493963","url":null,"abstract":"Content-based semantics-driven recommender systems are often used in the small-scale news recommendation domain. These recommender systems improve over TF-IDF by taking into account (domain) semantics through semantic lexicons or domain ontologies. Our work explores the application of such recommender systems to other domains, using the case of large-scale movie recommendations. We propose new methods to extract semantic features from various item descriptions, and for scaling up the semantics-driven approach with pre-computation of the cosine similarities and gradient learning of the model. The results of the study on a large-scale dataset of user ratings demonstrate that semantics-driven recommenders can be extended to more complex domains and outperform TF-IDF on ROC, PR, F1, and Kappa metrics.","PeriodicalId":89230,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72694958","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
Learning Equilibrium Contributions in Multi-project Civic Crowdfunding 多项目公民众筹中的学习均衡贡献
Manisha Padala, Sankarshan Damle, Sujit Gujar
{"title":"Learning Equilibrium Contributions in Multi-project Civic Crowdfunding","authors":"Manisha Padala, Sankarshan Damle, Sujit Gujar","doi":"10.1145/3486622.3493918","DOIUrl":"https://doi.org/10.1145/3486622.3493918","url":null,"abstract":"Crowdfunding is an efficient method for raising funds for projects. When used for non-excludable public projects, the process is termed Civic Crowdfunding (CC) and is an active research area. Researchers have analyzed CC in game-theoretic settings assuming that agents are interested in (and contribute to) a single public project. Generalizing the existing single project theory to determine agents’ equilibrium contributions for multiple projects is non-trivial – especially with budget-constrained agents. This work hypothesizes that the agents can learn their equilibrium contributions with repeated participation in multi-project CC. We model CC as a game to validate the hypothesis and build an RL-based simulator: EqC-Learner. We first show that EqC-Learner learns a policy that mimics equilibrium contributions in a single project case for the existing CC mechanisms. To validate EqC-Learner for the multi-project case, we present certain theoretical results for the general multi-project case. Via extensive simulation-based experiments, we show that the learned contributions in EqC-Learner follow all the available theoretical analysis. Thus, we believe that such an RL-based simulator can learn equilibrium contributions for the general multi-project CC mechanism.","PeriodicalId":89230,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"8 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75077067","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
Mechanism Design without Money for Fair Allocations 没有钱的公平分配机制设计
Manisha Padala, Sujit Gujar
{"title":"Mechanism Design without Money for Fair Allocations","authors":"Manisha Padala, Sujit Gujar","doi":"10.1145/3486622.3493955","DOIUrl":"https://doi.org/10.1145/3486622.3493955","url":null,"abstract":"Fairness is well studied in the context of resource allocation. Researchers have proposed various fairness notions like envy-freeness (EF), and its relaxations, proportionality and max-min share (MMS). There is vast literature on the existential and computational aspects of such notions. While computing fair allocations, any algorithm assumes agents’ truthful reporting of their valuations towards the resources. Whereas in real-world web-based applications for fair division, the agents involved are strategic and may manipulate for individual utility gain. In this paper, we study strategy-proof mechanisms without monetary transfer, which satisfies the various fairness criteria. We know that for additive valuations, designing truthful mechanisms for EF, MMS and proportionality is impossible. Here we show that there cannot be a truthful mechanism for EFX and the existing algorithms for EF1 are manipulable. We then study the particular case of single-minded agents. For this case, we provide a Serial Dictatorship Mechanism that is strategy-proof and satisfies all the fairness criteria except EF.","PeriodicalId":89230,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"13 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76878662","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
VHCN : A Hybrid Data Center Network Based on VLC Link 基于VLC链路的混合数据中心网络VHCN
Zhijie Han, Yang Yang, Xiaoyu Du
{"title":"VHCN : A Hybrid Data Center Network Based on VLC Link","authors":"Zhijie Han, Yang Yang, Xiaoyu Du","doi":"10.1145/3498851.3499002","DOIUrl":"https://doi.org/10.1145/3498851.3499002","url":null,"abstract":"With the development of cloud computing, the importance of data center increases. The traditional data center network is divided into two types. The wired data center network has poor scalability because of the limited number of server ports and equipment costs. Wireless data center network is often regulated by mechanical equipment, resulting in large delays and costs. This paper proposes a hybrid data center network VHCN based on VLC(visible light communication) link, Firstly, compared with the wireless data center network, VHCN does not need external objects and mechanical equipment, and VLC links are plug and play. Secondly, compared with the wired data center network HCN, VHCN does not change the original topology rules of HCN, and VHCN has higher fault tolerance and lower average path length under the same conditions. Finally, this paper proves a unicast and multicast routing algorithm.","PeriodicalId":89230,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"85 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80588646","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
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书