Miguel Ángel Ríos Gaona, Alexander Gelbukh, Sivaji Bandyopadhyay
{"title":"Web-Based Variant of the Lesk Approach to Word Sense Disambiguation","authors":"Miguel Ángel Ríos Gaona, Alexander Gelbukh, Sivaji Bandyopadhyay","doi":"10.1109/MICAI.2009.41","DOIUrl":"https://doi.org/10.1109/MICAI.2009.41","url":null,"abstract":"Word Sense Disambiguation (WSD) is the task of selecting the meaning of a word based on the context in which the word occurs. The principal statistical WSD approaches are supervised and unsupervised learning. The Lesk method is an example of unsupervised disambiguation. We present a measure for sense assignment useful for the simple Lesk algorithm. We use word co-occurrences of the gloss and the context, which is statistical information retrieved from the Web. In the SemCor data our method always gives an answer. On the Senseval 2 data, our variant of the Lesk method outperformed some other Lesk-based methods.","PeriodicalId":412103,"journal":{"name":"2009 Eighth Mexican International Conference on Artificial Intelligence","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125326114","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}
L. Méndez, Christian A. Ramírez-Bejarano, Griselda Ortíz-Alvarado, C. A. D. Alba-Padilla
{"title":"A Fast Color Synthesis Algorithm Using the l-α-β Color Space and a Non-parametric MRF Model","authors":"L. Méndez, Christian A. Ramírez-Bejarano, Griselda Ortíz-Alvarado, C. A. D. Alba-Padilla","doi":"10.1109/MICAI.2009.18","DOIUrl":"https://doi.org/10.1109/MICAI.2009.18","url":null,"abstract":"We present a fast method for adding color to grayscale images. The method uses a statistical learning approachbased on changes in intensity to color by example. Typically, these approaches take a considerable amount of time, proportional to the image size. To reduce the computational time, we propose a framework that first obtains a synthesized color image of a scaled version of the input grayscale image. Then, it scales up the synthesized color together with the high-frequencies (luminance) of the image original size by using the l-alpha-beta color space. Preliminary results on a set of nature images are shown.","PeriodicalId":412103,"journal":{"name":"2009 Eighth Mexican International Conference on Artificial Intelligence","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132745057","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}
Pedro Quiz-Ramos, J. Torres-Jiménez, Nelson Rangel-Valdez
{"title":"Constant Row Maximizing Problem for Covering Arrays","authors":"Pedro Quiz-Ramos, J. Torres-Jiménez, Nelson Rangel-Valdez","doi":"10.1109/MICAI.2009.28","DOIUrl":"https://doi.org/10.1109/MICAI.2009.28","url":null,"abstract":"A Covering Array denoted by CA(N;t,k,v) is a matrix of size N^k, where each tuple of t columns has at least one time each v^t combination of symbols. The CAs are combinatorial objects used for software testing and design of experiments in: biology, agriculture, medicine, etc. CAs can be constructed using heuristic algorithms, greedy search and algebraic procedures. The Hartman Style Rising Procedures (HSRP) are algebraic procedures to construct large CAs. These procedures create CAs using small CAs to construct large CAs. If the small $CA$s have many constant rows, the HSRP provides better large CAs. In this paper we present the constant Row Maximizing Problem (CMRP). We propose 4 distinct models to maximize the number of constant rows in a CA. The models were tested with binary and senary CAs. Our results give new upper bounds for large CAs.","PeriodicalId":412103,"journal":{"name":"2009 Eighth Mexican International Conference on Artificial Intelligence","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117308849","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}
{"title":"An Optimal Fuzzy Self-Tuning PID Controller for Robot Manipulators via Genetic Algorithm","authors":"Jose Luis Meza, R. Soto, J. Arriaga","doi":"10.1109/MICAI.2009.34","DOIUrl":"https://doi.org/10.1109/MICAI.2009.34","url":null,"abstract":"This paper deals with the problem of optimizing a fuzzy self-tuning PID controller for robot manipulators. Fuzzy PID controllers have been developed and applied in many fields in the last fifteen years. However, there is no systematic method to design Membership Functions (MFs) for these controllers. We propose a simple method based on Genetic Algorithms (GA) to find optimal input and output MFs of a fuzzy selftuning PID controller. The stability via Lyapunov theory for the closed loop control system is also analyzed and shown that is asymptotically stable for a class of gain matrices depending on the manipulator states. To show the usefulness of the proposed approach, simulation results using a two degree of freedom robot arm are presented.","PeriodicalId":412103,"journal":{"name":"2009 Eighth Mexican International Conference on Artificial Intelligence","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124433488","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}
I. Escamilla, P. Perez, L. Torres, P. Zambrano, B. Gonzalez
{"title":"Optimization Using Neural Network Modeling and Swarm Intelligence in the Machining of Titanium (Ti 6Al 4V) Alloy","authors":"I. Escamilla, P. Perez, L. Torres, P. Zambrano, B. Gonzalez","doi":"10.1109/MICAI.2009.22","DOIUrl":"https://doi.org/10.1109/MICAI.2009.22","url":null,"abstract":"The process of titanium’s machining in the aerospace industry today is by trial and error, it produce non efficient results, because this material is classified by the high chemical reaction with other materials and its low thermal conductivity such as a difficult to machine, so the process of finding the correct parameters for machining are hard to determine, and today researchers are looking to develop new models to predict and optimize these parameters. A recently developed optimization algorithm called particle swarm optimization is used to find optimum process parameters.Accordingly, the results indicate that a system where neural network is used to model and predict process outputs and particle swarm optimization is used to obtain optimum process parameters can be successfully applied to multi-objective optimization of titanium’s machining process","PeriodicalId":412103,"journal":{"name":"2009 Eighth Mexican International Conference on Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129489986","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}
A. P. Palma, Richard Harvey, J. M. Aguilar, Luis Rodrigo Valencia Pérez, A. L. Alvarez
{"title":"Image Retrieval Using Sieve Complement Trees","authors":"A. P. Palma, Richard Harvey, J. M. Aguilar, Luis Rodrigo Valencia Pérez, A. L. Alvarez","doi":"10.1109/MICAI.2009.29","DOIUrl":"https://doi.org/10.1109/MICAI.2009.29","url":null,"abstract":"This paper is about scale-space image trees. We introduce here a variant of the sieve algorithm to produce sieve complement trees where not only extremal regions are characterized but also their corresponding complements. Different simplification methods can transform (or prune) the hierarchy into a simpler form where the remaining nodes represent regions that are noticeably different from their neighbourhood, and that are traditionally known in the literature as \"Salient Regions\". Although, the resulting scale-space tree hierarchy, can not strictly be defined as a segmentation, its associated signal (a simplified image of the original), can be used for content based image retrieval (CBIR) similarly to a segmentation. Here, we present the resulting retrieval precision rates of testing our trees into three widely known image datasets. Our results confirm the premise that complementary regions can contribute to improve image retrieval rates.","PeriodicalId":412103,"journal":{"name":"2009 Eighth Mexican International Conference on Artificial Intelligence","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127455799","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}
{"title":"Solving Employee Timetabling in a Call Center of a Telecommunications Company in Mexico with Simulated Annealing","authors":"Nelson Rangel-Valdez, J. Torres-Jiménez","doi":"10.1109/MICAI.2009.14","DOIUrl":"https://doi.org/10.1109/MICAI.2009.14","url":null,"abstract":"Timetabling is a problem that arises in many application areas such as telecommunications. Call-Center enterprises are companies that search for schedules that minimize the resources spent to attend customer calls. Given that the constraints to create an acceptable schedule vary from one call center to another, it is not possible to find a polynomial time algorithm that fits the requirements of all cases. In this paper is presented a case of study of the Employee Timetabling in a Call Center (ETCC) of a telecommunications company in Mexico. ETCC instances were solved using an implementation of a Simulated Annealing (SA) algorithm. The best values for the parameters of the SA were defined in a tuning phase based on Covering Arrays (CA). The results show an improvement of 19% between the solution achieved by the SA and a lower bound known for an instance of ETCC problem.","PeriodicalId":412103,"journal":{"name":"2009 Eighth Mexican International Conference on Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130880874","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}
{"title":"A Reactive Constraint Programming Formulation","authors":"É. Monfroy, Carlos Castro, Broderick Crawford","doi":"10.1109/MICAI.2009.33","DOIUrl":"https://doi.org/10.1109/MICAI.2009.33","url":null,"abstract":"Constraint Programming is a powerful paradigm for solving Combinatorial Problems. In this solver approach, Enumeration Strategies are crucial for resolution performances. In a previous work, we proposed a framework to reactively change strategies showing bad performances, and to use metabacktracks to restore better states when bad decisions were made. In this paper, we design and evaluate strategies to improve resolution performances of a set of problems. Experimental results show the effectiveness of our approach.","PeriodicalId":412103,"journal":{"name":"2009 Eighth Mexican International Conference on Artificial Intelligence","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124495366","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}
{"title":"Computational Method for Claim Portfolio Valuation","authors":"Tomasz Kajdanowicz, Przemyslaw Kazienko","doi":"10.1109/MICAI.2009.27","DOIUrl":"https://doi.org/10.1109/MICAI.2009.27","url":null,"abstract":"The paper presents method of hybrid prediction system for debt portfolio appraisal. Based on the local area competence, time spread repayment values are predicted by means of hybrid combination of various machine learning techniques. The above methods include among others clustering of references, model selection and enrichment of input variables with prediction outputs from preceding periods. Experimental studies concern the method’s configuration influence on its general performance such as number of distinct predictors and number of competence areas.","PeriodicalId":412103,"journal":{"name":"2009 Eighth Mexican International Conference on Artificial Intelligence","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130407188","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}
S. Villarreal, Lorena Martínez Elizalde, Adriana Canseco Viveros
{"title":"Clustering Hyperlinks for Topic Extraction: An Exploratory Analysis","authors":"S. Villarreal, Lorena Martínez Elizalde, Adriana Canseco Viveros","doi":"10.1109/MICAI.2009.20","DOIUrl":"https://doi.org/10.1109/MICAI.2009.20","url":null,"abstract":"In a Web of increasing size and complexity, a key issue is automatic document organization, which includes topic extraction in collections. Since we consider topics as document clusters with semantic properties, we are concerned with exploring suitable clustering techniques for their identification on hyperlinked environments (where we only regard structural information). For this purpose, three algorithms (PDDP, k-means, and graph local clustering) were executed over a document subset of an increasingly popular corpus: Wikipedia. Results were evaluated with unsupervised metrics (cosine similarity, semantic relatedness, Jaccard index) and suggest that promising results can be produced for this particular domain.","PeriodicalId":412103,"journal":{"name":"2009 Eighth Mexican International Conference on Artificial Intelligence","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128017281","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}