2014 IEEE 26th International Conference on Tools with Artificial Intelligence最新文献_第2页

SBMF: Similarity-Based Matrix Factorization for Collaborative Recommendation 基于相似度的矩阵分解协同推荐

2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.64

Xin Wang, Congfu Xu

{"title":"SBMF: Similarity-Based Matrix Factorization for Collaborative Recommendation","authors":"Xin Wang, Congfu Xu","doi":"10.1109/ICTAI.2014.64","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.64","url":null,"abstract":"Matrix factorization (MF) has been proved a very successful technique for Collaborative Filtering (CF), and hence has been widly adpoted in today's recommender systems. However, many studies have been proved that MF alone is poor to reveal the local relationships of users and items which can be learned well by the neighborhood-aware methods. To combine the merits of both approaches, in this paper, we propose a novel model which can effectively integrate the local preference information into MF. Different from various proposed methods which focus on representing the local similarity by the interactions of corresponding latent factors, we extend the neighborhood relationships to both latent factors and their rating preference. First, we establish clusters of users and items based on neighborhood information. Second, we transform the cluster information into two rating matrices which represent (user cluster) - (item) and (user) - (item cluster) preference. Third, we combine the generated rating matrices and the local latent factors into a single model, named Similarity-Based Matrix Factorization (SBMF). Since our model can explore the external representation of similarity information, it leads to more accurate recommendations. Experimental results on several real-world data sets show that our SBMF outperforms the state-of-the-art methods.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"258 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130250753","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}

引用次数: 3

Fine-Tuning of UAV Control Rules for Spraying Pesticides on Crop Fields 无人机对农田喷洒农药控制规则的微调

2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.85

Bruno S. Faiçal, G. Pessin, G. P. R. Filho, A. Carvalho, Gustavo Furquim, J. Ueyama

{"title":"Fine-Tuning of UAV Control Rules for Spraying Pesticides on Crop Fields","authors":"Bruno S. Faiçal, G. Pessin, G. P. R. Filho, A. Carvalho, Gustavo Furquim, J. Ueyama","doi":"10.1109/ICTAI.2014.85","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.85","url":null,"abstract":"The use of pesticides in agriculture is essential to maintain the quality of large-scale production. The spraying of these products by using aircraft speeds up the process and prevents compacting of the soil. However, adverse weather conditions (e.g. The speed and direction of the wind) can impair the effectiveness of the spraying of pesticides in a target crop field. Thus, there is a risk that the pesticide can drift to neighboring crop fields. It is believed that a large amount of all the pesticide used in the world drifts outside of the target crop field and only a small amount is effective in controlling pests. However, with increased precision in the spraying, it is possible to reduce the amount of pesticide used and improve the quality of agricultural products as well as mitigate the risk of environmental damage. With this objective, this paper proposes a methodology based on Particle Swarm Optimization (PSO) for the fine-tuning of control rules during the spraying of pesticides in crop fields. This methodology can be employed with speed and efficiency and achieve good results by taking account of the weather conditions reported by a Wireless Sensor Network (WSN). In this scenario, the UAV becomes a mobile node of the WSN that is able to make personalized decisions for each crop field. The experiments that were carried out show that the optimization methodology proposed is able to reduce the drift of pesticides by fine-tuning of control rules.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133484584","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}

引用次数: 48

Maintaining Virtual Arc Consistency Dynamically during Search 在搜索过程中动态维护虚拟弧一致性

2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.13

Hiep Nguyen, S. D. Givry, T. Schiex, C. Bessiere

引用次数: 2

A Comparative Analysis of Two Multi-objective Evolutionary Algorithms in Product Line Architecture Design Optimization 两种多目标进化算法在生产线结构优化中的比较分析

2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.107

T. Colanzi, S. Vergilio

引用次数: 3

Ontology View Extraction: An Approach Based on Ontological Meta-properties 本体视图提取:基于本体元属性的方法

2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.28

Jose Lozano, J. Carbonera, Mara Abel, M. Pimenta

{"title":"Ontology View Extraction: An Approach Based on Ontological Meta-properties","authors":"Jose Lozano, J. Carbonera, Mara Abel, M. Pimenta","doi":"10.1109/ICTAI.2014.28","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.28","url":null,"abstract":"Ontologies have been applied in Computer Science to ensure the semantic interoperability among multiple systems. With the increasing of ontologies availability, many approaches for promoting the share and reuse of ontologies have been investigated in recent years, like ontology module extraction (modularization) and ontology view extraction. Approaches for ontology module extraction are used for extracting modules in large ontologies. On the other hand, ontology views have been used for providing to the user only the parts of the ontology that are useful for a given task. Thus, both ontology views and ontology modules encapsulate a subset of the original ontology, but they have different purposes. The literature has explored the ontological meta-properties (such as identity and rigidity) for guiding the modeling decisions that are made during the ontology engineering process. Some of these meta-properties were formalized in foundational ontologies like UFO (Unified foundational ontology). In this paper, we explore the use of ontological meta-properties for extracting ontology views. We propose a characterization of the notion of well-founded ontology view, considering the ontological meta-properties of the concepts. Besides that, we also propose a language-independent algorithm for sub-ontology extraction that is guided by ontological meta-properties. Finally, we present a case study for illustrating the application of our approach.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128950049","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}

引用次数: 16

The Cut Tool for QCSP QCSP的切割工具

2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.135

Vincent Barichard, I. Stéphan

{"title":"The Cut Tool for QCSP","authors":"Vincent Barichard, I. Stéphan","doi":"10.1109/ICTAI.2014.135","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.135","url":null,"abstract":"Quantified Constraint Satisfaction Problems (QCSP) are a generalization of Constraint Satisfaction Problems (CSP) in which variables may be quantified existentially and universally. QCSP offers a natural framework to express PSPACE problems as finite two-player games or planning under uncertainty. State-of-the-art QCSP solvers have an important drawback: they explore much larger combinatorial spaces than the natural search space of the original problem since they are unable to recognize that some sub-problems are necessarily true. We introduce a new tool, inspired by the cut rule of Prolog as a tool under responsibility of the designer of the QCSP, to prune those parts of the search space which are by construction known to be useless. We use this new tool to restore on one hand the annihilator property of true for disjunction in QCSP solver and, on the other hand, to prune the search space in two-player games. It is a simple solution to use efficiently QCSP to design finite two-player games without restricting the QCSP language. This tool does not need to modify the QCSP solver but has only one requirement: be able to tell the QCSP solver that the current QCSP is solved. Our QCSP solver built over Ge Code, a CSP library, obtained very good results compared to state-of-the-art QCSP solvers.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132400444","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

Agent Types and Adaptive Negotiation Strategies in Argumentation-Based Negotiation 基于论证的协商中的Agent类型与自适应协商策略

2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.79

M. Mbarki, O. Marey, J. Bentahar, Khalid Sultan

引用次数: 5

Designing an Optical Island in the Core Network: From Routing to Spectrum Allocation 核心网光岛设计:从路由到频谱分配

2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.90

D. Mehta, B. O’Sullivan, Cemalettin Ozturk, L. Quesada, H. Simonis

{"title":"Designing an Optical Island in the Core Network: From Routing to Spectrum Allocation","authors":"D. Mehta, B. O’Sullivan, Cemalettin Ozturk, L. Quesada, H. Simonis","doi":"10.1109/ICTAI.2014.90","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.90","url":null,"abstract":"We consider a network design problem arising in the development of an all-optical future generation Internet network called a flex-grid. An optical island is a set of core nodes that can be fully interconnected by transparent wavelength routes. We present a mathematical model for finding an optimal optical island, show that it is an NP-hard problem, and present a decomposition for solving it. In a first phase, we choose network links and route the traffic over the resulting network. In the second phase, we allocate the light-paths associated with the traffic requests to individual fibres and spectrum segments on the fibres. This so-called routing and spectrum assignment (RSA) problem is a generalisation of the well-known routing and wavelength assignment problem (RWA) of conventional optical networks. Flex-grid optical networks allow us to bundle higher capacity connection requests by allocating channels in a number of contiguous frequency slots, providing increased throughput, as long as the connection length is below technological limits. We solve the first part of the decomposition with a large neighborhood search, and the second with a CP model using a single GEOST global constraint. Results for Ireland and Italy show that solutions of high quality can be found by this decomposition.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127954088","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}

引用次数: 7

Model-Based Anomaly Detection for Discrete Event Systems 基于模型的离散事件系统异常检测

2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.105

Timo Klerx, Maik Anderka, H. K. Büning, Steffen Priesterjahn

引用次数: 22

Linear Logic as a Tool for Deadlock-Freeness Scenarios Detection in Interorganizational Workflow Processes 线性逻辑作为组织间工作流中死锁无场景检测的工具

2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.55

L. Passos, S. Julia

引用次数: 5