{"title":"Applying SVD on item-based filtering","authors":"M. Vozalis, K. Margaritis","doi":"10.1109/ISDA.2005.25","DOIUrl":"https://doi.org/10.1109/ISDA.2005.25","url":null,"abstract":"In this paper we examine the use of a matrix factorization technique called singular value decomposition (SVD) in item-based collaborative filtering. After a brief introduction to SVD and some of its previous applications in recommender systems, we proceed with a full description of our algorithm, which uses SVD in order to reduce the dimension of the active item's neighborhood. The experimental part of this work first locates the ideal parameter settings for the algorithm, and concludes by contrasting it with plain item-based filtering which utilizes the original, high dimensional neighborhood. The results show that a reduction in the dimension of the item neighborhood is promising, since it does not only tackle some of the recorded problems of recommender systems, but also assists in increasing the accuracy of systems employing it.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117293299","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":"Proposal of a neuro-fuzzy model of a WWW server","authors":"K. Zatwarnicki","doi":"10.1109/ISDA.2005.79","DOIUrl":"https://doi.org/10.1109/ISDA.2005.79","url":null,"abstract":"This paper presents the ways of designing simulation models of Web servers. At the beginning queuing network models are introduced, those models are generally known and often used in the initial phase of research on particular technical solutions. Next, an entirely new approach to the issue discussed is presented - neuro-fuzzy models, thanks to which, it is possible to automate the process of designing simulation models. The results of comparative tests of these two models are presented. Based on these results it can be concluded that neuro-fuzzy models are accurate and can be used in simulation research.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124790447","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":"Parallel telemetric data warehouse balancing algorithm","authors":"M. Gorawski, Robert Chechelski","doi":"10.1109/ISDA.2005.75","DOIUrl":"https://doi.org/10.1109/ISDA.2005.75","url":null,"abstract":"One of the most important requirements of data warehouses is query response time. Amongst all methods of improving query performance, parallel processing (especially in shared nothing class) is one of the giving practically unlimited system's scaling possibility. The key problem in a parallel data warehouses is data allocation between system nodes. The problem is growing when nodes have different computational characteristics. In this paper we present an algorithm of balancing parallel data warehouse built on mentioned architecture. Balancing is realized by setting dataset size stored in each node. We exploited some well known data allocation schemas using space filling curves: Hilbert and Peano. Our conception is verified by a set of tests and its analysis.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123363488","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}
Nobuharu Murata, T. Furuya, H. Nosato, M. Murakawa
{"title":"An automatic multi-objective adjustment system for optical axes using genetic algorithms","authors":"Nobuharu Murata, T. Furuya, H. Nosato, M. Murakawa","doi":"10.1109/ISDA.2005.21","DOIUrl":"https://doi.org/10.1109/ISDA.2005.21","url":null,"abstract":"This paper describes an automatic multi-objective adjustment system for optical axes using genetic algorithms. It is difficult for conventional systems to automatically adjust optical axes, because it requires high-precision positioning and angle setting with /spl mu/m resolution. Moreover, multiple goals that have a trade-off relation must be satisfied simultaneously by the adjustment. In order to overcome this problem, we propose a multi-objective adjustment system using genetic algorithms. In experiments, simultaneous alignment for the positioning and the angles (parallelism) of optical axes, which is difficult with conventional methods, could be realized within three hours.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121765224","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":"Modeling plants language for definition of L-systems","authors":"K. Lukasik, Elzbieta Hudyma","doi":"10.1109/ISDA.2005.66","DOIUrl":"https://doi.org/10.1109/ISDA.2005.66","url":null,"abstract":"Proper language for formal definition of L-systems is crucial to easy creation, modification and comparison between plant models. This paper introduces special purpose language, which allows effortless description of D0L-systems (simplest class of L-systems) and their extensions (e.g. context-sensitive, parametric productions with probability). The proposed language enables as well specification of high-level model parameters.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125063266","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 fuzzy probabilistic neural network for fault detection in MEMS","authors":"R. Asgary, K. Mohammadi","doi":"10.1109/ISDA.2005.96","DOIUrl":"https://doi.org/10.1109/ISDA.2005.96","url":null,"abstract":"There are different methods for detecting digital faults in electronic and computer systems. But for analog faults, there are some problems. This kind of faults consists of many different and parametric faults, which can not be detected by digital fault detection methods. One of the proposed methods for analog fault detection is neural networks. Fault detection is actually a pattern recognition task. Faulty and fault free data are different patterns which must be recognized. In this paper we use a probabilistic neural network for fault detection in MEMS. A fuzzy system is used to improve performance of the network. Finally different network results are compared.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"260 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122684578","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":"Bookmark shared system using agent systems","authors":"Y. Nagai, K. Inoue","doi":"10.1109/ISDA.2005.30","DOIUrl":"https://doi.org/10.1109/ISDA.2005.30","url":null,"abstract":"Recently, collaborative filtering is proposed as an information gathering technology of the WWW in the network. Collaborative filtering is a technology that recommends information on the Web page for an arbitrary user who wants to acquire recommendation information based on many users' evaluation and retrieval histories. In this paper, the bookmark shared system that filters bookmark information collaboratively is described. Especially, we explain the details of the bookmark shared system using agent systems and it's collaborative filtering on the distributed environment. In a concrete agent modeling, the multiagent does a simple communication to notify the profile update, and the retrieval processing is done by a mobile agent. As a result, the profile management on the distributed environment is facilitated, and it is possible to construct collaborative filtering system that can decrease the communication frequency in the retrieval processing.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"27 31","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120927759","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":"Welfare economy on belief in data mining - a rough set theoretical approach","authors":"T. Matsuhisa","doi":"10.1109/ISDA.2005.101","DOIUrl":"https://doi.org/10.1109/ISDA.2005.101","url":null,"abstract":"We investigate a pure exchange economy under uncertainty with emphasis on the logical point of view from data base theory; the traders are assumed to have a multi-modal logic of belief and to make their decision under uncertainty represented by rough sets. We propose a generalized notion of expectations equilibrium for the economy, and we show the fundamental welfare theorem: An allocation in the economy is ex-ante Pareto optimal if and only if it is an expectations equilibrium allocation in belief for some initial endowment with respect to some price system.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129586835","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":"How to use crowding selection in grammar-based classifier system","authors":"O. Unold, L. Cielecki","doi":"10.1109/ISDA.2005.50","DOIUrl":"https://doi.org/10.1109/ISDA.2005.50","url":null,"abstract":"The grammar-based classifier system (GCS) is a new version of learning classifier systems (LCS) in which classifiers are represented by context-free grammar in Chomsky normal form. GCS evolves one grammar during induction (the Michigan approach) which gives it the ability to find the proper set of rules very quickly. However it is quite sensitive to any variations of learning parameters. This paper investigates the role of crowding selection in GCS. To evaluate the performance of GCS depending on crowding factor and crowding subpopulation we used context-free language in the form of so-called toy language. The set of experiments was performed to obtain the answer for question in the title.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125096502","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":"Combining character classifiers using member classifiers assessment","authors":"J. Sas, Michal Luzyna","doi":"10.1109/ISDA.2005.34","DOIUrl":"https://doi.org/10.1109/ISDA.2005.34","url":null,"abstract":"In the paper, the method of combining character classifiers for handprinted text recognition is presented. The combination rule is based on member classifiers reliability assessment. The assessment can be based on probabilistic classifier properties or it can use similarity measures individually evaluated for the character currently being recognized. The approach presented here follows soft classification paradigm, where the classifier not merely selects single class, but it provides the vector of support values corresponding to character likelihood. The proposed methods have been tested and compared in recognizing letters from polish alphabet, including nine difficult do recognize diacritic characters.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124621265","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}