R. Brause, Timm Sebastian Langsdorf, Hans-Michael Hepp
{"title":"Neural data mining for credit card fraud detection","authors":"R. Brause, Timm Sebastian Langsdorf, Hans-Michael Hepp","doi":"10.1109/TAI.1999.809773","DOIUrl":"https://doi.org/10.1109/TAI.1999.809773","url":null,"abstract":"The prevention of credit card fraud is an important application for prediction techniques. One major obstacle for using neural network training techniques is the high necessary diagnostic quality: since only one financial transaction in a thousand is invalid no prediction success less than 99.9% is acceptable. Because of these credit card transaction requirements, completely new concepts had to be developed and tested on real credit card data. This paper shows how advanced data mining techniques and a neural network algorithm can be combined successfully to obtain a high fraud coverage combined with a low false alarm rate.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131144352","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":"Query reification based approach for object-oriented query formulation aid","authors":"A. Seriai, M. Oussalah","doi":"10.1109/TAI.1999.809820","DOIUrl":"https://doi.org/10.1109/TAI.1999.809820","url":null,"abstract":"We propose an approach facilitating query formulation for users sharing a common database. Our approach is based on two considerations. On the one hand, query formulation can be considered as a skill which can be shared entirely or partly between users. Accordingly we propose a model for storing and making available this skill to help users formulate their new queries. On the other hand we base our design on custom construction of a database adapted to each business group of users in question. In using it, the users of a given business cooperate transparently through their queries to design databases specific to their business. Thus, they take part co-operatively if indirectly in reducing the difficulty of query formulation.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131665292","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 dynamic scheduling benchmark: design, implementation and performance evaluation","authors":"B. Hamidzadeh, Ngan Kee","doi":"10.1109/TAI.1999.809806","DOIUrl":"https://doi.org/10.1109/TAI.1999.809806","url":null,"abstract":"Puzzles have traditionally been used as popular benchmarks for evaluating different problem solving strategies. Many of the game benchmarks are suitable for evaluating static scheduling techniques. In such benchmarks, the scheduling phase and the execution phase (i.e. when the schedule is executed to play the game) are disjoint. The scheduling technique can be executed to compute a complete schedule prior to the execution of any moves to play the game. Due to recent interest in on-line problem solving techniques, there is a need for benchmarks which can evaluate the performance trade-offs of dynamic scheduling techniques. Many modern video and computer games can be suitable candidates for dynamic scheduling benchmarks, since they require on-line problem solving. These benchmarks and their system testbeds should be chosen and implemented such that they can accurately reveal important performance trade-offs of dynamic scheduling techniques. In this paper, we introduce a dynamic scheduling benchmark and its system testbed. This benchmark is based on an extended version of the Tetris computer game. The rules and semantics of the game were modified to lend themselves well to evaluation of discrete problem solving and optimization techniques. The system testbed is implemented in a distributed and asynchronous fashion, on a network of workstations, to reveal performance trade-offs between scheduling time, schedule quality, and problem constraints.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131945678","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":"On the use of genetic algorithms in database client clustering","authors":"Je-Ho Park, V. Kanitkar, A. Delis, R. Uma","doi":"10.1109/TAI.1999.809816","DOIUrl":"https://doi.org/10.1109/TAI.1999.809816","url":null,"abstract":"In conventional two-tier client-server databases, clients access and modify shared data resident in a common server. As the number of clients increases, the centralized database server can become a performance bottleneck. In order to overcome this scalability problem, a three-tier client-server configuration has been proposed that features the partitioning of clients into logical clusters. Here, the objective is to maximize the data sharing among the clients in each cluster. We propose a genetic algorithm to create such client clusters and evaluate two different techniques for generating the initial solution populations. We compare the performance of the two-tier and three-tier configurations with respect to the transaction turnaround times and object response times. Our experimental results indicate that the clustered architecture can offer improved performance over its two-tier counterpart.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"162 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114000936","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":"Face detection and its applications in intelligent and focused image retrieval","authors":"Zhongfei Zhang, R. Srihari, A. Rao","doi":"10.1109/TAI.1999.809776","DOIUrl":"https://doi.org/10.1109/TAI.1999.809776","url":null,"abstract":"This paper presents a face detection technique and its applications in image retrieval. Even though this face detection method has relatively high false positives and a low detection rate (as compared with the dedicated face detection systems in the literature of image understanding), because of its simple and fast nature, it has been shown that this system may be well applied in image retrieval in certain focused application domains. Two application examples are given: one combining face detection with indexed collateral text for image retrieval regarding human beings, and the other combining face detection with conventional similarity matching techniques for image retrieval with similar background. Experimental results show that our proposed approaches have significantly improved image retrieval precision over existing search engines in these focused application domains.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124198057","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}
Jonathan Lee, Nien-Lin Xue, Kuo-Hsun Hsu, Yong-Yi Fangjang
{"title":"Structuring requirements specifications through goals interactions","authors":"Jonathan Lee, Nien-Lin Xue, Kuo-Hsun Hsu, Yong-Yi Fangjang","doi":"10.1109/TAI.1999.809767","DOIUrl":"https://doi.org/10.1109/TAI.1999.809767","url":null,"abstract":"One of the foci of the recent developments in requirements engineering has been the study of conflicting requirements. However, there is no systematic way in the existing approaches to handling the interactions among requirements and their impact on the structuring of requirement specifications. In this paper, a new approach is proposed to formulate the requirement specifications based on goal interactions (i.e., cooperative, conflicting, counterbalanced and irrelevant).","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129023823","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 software tool for real-time low-level vision","authors":"D. Goldman, N. Bourbakis","doi":"10.1109/TAI.1999.809778","DOIUrl":"https://doi.org/10.1109/TAI.1999.809778","url":null,"abstract":"This paper presents a software tool-methodology called ORASIS, for near real-time and real-time user driven segmentation of color images or sequences of images (video) by using a low cost approach (a low cost camera and a PC). The segmentation approach used is based on fuzzy-like reasoning and a color reflection. The ORASIS tool-methodology provides a human-like perception modeling in combination with fast smoothing, region growing and edge detection. Results on several images are provided to demonstrate the tool's adaptive segmentation capabilities based on the user's requests.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127548981","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":"Examplar-based prototype selection for a multi-strategy learning system","authors":"Patrick Njiwoua, E. Nguifo","doi":"10.1109/TAI.1999.809763","DOIUrl":"https://doi.org/10.1109/TAI.1999.809763","url":null,"abstract":"Multistrategy learning (MSL) consists of combining at least two different learning strategies to bring out a powerful system, where the drawbacks of the basic algorithms are avoided. In this scope, instance-based learning (IBL) techniques are often used as the basic component. However, one of the major drawbacks of IBL is the prototype selection problem which consists in selecting a subset of representative instances in order to reduce the classification process. This paper presents a novel approach which consists of three steps. The first one builds a set of lattice-based hypotheses that characterize the training data set. Given an unseen example, the second step selects a subset of training instances through the way they verify the same hypotheses as the unseen example. Finally the last step uses this subset of training instances as the prototypes for the classification of the unseen example. Results of experiments that we conducted show the effectiveness of our approach compared to standard ML techniques on different datasets.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124480412","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 generic task strategy for solving routine decision making problems","authors":"R. Fox","doi":"10.1109/TAI.1999.809807","DOIUrl":"https://doi.org/10.1109/TAI.1999.809807","url":null,"abstract":"An algorithm to solve routine decision making problems is presented here. This algorithm combines plan-step generation to find actions that can be applied to solve the particular problem, plan-step assessment to evaluate how useful each action is within the context of the given problem, and plan-step assembly to select and sequence the best actions. These processes can themselves be implemented using the generic tasks of hierarchical classification, routine recognition and a variation of abductive assembly. This paper describes routine decision making problems, the routine decision making algorithm and demonstrates it through three knowledge-based systems.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121667019","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":"Cognitive packet networks","authors":"E. Gelenbe, Zhiguang Xu, Esin Seref","doi":"10.1109/TAI.1999.809765","DOIUrl":"https://doi.org/10.1109/TAI.1999.809765","url":null,"abstract":"We propose cognitive packet networks (CPN) in which intelligent capabilities for routing and flow control are concentrated in the packets, rather than in the nodes and protocols. Cognitive packets within a CPN route themselves. They are assigned goals before entering the network and pursue these goals adaptively. Cognitive packets learn from their own observations about the network and from the experience of other packets with whom they exchange information via mailboxes. Cognitive packets rely minimally on routers. This paper describes CPN and shows how learning can support intelligent behavior of cognitive packets.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131802520","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}