{"title":"A new method for mining optimal formula from curative data of new Chinese medicine","authors":"Zhenggui Xiang","doi":"10.1109/ICCIMA.2003.1238145","DOIUrl":"https://doi.org/10.1109/ICCIMA.2003.1238145","url":null,"abstract":"In this paper, the author presents a new method for mining optimal formula from clinical curative data of new Chinese medicine. In our method, I first design the model of curative data based on time series analysis and feature extraction. Then, I get the integrated curative effect of ingredient formula with different prescription proportions according to the model. Finally, I mine the optimal formula of new Chinese medicine through the curative curve of prescription proportion. By experiment, my method is effective to this kind of combination optimization problems and is an application of time series analysis in Chinese medicine research.","PeriodicalId":385362,"journal":{"name":"Proceedings Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127960724","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":"Intelligent digital filmmaker DMP","authors":"Jinhong Shen, S. Miyazaki, T. Aoki, H. Yasuda","doi":"10.1109/ICCIMA.2003.1238137","DOIUrl":"https://doi.org/10.1109/ICCIMA.2003.1238137","url":null,"abstract":"This paper present a system designed to automate the production of digital movies with various visual effects like three-dimension (3D) animation, real image, and their composition. The system can understand an inputted screenplay through a parser then automatically translates it into a relevant motion picture under the direction of a virtual director in place of a human one. The virtual director uses cinematic knowledge to achieve user's intentions through knowledge-based approach. We discuss the design of such a system DMP and the results of its use. Video data is encoded in XML and tracked by the MPEG-7 standard.","PeriodicalId":385362,"journal":{"name":"Proceedings Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126830446","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}
Taoya Cheng, Deguang Cui, Zhimin Fan, Jie Zhou, Siwei Lu
{"title":"A new model to forecast the results of matches based on hybrid neural networks in the soccer rating system","authors":"Taoya Cheng, Deguang Cui, Zhimin Fan, Jie Zhou, Siwei Lu","doi":"10.1109/ICCIMA.2003.1238143","DOIUrl":"https://doi.org/10.1109/ICCIMA.2003.1238143","url":null,"abstract":"The objective of this paper is to build a result prediction model for the rating system in soccer games. A rating system which plays a crucial role in world sports field yields predictions for the probability that one contestant beats another. The result prediction model is the core technique in the rating system. The robustness and accuracy of the model is a very important feature because people will trust the rating system only if it can give the exact prediction of the game results. This paper employs a coarse-to-fine training technique based on hybrid neural network. Very few people have ever attempted the method based on neural network before in this field. First a match is classified into three categories with a LVQ net to determine the strength contrast between two contestants. Then the elaborately designed data will go through the specific BP nets according to the classifying result. The model is trained and tested on volumes of actual soccer match results from Italian series A. Finally the results of the model are compared to other prediction models based on statistics. The outcome shows that the new model is more accurate and provides better performance evaluation of all teams.","PeriodicalId":385362,"journal":{"name":"Proceedings Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116362265","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":"Optimization with genetic algorithms in multispecies environments","authors":"L. Schmitt","doi":"10.1109/ICCIMA.2003.1238124","DOIUrl":"https://doi.org/10.1109/ICCIMA.2003.1238124","url":null,"abstract":"We discuss a converging 'scaled coevolutionary genetic algorithm' (scGA) in a setting where populations contain fixed numbers of interacting creatures of several types. The interaction defines a population-dependent fitness function. The scGA employs multiple-spot mutation, various crossover operators and power-law scaled proportional fitness selection. In particular, the Vose-Liepins version of mutation-crossover is included. To achieve convergence, the mutation and crossover rates have to be annealed to zero in proper fashion, and power-law scaling is used with logarithmic growth in the exponent. If creatures of specific types exist that have maximal fitness in every population they reside in, then the scGA described here converges asymptotically to a probability distribution over multiuniform populations containing only such maximal creatures wherever they exist.","PeriodicalId":385362,"journal":{"name":"Proceedings Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122722718","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":"Similarity measure learning for image retrieval using feature subspace analysis","authors":"Hangjun Ye, Guangyou Xu","doi":"10.1109/ICCIMA.2003.1238113","DOIUrl":"https://doi.org/10.1109/ICCIMA.2003.1238113","url":null,"abstract":"Practical content-based image retrieval systems require efficient relevance feedback techniques. Researchers have proposed many relevance feedback methods using quadratic-form distance metric as similarity measure and learning similarity matrix by feedback samples. Existing methods fail to find the optimal and reasonable solution of similarity measure due to the small number of positive and negative training samples. In this paper, an approach of learning the similarity measure using feature subspaces analysis (FSA) is proposed for content-based image retrieval. This approach solves the similarity measure-learning problem by FSA on training samples, which improves generalization capacity and reserves robustness furthest simultaneously. Experiments on a large database of 13,897 heterogeneous images demonstrated a remarkable improvement of retrieval precision.","PeriodicalId":385362,"journal":{"name":"Proceedings Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126556993","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":"Using association features to enhance the performance of Naive Bayes text classifier","authors":"Zhang Yang, Z. Lijun, Jianfeng Yan, Zhanhuai Li","doi":"10.1109/ICCIMA.2003.1238148","DOIUrl":"https://doi.org/10.1109/ICCIMA.2003.1238148","url":null,"abstract":"The co-occurrence of words can make contributions to automatic text classification. However, this information cannot be represented in the feature set when only using primitive features, and can only be partially represented when using n-grams as features. In this paper, we define a novel feature, association feature, to describe this information. In order to make the association features which we selected to be good discriminators, we proposed an approach to create association feature set, including redundancy pruning algorithm and feature selection algorithm. The experiment result shows that the performance of Naive Bayes text classifier could be improved by using association features, which also means that the selected set of association features can make more contributions to text classification than primitive features, and n-grams.","PeriodicalId":385362,"journal":{"name":"Proceedings Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124517000","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":"Fuzzy logic based texture queries for CBIR","authors":"S. Kulkarni, B. Verma","doi":"10.1109/ICCIMA.2003.1238129","DOIUrl":"https://doi.org/10.1109/ICCIMA.2003.1238129","url":null,"abstract":"This paper presents a novel fuzzy logic based approach for the interpretation of texture queries. Tamura feature extraction technique is used to extract each texture feature of an image in the database. A term set on each Tamura feature is generated by a fuzzy clustering algorithm to pose a query in terms of natural language. The query can be expressed as a logic combination of natural language terms and tamura feature values. The performance of the technique was evaluated on Brodatz texture benchmark database. Experimental results show that the proposed technique is effective and the retrieved images indicate that those images are suitable for the specific queries.","PeriodicalId":385362,"journal":{"name":"Proceedings Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127860535","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":"Automatic divide-and-conquer using populations and ensembles","authors":"X. Yao","doi":"10.1109/ICCIMA.2003.1238087","DOIUrl":"https://doi.org/10.1109/ICCIMA.2003.1238087","url":null,"abstract":"Summary form only given. Real-world problems are often too large and complex for a single monolithic system to solve. In practice, the divide-and-conquer strategy has often been used to decompose a large and complex problem into smaller tractable sub-problems and then solve them. However, good decomposition of large and complex problems requires experienced human experts and rich prior domain knowledge, which are usually unavailable for real-world problems. This paper explores some of our research efforts towards an adaptive approach to divide-and-conquer in the design of machine learning systems, e.g., evolutionary and neural learning systems. The basic idea is to move away from designing a single monolithic system that would solve a large and complex problem, and to employ a population of simpler sub-systems that will cooperatively solve the problem. In such populations based systems, each sub-system will be simpler and easier to learn than the monolithic system. The integrated system based on the whole population can generalise better than any single subsystems in the population. In particular, by evolving and training a team of specialists from random initial conditions, we were able to \"decompose\" a large and complex problem into simpler ones and solve them without human intervention (X. Yao et al., 1996). Two major approaches is described. One uses the population structure in evolutionary algorithms, where individuals in a population are evolved into species (i.e., specialists for solving sub-problems) (P. J. Darwen and X. Yao, 1997). The other uses neural network ensembles in which individual neural networks learn to differentiate from and cooperate with each other (Liu and Yao, 1999; and Liu et al., 2000). A constructive algorithm for designing ensembles as well as individual neural networks will be introduced by MM Islam et al. (2003).","PeriodicalId":385362,"journal":{"name":"Proceedings Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131796546","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":"Learning human perceptual concepts in a fuzzy CBIR system","authors":"Chih-Yi Chiu, Hsin-Chih Lin, Shin-Nine Yang","doi":"10.1109/ICCIMA.2003.1238147","DOIUrl":"https://doi.org/10.1109/ICCIMA.2003.1238147","url":null,"abstract":"In this study, we propose a fuzzy logic framework for content-based image retrieval (CBIR) to achieve the goal of personalization and better retrieval results. Under the proposed framework, typical problems in CBIR such as the semantic gap and the perception subjectivity can be alleviated. Three major components, including: (1) image representation; (2) query expression; and (3) feature matching, are discussed and solutions are introduced. For the image representation, we formulate a mapping from low-level numerical features to high-level linguistic terms by the use of fuzzy membership functions. For the query expression, we define a query description language that provides a flexible query expression for users to specify their information need at various semantic levels. For the feature matching, our CBIR system can construct a unique personalized similarity function that measures similarity between the query and an image according to the user's query and his/her preference. Experimental results are given to show the effectiveness of our CBIR system.","PeriodicalId":385362,"journal":{"name":"Proceedings Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134579415","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":"Negotiation modeling and e-shopping agents","authors":"Runhe Huang","doi":"10.1109/ICCIMA.2003.1238085","DOIUrl":"https://doi.org/10.1109/ICCIMA.2003.1238085","url":null,"abstract":"Negotiation is a key component of e-business. Like business in the real world, negotiation often occurs between two parties or among parties. Considering how to settle on the terms of a transaction, negotiation varies in duration and complexity depending on the market. In general, people are directly engaged in a negotiation process with common knowledge, their experience, and certain learning or reasoning strategies. The human involved negotiations accrue transaction costs that may be too high for either consumers or merchants. Software agent technologies can be used to automate several of the most time-consuming stages and help human combat information overload and expedite specific stages of the business process. The agent-mediated e-business systems are creating new markets (low-cost consumer-to-consumer goods) and beginning to reduce transaction cost in variety of business processes. With a rational negotiation model, software agents should be able to negotiate in an intelligent way on behalf of the real-world parties they represent. However, one of the challenging problems here is negotiation modeling. How to precisely reflect human's negotiation process on different levels is a crucial point. This paper presents our studies on negotiation modeling and demonstrates the negotiation model based e-shopping agents.","PeriodicalId":385362,"journal":{"name":"Proceedings Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128004003","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}