2012 IEEE 24th International Conference on Tools with Artificial Intelligence最新文献

筛选
英文 中文
Inference Rules in Local Search for Max-SAT Max-SAT局部搜索中的推理规则
André Abramé, Djamal Habet
{"title":"Inference Rules in Local Search for Max-SAT","authors":"André Abramé, Djamal Habet","doi":"10.1109/ICTAI.2012.36","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.36","url":null,"abstract":"In the last years, many advances were accomplished in the exact solving of the Max-SAT problem, especially by the definition of new inference rules and a better estimation of lower bounds in branch and bound based methods. However, and oppositely to the SAT problem, fewer works exist on approximate methods for Max-SAT, mainly local search ones which have shown their potency for SAT. In this paper, we illustrate that including inference rules in a classical local search solver for SAT improves its performances when solving the Max-SAT problem. The obtained results confirm the efficiency of our approach.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133982928","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}
引用次数: 9
Data Selection Using Decision Tree for SVM Classification 基于决策树的支持向量机分类数据选择
2012 IEEE 24th International Conference on Tools with Artificial Intelligence Pub Date : 2012-11-07 DOI: 10.1109/ICTAI.2012.105
A. L. Chau, L. López-García, Jair Cervantes, Xiaoou Li, Wen Yu
{"title":"Data Selection Using Decision Tree for SVM Classification","authors":"A. L. Chau, L. López-García, Jair Cervantes, Xiaoou Li, Wen Yu","doi":"10.1109/ICTAI.2012.105","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.105","url":null,"abstract":"Support Vector Machine (SVM) is an important classification method used in a many areas. The training of SVM is almost O(n^{2}) in time and space. Some methods to reduce the training complexity have been proposed in last years. Data selection methods for SVM select most important examples from training data sets to improve its training time. This paper introduces a novel data reduction method that works detecting clusters and then selects some examples from them. Different from other state of the art algorithms, the novel method uses a decision tree to form partitions that are treated as clusters, and then executes a guided random selection of examples. The clusters discovered by a decision tree can be linearly separable, taking advantage of the Eidelheit separation theorem, it is possible to reduce the size of training sets by carefully selecting examples from training sets. The novel method was compared with LibSVM using public available data sets, experiments demonstrate an important reduction of the size of training sets whereas showing only a slight decreasing in the accuracy of classifier.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127801175","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}
引用次数: 10
Revising the Outputs of a Decision Tree with Expert Knowledge: Application to Intrusion Detection and Alert Correlation 用专家知识修正决策树的输出:在入侵检测和警报关联中的应用
S. Benferhat, Abdelhamid Boudjelida, Karim Tabia
{"title":"Revising the Outputs of a Decision Tree with Expert Knowledge: Application to Intrusion Detection and Alert Correlation","authors":"S. Benferhat, Abdelhamid Boudjelida, Karim Tabia","doi":"10.1109/ICTAI.2012.68","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.68","url":null,"abstract":"Classifiers are well-known and efficient techniques used to predict the class of items descrided by a set of features. In many applications, it is important to take into account some extra knowledge in addition to the one encoded by the classifier. For example, in spam filtering which can be seen as a classification problem, it can make sense for a user to require that the spam filter predicts less than a given rate or number of spams. In this paper, we propose an approach allowing to combine expert knowledge with the results of a decision tree classifier. More precisely, we propose to revise the outputs of a decision tree in order to take into account the available expert knowledge. Our approach can be applied for any classifier where a probability distribution over the set of classes (or decisions) can be estimated from the output of the classification step. In this work, we analyze the advantage of adding expert knowledge to decision tree classifiers in the context of intrusion detection and alert correlation. In particular, we study how additional expert knowledge such as \"it is expected that 80% of traffic will be normal\" can be integrated in classification tasks. Our aim is to revise classifiers' outputs in order to fit the expert knowledge. Experimental studies on intrusion detection and alert correlation problems show that our approach improves the performances on different benchmarks.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131666966","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
Evaluation of a Cascade Hybrid Recommendation as a Combination of One-Class Classification and Collaborative Filtering 一类分类与协同过滤相结合的级联混合推荐评价
A. S. Lampropoulos, Dionisios N. Sotiropoulos, G. Tsihrintzis
{"title":"Evaluation of a Cascade Hybrid Recommendation as a Combination of One-Class Classification and Collaborative Filtering","authors":"A. S. Lampropoulos, Dionisios N. Sotiropoulos, G. Tsihrintzis","doi":"10.1109/ICTAI.2012.96","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.96","url":null,"abstract":"This paper decomposes the problem of recommendation into a two level cascade recommendation scheme which benefits from both content-based and collaborative filtering methodologies. The first level utilizes the content-based features of items in order to incorporate the individualized (subjective) user preferences within the recommendation process. This is achieved through the exploitation of the one-class classification paradigm which provides the means in order to filter out user specific undesirable items. The second level, on the other hand, serves the purpose of assigning particular rating degrees to the user-specific desirable items identified by the first level. The combination of two approaches in a cascade form, mimics the social process when someone has selected some items according to his preferences and asks for opinions about these by others, in order to achieve the best selection. Our experimentation provides significant evidence on the recommendation efficiency of the adapted hybrid approach which outperforms pure content-based and pure collaborative techniques.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133845526","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}
引用次数: 6
A Comparison of CP, IP, and SAT Solvers through a Common Interface CP、IP和SAT求解器在通用接口上的比较
Neng-Fa Zhou, Masato Tsuru, E. Nobuyama
{"title":"A Comparison of CP, IP, and SAT Solvers through a Common Interface","authors":"Neng-Fa Zhou, Masato Tsuru, E. Nobuyama","doi":"10.1109/ICTAI.2012.15","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.15","url":null,"abstract":"This paper presents a common interface for Prolog to three different types of discrete solvers including Constraint Programming (CP), Integer Programming (IP), and SAT solvers. The interface comprises primitives for creating decision variables, specifying constraints, and invoking a solver, possibly with an objective function to be optimized. Before a solver is actually called, the accumulated variables and constraints are transformed into a form acceptable to the solver. For a SAT solver, in particular, variables are Booleanized and constraints are compiled into CNF. Implemented in B-Prolog, the interface allows the programmer to use the features of the host language such as recursion, pattern matching, arrays, and loops to describe problems. The interface provides an easy and uniform platform for exploring different solvers and models. This paper compares the performance of the CLP(FD) of B-Prolog, the CPLEX IP solver, and the Lingeling SAT solver on several problems through the same interface and for each problem it compares a model that uses Boolean variables and another model that uses general integer variables. Our experience tells that it is effortless to switch from one solver to another.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123541362","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}
引用次数: 6
Compiling CSPs: A Complexity Map of (Non-Deterministic) Multivalued Decision Diagrams 编译csp:(不确定性)多值决策图的复杂性图
2012 IEEE 24th International Conference on Tools with Artificial Intelligence Pub Date : 2012-11-07 DOI: 10.1142/S021821301460015X
J. Amilhastre, H. Fargier, Alexandre Niveau, C. Pralet
{"title":"Compiling CSPs: A Complexity Map of (Non-Deterministic) Multivalued Decision Diagrams","authors":"J. Amilhastre, H. Fargier, Alexandre Niveau, C. Pralet","doi":"10.1142/S021821301460015X","DOIUrl":"https://doi.org/10.1142/S021821301460015X","url":null,"abstract":"Constraint Satisfaction Problems (CSPs) offer a powerful framework for representing a great variety of problems. The difficulty is that most of the requests associated with CSPs are NP-hard. As these requests must be addressed online, Multivalued Decision Diagrams (MDDs) have been proposed as a way to compile CSPs. In the present paper, we draw a compilation map of MDDs, in the spirit of the NNF compilation map, analyzing MDDs according to their succinctness and to their playtime transformations and queries. Deterministic ordered MDDs are a generalization of ordered binary decision diagrams to non-Boolean domains: unsurprisingly, they have similar capabilities. More interestingly, our study puts forward the interest of non-deterministic ordered MDDs: when restricted to Boolean domains, this fragment captures OBDD and DNF as proper subsets and has performances close to those of DNNF. The comparison to classical, deterministic MDDs shows that relaxing the determinism requirement leads to an increase in succinctness and allows more transformations to be satisfied in polytime (typically, the disjunctive ones). Experiments on random problems confirm the gain in succinctness.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129789884","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}
引用次数: 22
Comparative Study of FOREX Trading Systems Built with SVR+GHSOM and Genetic Algorithms Optimization of Technical Indicators 基于SVR+GHSOM的外汇交易系统与遗传算法优化技术指标的比较研究
Rodrigo F. B. de Brito, Adriano Oliveira
{"title":"Comparative Study of FOREX Trading Systems Built with SVR+GHSOM and Genetic Algorithms Optimization of Technical Indicators","authors":"Rodrigo F. B. de Brito, Adriano Oliveira","doi":"10.1109/ICTAI.2012.55","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.55","url":null,"abstract":"Considerable effort has been made by researchers from various areas of science to forecast financial time series such as stock market and foreign exchange market (Forex). Recent studies have shown that the market can be outperformed by trading systems built with computational intelligence techniques. This study applies the Genetic Algorithm (GA) technique to optimize technical indicators parameters in order to maximize profit in the nine most tradable foreign exchange rates. Fifteen trading systems were created by combining four technical indicators optimized by the GA. It is then compared to an SVR+GHSOM model trading system and an analysis is performed to assess the most adaptable model in a period of international economic crisis. We report in the experiments that the GA model was far superior compared to the SVR+GHSOM model in the test period. The comparison considered performance measures such as profitability (ROI) and the maximum draw down (MD). The experiments have also shown that it is possible to increase profit by adjusting the risk parameter (lots size), at the expense of increasing the risk.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129332991","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
A Novel Prototype Tool for Intelligent Software Project Scheduling and Staffing Enhanced with Personality Factors 一种基于人格因素的智能软件项目调度与人员配置原型工具
Constantinos Stylianou, Simos Gerasimou, A. Andreou
{"title":"A Novel Prototype Tool for Intelligent Software Project Scheduling and Staffing Enhanced with Personality Factors","authors":"Constantinos Stylianou, Simos Gerasimou, A. Andreou","doi":"10.1109/ICTAI.2012.45","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.45","url":null,"abstract":"Software project managers are often faced with challenges when trying to effectively staff and schedule projects. Incorrectly planning and estimating the execution of tasks frequently causes software projects to be delivered late and/or over budget, whereas not selecting the appropriate developers to carry out tasks may produce lower-quality, defective software products. To combat these challenges, this paper presents IntelliSPM -- a tool aiming to support software project management activities consisting of several optimization mechanisms borrowed from the area of Computational Intelligence. The tool takes into account technical aspects but also significant human factors, which have been found to play a crucial role in software quality and developer productivity. The purpose of IntelliSPM is to offer suggestions to project managers containing a set of possible project schedules and staffing strategies that minimizes duration and maximizes resource usage. Several simulated and real-world projects were used during the validation process, with results showing that IntelliSPM is capable of providing that much-needed practical benefit to software companies to improve various aspects of development, such as performance and job satisfaction, whilst keeping within the general objectives and particular constraints of each software project.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130544570","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}
引用次数: 24
Ranking and Selecting Association Rules Based on Dominance Relationship 基于优势关系的关联规则排序与选择
S. Bouker, Rabie Saidi, S. Yahia, E. Nguifo
{"title":"Ranking and Selecting Association Rules Based on Dominance Relationship","authors":"S. Bouker, Rabie Saidi, S. Yahia, E. Nguifo","doi":"10.1109/ICTAI.2012.94","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.94","url":null,"abstract":"The huge number of association rules represent the main hamper that a decision maker faces. In order to bypass this hamper, an efficient selection of rules has to be performed. Since selection is necessarily based on evaluation, many interestingness measures have been proposed. However, the abundance of these measures gave rise to a new problem, namely the heterogeneity of the evaluation results and this created confusion to the decision. In this respect, we propose a novel approach to discover interesting association rules without favoring or excluding any measure by adopting the notion of dominance between association rules. Our approach bypasses the problem of measure heterogeneity and unveils a compromise between their evaluations. Interestingly enough, the proposed approach also avoids another non-trivial problem which is the threshold value specification.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132869254","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}
引用次数: 37
Three Approaches to Solve the Petrobras Challenge: Exploiting Planning Techniques for Solving Real-Life Logistics Problems 解决Petrobras挑战的三种方法:利用规划技术解决现实生活中的物流问题
D. Toropila, Filip Dvorak, Otakar Trunda, Martin Hanes, R. Barták
{"title":"Three Approaches to Solve the Petrobras Challenge: Exploiting Planning Techniques for Solving Real-Life Logistics Problems","authors":"D. Toropila, Filip Dvorak, Otakar Trunda, Martin Hanes, R. Barták","doi":"10.1109/ICTAI.2012.34","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.34","url":null,"abstract":"The Petrobras domain is an abstraction of a real-life problem of resource-efficient transportation of goods from ports to petroleum platforms. Being a good example of a difficult problem standing on the borderline between planning and scheduling, this domain was proposed as a challenge problem at the International Competition on Knowledge Engineering for Planning and Scheduling (ICKEPS 2012). In this paper we describe three different ways of modeling and solving this domain: by utilizing classical planning, temporal planning, and finally, single-player games and Monte-Carlo Tree Search.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121310870","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}
引用次数: 12
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学术官方微信