{"title":"Advanced Learning of SOR Network Employing Evaluation-based Topology Representing Network","authors":"T. Yamakawa, K. Horio, Takahiro Tanaka","doi":"10.1109/HIS.2007.72","DOIUrl":"https://doi.org/10.1109/HIS.2007.72","url":null,"abstract":"Learning systems such as multi-layer feed-forward neural networks, wavelet networks and so on need appropriate learning data (input data and teaching output data). These methods are not so useful in case when we cannot get the appropriate learning data. Even in this case, it is not so difficult to evaluate the system output for arbitrarily applied input. The learning data of input-output pairs with their evaluations are easily obtained and thus is easily used for modeling the system. SOR (self-organizing relationship) network is a modeling tool, which can be established by a set of input-output data and corresponding evaluation. This SOR network can act as a knowledge acquisition system and also act as a fuzzy inference engine. The linkage among the units in competitive layer is fixed and not flexible, and thus not used for complicated systems. In this plenary talk, the advanced learning process is presented for the original SOR network by employing evaluation-based TRN (topology representing network). By this learning, the linkage among the units in the competitive layer can be more flexible and thus used for modeling of much more complicated systems. The application of the SOR network established by this learning process to a manipulation control is also presented.","PeriodicalId":359991,"journal":{"name":"7th International Conference on Hybrid Intelligent Systems (HIS 2007)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127145534","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":"Performance Trade-off Exploration by Query-Trail-Mediated Topology Reconstruction in Unstructured P2P Networks","authors":"K. Ohnishi, S. Nagamatsu, Y. Oie","doi":"10.1109/HIS.2007.22","DOIUrl":"https://doi.org/10.1109/HIS.2007.22","url":null,"abstract":"This paper presents a topology reconstruction method to explore better trade-off points between search and access load balancing performance in unstructured peer-to-peer (P2P) file sharing networks. The proposed topology reconstruction method changes a network topology in a dynamic, autonomous, and decentralized manner. The topology reconstruction is based on local threshold-based rules that use query trails, which stand for information on previous successful search paths. A power-law network is used as the initial network in simulations. The simulation results show that, depending on the setting of the threshold values, compared to the case without topology reconstruction, the proposed method can explore better trade-off points between search and storage access load balancing performance.","PeriodicalId":359991,"journal":{"name":"7th International Conference on Hybrid Intelligent Systems (HIS 2007)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114970195","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":"Computing Sharp Lower and Upper Bounds for the Minimum Latency Problem","authors":"J. Sarubbi, H. Luna, G. J. Miranda, R. Camargo","doi":"10.1109/HIS.2007.39","DOIUrl":"https://doi.org/10.1109/HIS.2007.39","url":null,"abstract":"The minimum latency problem, also known as traveling repairman problem, the Deliveryman problem and the traveling salesman problem with cumulative costs is a variant of the Traveling Salesman Problem in which a repairman is required to visit customers located on each node of a graph in such a way that the overall waiting times of these customers is minimized. In the present work, an algorithm based on tight different linear programming lower- bounds and a specialized GRASP procedure are presented. The linear programming based lower-bounds are based on the Quadratic Assignment Problem with the aid of side constraints. Instances from 10 up to 60 nodes are solved very close to optimality in reasonable time.","PeriodicalId":359991,"journal":{"name":"7th International Conference on Hybrid Intelligent Systems (HIS 2007)","volume":"213 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113997690","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}
R. Halavati, S. Shouraki, Bahareh Jafari Jashmi, M. Heravi
{"title":"Symbiotic Tabu Search, A General Evolutionary Optimization Approach","authors":"R. Halavati, S. Shouraki, Bahareh Jafari Jashmi, M. Heravi","doi":"10.1109/HIS.2007.70","DOIUrl":"https://doi.org/10.1109/HIS.2007.70","url":null,"abstract":"Recombination in the Genetic Algorithm (GA) is supposed to extract the component characteristics from two parents and reassemble them in different combinations - hopefully producing an offspring that has the good characteristics of both parents. Symbiotic Combination is formerly introduced as an alternative for sexual recombination operator to overcome the need of explicit design of recombination operators in GA. This paper presents an optimization algorithm based on using this operator in Tabu Search. The algorithm is benchmarked on two problem sets and is compared with standard genetic algorithm and symbiotic evolutionary adaptation model, showing success rates higher than both cited algorithms.","PeriodicalId":359991,"journal":{"name":"7th International Conference on Hybrid Intelligent Systems (HIS 2007)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123059320","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":"Generating Fuzzy Rules from Examples Using the Particle Swarm Optimization Algorithm","authors":"A. Esmin","doi":"10.1109/HIS.2007.52","DOIUrl":"https://doi.org/10.1109/HIS.2007.52","url":null,"abstract":"The use of fuzzy logic to solve control problems have been increasing considerably in the past years. The problem of generating desirable fuzzy rules is very important in the development of fuzzy systems. It is known that the fuzzy control rules for a control system is always built by designers with trial and error and based on their experience or some experiments. This paper presents a generation method of fuzzy rule by learning from examples using the Particle Swarm Optimization method (PSO). The proposed algorithm can obtain a set of fuzzy rules which cover the examples set in iterative process. The proposed method is tested with promising results.","PeriodicalId":359991,"journal":{"name":"7th International Conference on Hybrid Intelligent Systems (HIS 2007)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133409929","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}
H. Tamura, Tsuyoshi Okubo, Yousuke Inoue, K. Kawahara, Y. Oie
{"title":"Implementation and Experimental Evaluation of On-Line Simulation Server for OSPF-TE","authors":"H. Tamura, Tsuyoshi Okubo, Yousuke Inoue, K. Kawahara, Y. Oie","doi":"10.1109/HIS.2007.42","DOIUrl":"https://doi.org/10.1109/HIS.2007.42","url":null,"abstract":"As the amount of traffic transferee! on the Internet are increasing, dynamic traffic engineering (TE) becomes important to avoid link congestion. In open shortest path fast(OSPF)-based networks, link costs are statically set according to its long-term utilization for reducing traffic on some congested nodes, hence temporary performance degradation may occur due to short-term traffic fluctuation. For dynamic IE on OSPF-based networks, measurement of the utilization of links / nodes, inferring the set of link costs for improving transmission behavior and setting the cost set to routers are necessary and so-called on-line simulation (OLS) system can operate these functions autonomously and periodically. In this paper, we construct the server prototype in OLS system, and evaluate its scalability and control performance in our testbed network. Experimental results show that the server succeeds in providing low-cost network management and real-time control even if there is the large amount of traffic on the network. Furthermore, the total throughput over the network was greatly improved by the OLS.","PeriodicalId":359991,"journal":{"name":"7th International Conference on Hybrid Intelligent Systems (HIS 2007)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126631160","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 to Reach Optimal Equilibrium by Influence of Other Agents Opinion","authors":"D. Barrios-Aranibar, L. Gonçalves","doi":"10.1109/HIS.2007.61","DOIUrl":"https://doi.org/10.1109/HIS.2007.61","url":null,"abstract":"In this work authors extend the model of the reinforcement learning paradigm for multi-agent systems called \"influence value reinforcement learning \" (IVRL). In previous work an algorithm for repetitive games was proposed, and it outperformed traditional paradigms. Here, authors define an algorithm based on this paradigm for using when agents has to learn from delayed rewards, thus, an influence value reinforcement learning algorithm for two agents stochastic games. The IVRLparadigm is based on social interaction of people, specially in the fact that people communicate each other what they think about their actions and this opinion has some influence in the behavior of each other. A modified version of Q-learning algorithm using this paradigm was constructed. The so called TV Q-learning algorithm was implemented and compared with versions of Q-learning for independent learning and joint action learning. Our approach shows to have more probability to converge to an optimal equilibrium than IQ-learning and JAQ-learning algorithms, specially when exploration increases.","PeriodicalId":359991,"journal":{"name":"7th International Conference on Hybrid Intelligent Systems (HIS 2007)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115255318","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":"Evolving Connectionist and Hybrid Systems: Methods, Tools, Applications","authors":"N. Kasabov","doi":"10.1109/HIS.2007.74","DOIUrl":"https://doi.org/10.1109/HIS.2007.74","url":null,"abstract":"Evolving Connectionist Systems (ECOS) are neural network systems that develop their structure, functionality and internal representation through continuous learning from data and interaction with the environment. ECOS can also evolve through generations of populations using evolutionary computation, but the focus of the presentation is on: (1) Adaptive learning and improvement of each individual model; (2) Knowledge representation, knowledge adaptation and knowledge extraction. The learning process can be: on-line, off-line, incremental, supervised, unsupervised, active, sleep/dream, etc.","PeriodicalId":359991,"journal":{"name":"7th International Conference on Hybrid Intelligent Systems (HIS 2007)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115891310","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 Multi-Objective Genetic Algorithm for Discovering Non-Dominated Motifs in DNA Sequences","authors":"Mehmet Kaya","doi":"10.1109/HIS.2007.65","DOIUrl":"https://doi.org/10.1109/HIS.2007.65","url":null,"abstract":"This paper presents a novel motif discovery algorithm based on multi-objective genetic algorithms to extract non-dominated motifs in DNA sequences. The main advantage of our approach is that a large number of tradeoff (non-dominated) motifs can be obtained by a single run with respect to conflicting objectives: similarity, motif length and support maximization. In this paper, the method extracts non-dominated motifs taking into account two-objective at a time while one of the objectives is set to a pre-specified value. So, user is given to the authority of incorporating to motif discovery process. Our approach can be applied to any data set with a sequential character. Furthermore, it allows any choice of similarity measures for finding motifs. By analyzing the discovered non-dominated motifs, the decision maker can understand the tradeoff between the objectives. We compare the approach with the three well-known motif discovery methods, AlignACE, MEME and Weeder. Experimental results on real data set extracted from TRANSFAC database demonstrate that the proposed method exhibits good performance over the other methods in terms of runtime and accuracy of prediction.","PeriodicalId":359991,"journal":{"name":"7th International Conference on Hybrid Intelligent Systems (HIS 2007)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116174136","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":"Pareto-based Multi-Objective Machine Learning","authors":"Yaochu Jin","doi":"10.1109/HIS.2007.73","DOIUrl":"https://doi.org/10.1109/HIS.2007.73","url":null,"abstract":"Machine learning is inherently a multi-objective task. Traditionally, however, either only one of the objectives is adopted as the cost function or multiple objectives are aggregated to a scalar cost function. This can mainly attributed to the fact that most conventional learning algorithms can only deal with a scalar cost function. Over the last decade, efforts on solving machine learning problems using the Pareto-based multi-objective optimization methodology have gained increasing impetus, particularly thanks to the great success of multi-objective optimization using evolutionary algorithms and other population-based stochastic search methods. It has been shown that Pareto-based multi-objective learning approaches are more powerful compared to learning algorithms with a scalar cost functions in addressing various topics of machine learning, such as clustering, feature selection, improvement of generalization ability, knowledge extraction, and ensemble generation. This talk provides first a brief overview of Pareto-based multi-objective machine learning techniques. In addition, a number of case studies are provided to illustrate the major benefits of the Pareto-based approach to machine learning, e.g., how to identify interpretable models and models that can generalize on unseen data from the obtained Pareto-optimal solutions. Three approaches to Pareto-based multi-objective ensemble generation are compared and discussed in detail. Most recent results on multi-objective optimization of spiking neural networks will be presented.","PeriodicalId":359991,"journal":{"name":"7th International Conference on Hybrid Intelligent Systems (HIS 2007)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114669384","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}