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

Local Maxima in ADCOPs via Side Payments 通过侧支付的adcop局部最大值

Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Pub Date : 2021-12-14 DOI: 10.1145/3486622.3493919

Yair Vaknin, A. Meisels

{"title":"Local Maxima in ADCOPs via Side Payments","authors":"Yair Vaknin, A. Meisels","doi":"10.1145/3486622.3493919","DOIUrl":"https://doi.org/10.1145/3486622.3493919","url":null,"abstract":"Distributed constraints optimization problems (DCOPs) are composed of multiple constrained agents and their solution is an assignment of values by all agents that has the maximal global social welfare. DCOPs are known to be NP-Hard and therefore need incomplete search algorithms. Local search algorithms for DCOPs are incomplete distributed algorithms that start from some initial state and attempt to find improved solutions ( [10, 13]). When the constraints have different values for the constrained agents, the problems are termed Asymmetric DCOPs, or ADCOPs. Standard local search algorithms, such as DSA or MGM, are not guaranteed to converge on ADCOPs. When convergence does happen, the solution is not necessarily an extremum of the global social welfare. This is true also for local search algorithms that were designed specifically for asymmetric DCOPs [3]. The present paper proposes an iterative local search algorithm for ADCOPs, that relies on the analogy between ADCOPs and multi-agents games. In each iteration of the algorithm agents can propose side-payments to their neighbors, in return to their choice of an assignment that is preferred by the agent offering the side payment. It is shown that the proposed protocol produces a behavior of the distributed algorithm that is an extension of the best-response dynamics in muti-agent games. These properties of the proposed Bidding Efficient Equilibria Contracts (BEECon) algorithm guarantee convergence towards a local optimum of the global social welfare. Extensive experimental evaluation on randomly generated ADCOPs demonstrates that convergence is fast and that the resulting solutions are of higher social welfare than those of the best former ADCOP local search algorithm.","PeriodicalId":89230,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"44 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73896234","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

Operationalizing Rule-Based Socio-Ethical Behaviour in IoT Collectives: a Policy Management Approach 在物联网集体中实施基于规则的社会伦理行为:一种政策管理方法

Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Pub Date : 2021-12-14 DOI: 10.1145/3486622.3493987

Amna Batool, S. Loke, Niroshinie Fernando, Jonathan Kua

引用次数: 1

An Agent Supporting Symptom Elicitation in Physician-Patient Dialogue 在医患对话中支持症状激发的代理

Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Pub Date : 2021-12-14 DOI: 10.1145/3486622.3494028

Marco Lanciotti, C. Escazut, C. Pereira, Claudio Sartori, Emanuele Galasso

引用次数: 0

Research and Application of Terminal Vulnerability Mining System of Electric Power Company Based on Artificial Intelligence 基于人工智能的电力公司终端漏洞挖掘系统研究与应用

Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Pub Date : 2021-12-14 DOI: 10.1145/3498851.3498978

Y.J. Gu, Yu Yang, Heting Li

引用次数: 0

Novel Views on Novels:Embedding Multiple Facets of Long Texts 小说观:长文本的多面嵌入

Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Pub Date : 2021-12-14 DOI: 10.1145/3486622.3494006

Lasse Kohlmeyer, Tim Repke, Ralf Krestel

引用次数: 1

Effective Candidate Selection and Interpretable Interest Extraction for Follower Prediction on Social Media 社交媒体关注者预测的有效候选选择和可解释兴趣提取

Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Pub Date : 2021-12-14 DOI: 10.1145/3486622.3493954

Seiji Maekawa, Santi Saeyor, Takeshi Sakaki, Makoto Onizuka

引用次数: 0

Embedding Cube-Connected Cycles into Grid Network for Minimum Wirelength 在网格网络中嵌入立方体连接循环的最小无线长度

Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Pub Date : 2021-12-14 DOI: 10.1145/3498851.3498998

Zhijie Han, Yinyun Fu, Xiaoyu Du

引用次数: 1

A Learning Framework with Disposable Auxiliary Networks for Early Prediction of Product Success 基于一次性辅助网络的产品成功早期预测学习框架

Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Pub Date : 2021-12-14 DOI: 10.1145/3486622.3493923

Chih-Ting Yeh, Zhe-Li Lin, Sheng-Chieh Lin, Jing-Kai Lou, Ming-Feng Tsai, Chuan-Ju Wang

{"title":"A Learning Framework with Disposable Auxiliary Networks for Early Prediction of Product Success","authors":"Chih-Ting Yeh, Zhe-Li Lin, Sheng-Chieh Lin, Jing-Kai Lou, Ming-Feng Tsai, Chuan-Ju Wang","doi":"10.1145/3486622.3493923","DOIUrl":"https://doi.org/10.1145/3486622.3493923","url":null,"abstract":"Consider the scenario in which an investor seeks to identify potential products before they are unveiled to the public. For such a scenario, the investor poses questions such as “What characteristic better represents a product?” or “What features make a product popular?” Unlike traditional recommendation problems, in this case, there is no user feedback for the upcoming products, which greatly complicates prediction. To address this challenging yet common scenario, we present an unconventional multi-task learning framework that trains the prediction model on information for mature products that have user feedback, and then uses this model to predict the success of upcoming products for which there is no user feedback. To achieve this goal, we train a main task network to extract product features from their descriptions while at the same time training a disposable auxiliary network to learn domain-specific words and popular trends from user reviews.This disposable auxiliary network is beneficial during the training of the main task network but is unused at the inference stage. Empirical results on two real-world datasets in different languages demonstrate that the proposed framework not only improves the overall rating prediction for products but also identifies the top successful products without any user reviews.","PeriodicalId":89230,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"34 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86925982","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

Denoising method of ECG signal with power threshold function under wavelet transform and smoothing filter✱ 心电信号在小波变换和平滑滤波下的功率阈值去噪方法

Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Pub Date : 2021-12-14 DOI: 10.1145/3498851.3498974

Chunyang Wu, Beiwei Zhang, Jinhai Li

引用次数: 0

An Approach Based on Semantic Similarity to Explaining Link Predictions on Knowledge Graphs 基于语义相似度的知识图链接预测解释方法

Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Pub Date : 2021-12-14 DOI: 10.1145/3486622.3493956

Claudia d’Amato, Pierpaolo Masella, N. Fanizzi

{"title":"An Approach Based on Semantic Similarity to Explaining Link Predictions on Knowledge Graphs","authors":"Claudia d’Amato, Pierpaolo Masella, N. Fanizzi","doi":"10.1145/3486622.3493956","DOIUrl":"https://doi.org/10.1145/3486622.3493956","url":null,"abstract":"We propose approxSemanticCrossE, an approach for generating explanations to link prediction problems on Knowledge Graphs. Due to their incompleteness, several models have been proposed to predict missing relationships (link prediction task). To date, the most effective methods are based on embedding models, representing entities and relationships as a multi-dimensional vectors in a vector space. Explaining the results of this task means finding a meaningful reason for which entities are predicted as linked. This work presents a structural and semantically enriched approach for generating explanations for link predictions, by exploring the data available in the knowledge graph. The solution searches for paths and examples of similar situations that justify the prediction carried out using numerical approaches. Specifically, CrossE is adopted as the underlying embedding model to compute predictions. Then explanations are searched exploiting ad hoc semantic similarity measures. The proposed solution has been experimentally evaluated, showing that the new approach is able to provide meaningful explanations compared to the considered baseline.","PeriodicalId":89230,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"119 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86180648","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