Adv. Artif. Intell.最新文献

iWordNet: A New Approach to Cognitive Science and Artificial Intelligence iWordNet:认知科学与人工智能的新途径

Adv. Artif. Intell. Pub Date : 2017-10-11 DOI: 10.1155/2017/1948317

Mark Chang, Monica Chang

{"title":"iWordNet: A New Approach to Cognitive Science and Artificial Intelligence","authors":"Mark Chang, Monica Chang","doi":"10.1155/2017/1948317","DOIUrl":"https://doi.org/10.1155/2017/1948317","url":null,"abstract":"One of the main challenges in artificial intelligence or computational linguistics is understanding the meaning of a word or concept. We argue that the connotation of the term “understanding,” or the meaning of the word “meaning,” is merely a word mapping game due to unavoidable circular definitions. These circular definitions arise when an individual defines a concept, the concepts in its definition, and so on, eventually forming a personalized network of concepts, which we call an iWordNet. Such an iWordNet serves as an external representation of an individual’s knowledge and state of mind at the time of the network construction. As a result, “understanding” and knowledge can be regarded as a calculable statistical property of iWordNet topology. We will discuss the construction and analysis of the iWordNet, as well as the proposed “Path of Understanding” in an iWordNet that characterizes an individual’s understanding of a complex concept such as a written passage. In our pilot study of 20 subjects we used a regression model to demonstrate that the topological properties of an individual’s iWordNet are related to his IQ score, a relationship that suggests iWordNets as a potential new methodology to studying cognitive science and artificial intelligence.","PeriodicalId":7253,"journal":{"name":"Adv. Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88894719","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

Natural Language Processing and Fuzzy Tools for Business Processes in a Geolocation Context 地理位置环境下业务流程的自然语言处理和模糊工具

Adv. Artif. Intell. Pub Date : 2017-05-24 DOI: 10.1155/2017/9462457

I. Truck, Mohammed-Amine Abchir

引用次数: 3

Method for Solving LASSO Problem Based on Multidimensional Weight 基于多维权值的LASSO问题求解方法

Adv. Artif. Intell. Pub Date : 2017-05-04 DOI: 10.1155/2017/1736389

Chunrong Chen, S. Chen, Chen Lin, Yuchen Zhu

{"title":"Method for Solving LASSO Problem Based on Multidimensional Weight","authors":"Chunrong Chen, S. Chen, Chen Lin, Yuchen Zhu","doi":"10.1155/2017/1736389","DOIUrl":"https://doi.org/10.1155/2017/1736389","url":null,"abstract":"In the data mining, the analysis of high-dimensional data is a critical but thorny research topic. The LASSO (least absolute shrinkage and selection operator) algorithm avoids the limitations, which generally employ stepwise regression with information criteria to choose the optimal model, existing in traditional methods. The improved-LARS (Least Angle Regression) algorithm solves the LASSO effectively. This paper presents an improved-LARS algorithm, which is constructed on the basis of multidimensional weight and intends to solve the problems in LASSO. Specifically, in order to distinguish the impact of each variable in the regression, we have separately introduced part of principal component analysis (Part_PCA), Independent Weight evaluation, and CRITIC, into our proposal. We have explored that these methods supported by our proposal change the regression track by weighted every individual, to optimize the approach direction, as well as the approach variable selection. As a consequence, our proposed algorithm can yield better results in the promise direction. Furthermore, we have illustrated the excellent property of LARS algorithm based on multidimensional weight by the Pima Indians Diabetes. The experiment results show an attractive performance improvement resulting from the proposed method, compared with the improved-LARS, when they are subjected to the same threshold value.","PeriodicalId":7253,"journal":{"name":"Adv. Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81968041","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

Selection and Configuration of Sorption Isotherm Models in Soils Using Artificial Bees Guided by the Particle Swarm 粒子群引导下人工蜜蜂对土壤吸附等温线模型的选择与配置

Adv. Artif. Intell. Pub Date : 2017-01-01 DOI: 10.1155/2017/3497652

T. V. Bharat

{"title":"Selection and Configuration of Sorption Isotherm Models in Soils Using Artificial Bees Guided by the Particle Swarm","authors":"T. V. Bharat","doi":"10.1155/2017/3497652","DOIUrl":"https://doi.org/10.1155/2017/3497652","url":null,"abstract":"A precise estimation of isotherm model parameters and selection of isotherms from the measured data are essential for the fate and transport of toxic contaminants in the environment. Nonlinear least-square techniques are widely used for fitting the isotherm model on the experimental data. However, such conventional techniques pose several limitations in the parameter estimation and the choice of appropriate isotherm model as shown in this paper. It is demonstrated in the present work that the classical deterministic techniques are sensitive to the initial guess and thus the performance is impeded by the presence of local optima. A novel solver based on modified artificial bee-colony (MABC) algorithm is proposed in this work for the selection and configuration of appropriate sorption isotherms. The performance of the proposed solver is compared with the other three solvers based on swarm intelligence for model parameter estimation using measured data from 21 soils. Performance comparison of developed solvers on the measured data reveals that the proposed solver demonstrates excellent convergence capabilities due to the superior exploration-exploitation abilities. The estimated solutions by the proposed solver are almost identical to the mean fitness values obtained over 20 independent runs. The advantages of the proposed solver are presented.","PeriodicalId":7253,"journal":{"name":"Adv. Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77718688","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

Weighted Constraint Satisfaction for Smart Home Automation and Optimization 智能家居自动化与优化的加权约束满足

Adv. Artif. Intell. Pub Date : 2016-11-01 DOI: 10.1155/2016/2959508

Nuo Wi Noel Tay, János Botzheim, N. Kubota

{"title":"Weighted Constraint Satisfaction for Smart Home Automation and Optimization","authors":"Nuo Wi Noel Tay, János Botzheim, N. Kubota","doi":"10.1155/2016/2959508","DOIUrl":"https://doi.org/10.1155/2016/2959508","url":null,"abstract":"Automation of the smart home binds together services of hardware and software to provide support for its human inhabitants. The rise of web technologies offers applicable concepts and technologies for service composition that can be exploited for automated planning of the smart home, which can be further enhanced by implementation based on service oriented architecture SOA. SOA supports loose coupling and late binding of devices, enabling a more declarative approach in defining services and simplifying home configurations. One such declarative approach is to represent and solve automated planning through constraint satisfaction problem CSP, which has the advantage of handling larger domains of home states. But CSP uses hard constraints and thus cannot perform optimization and handle contradictory goals and partial goal fulfillment, which are practical issues smart environments will face if humans are involved. This paper extends this approach to Weighted Constraint Satisfaction Problem WCSP. Branch and bound depth first search is used, where its lower bound is estimated by bacterial memetic algorithm BMA on a relaxed version of the original optimization problem. Experiments up to 16-step planning of home services demonstrate the applicability and practicality of the approach, with the inclusion of local search for trivial service combinations in BMA that produces performance enhancements. Besides, this work aims to set the groundwork for further research in the field.","PeriodicalId":7253,"journal":{"name":"Adv. Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79030067","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

Twin Support Vector Machine for Multiple Instance Learning Based on Bag Dissimilarities 基于袋不相似度的双支持向量机多实例学习

Adv. Artif. Intell. Pub Date : 2016-08-01 DOI: 10.1155/2016/1269708

Divya Tomar, Sonali Agarwal

引用次数: 3

Effect of Collaborative Recommender System Parameters: Common Set Cardinality and the Similarity Measure 协同推荐系统参数的影响:公共集基数和相似度度量

Adv. Artif. Intell. Pub Date : 2016-06-01 DOI: 10.1155/2016/9386368

Mohammad Yahya H. Al-Shamri

{"title":"Effect of Collaborative Recommender System Parameters: Common Set Cardinality and the Similarity Measure","authors":"Mohammad Yahya H. Al-Shamri","doi":"10.1155/2016/9386368","DOIUrl":"https://doi.org/10.1155/2016/9386368","url":null,"abstract":"Recommender systems are widespread due to their ability to help Web users surf the Internet in a personalized way. For example, collaborative recommender system is a powerful Web personalization tool for suggesting many useful items to a given user based on opinions collected from his neighbors. Among many, similarity measure is an important factor affecting the performance of the collaborative recommender system. However, the similarity measure itself largely depends on the overlapping between the user profiles. Most of the previous systems are tested on a predefined number of common items and neighbors. However, the system performance may vary if we changed these parameters. The main aim of this paper is to examine the performance of the collaborative recommender system under many similarity measures, common set cardinalities, rating mean groups, and neighborhood set sizes. For this purpose, we propose a modified version for the mean difference weight similarity measure and a new evaluation metric called users’ coverage for measuring the recommender system ability for helping users. The experimental results show that the modified mean difference weight similarity measure outperforms other similarity measures and the collaborative recommender system performance varies by varying its parameters; hence we must specify the system parameters in advance.","PeriodicalId":7253,"journal":{"name":"Adv. Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91378264","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

Automatic Representation and Segmentation of Video Sequences via a Novel Framework Based on the nD-EVM and Kohonen Networks 基于nD-EVM和Kohonen网络的视频序列自动表示与分割

Adv. Artif. Intell. Pub Date : 2016-03-02 DOI: 10.1155/2016/6361237

José-Yovany Luis-García, R. Pérez-Aguila

{"title":"Automatic Representation and Segmentation of Video Sequences via a Novel Framework Based on the nD-EVM and Kohonen Networks","authors":"José-Yovany Luis-García, R. Pérez-Aguila","doi":"10.1155/2016/6361237","DOIUrl":"https://doi.org/10.1155/2016/6361237","url":null,"abstract":"Recently in the Computer Vision field, a subject of interest, at least in almost every video application based on scene content, is video segmentation. Some of these applications are indexing, surveillance, medical imaging, event analysis, and computer-guided surgery, for naming some of them. To achieve their goals, these applications need meaningful information about a video sequence, in order to understand the events in its corresponding scene. Therefore, we need semantic information which can be obtained from objects of interest that are present in the scene. In order to recognize objects we need to compute features which aid the finding of similarities and dissimilarities, among other characteristics. For this reason, one of the most important tasks for video and image processing is segmentation. The segmentation process consists in separating data into groups that share similar features. Based on this, in this work we propose a novel framework for video representation and segmentation. The main workflow of this framework is given by the processing of an input frame sequence in order to obtain, as output, a segmented version. For video representation we use the Extreme Vertices Model in the -Dimensional Space while we use the Discrete Compactness descriptor as feature and Kohonen Self-Organizing Maps for segmentation purposes.","PeriodicalId":7253,"journal":{"name":"Adv. Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87292636","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

Efficacious Discriminant Analysis (Classifier) Measures for End Users 针对终端用户的有效判别分析(分类器)措施

Adv. Artif. Intell. Pub Date : 2016-01-01 DOI: 10.1155/2016/8173625

E. Eiland, L. Liebrock

引用次数: 0

Impacts of the Load Models on Optimal Planning of Distributed Generation in Distribution System 负荷模型对配电系统分布式发电优化规划的影响

Adv. Artif. Intell. Pub Date : 2015-01-01 DOI: 10.1155/2015/297436

Aashish Kumar Bohre, G. Agnihotri, Manisha Dubey, S. Kalambe

{"title":"Impacts of the Load Models on Optimal Planning of Distributed Generation in Distribution System","authors":"Aashish Kumar Bohre, G. Agnihotri, Manisha Dubey, S. Kalambe","doi":"10.1155/2015/297436","DOIUrl":"https://doi.org/10.1155/2015/297436","url":null,"abstract":"The optimal planning (sizing and siting) of the distributed generations (DGs) by using butterfly-PSO/BF-PSO technique to investigate the impacts of load models is presented in this work. The validity of the evaluated results is confirmed by comparing with well-known Genetic Algorithm (GA) and standard or conventional particle swarm optimization (PSO). To exhibit its compatibility in terms of load management, an impact of different load models on the size and location of DG has also been presented in this work. The fitness evolution function explored is the multiobjective function (FMO), which is based on the three significant indexes such as active power loss, reactive power loss, and voltage deviation index. The optimal solution is obtained by minimizing the multiobjective fitness function using BF-PSO, GA, and PSO technique. The comparison of the different optimization techniques is given for the different types of load models such as constant, industrial, residential, and commercial load models. The results clearly show that the BF-PSO technique presents the superior solution in terms of compatibility as well as computation time and efforts both. The algorithm has been carried out with 15-bus radial and 30-bus mesh system.","PeriodicalId":7253,"journal":{"name":"Adv. Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76573983","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