共查询到20条相似文献,搜索用时 62 毫秒
1.
Evelina Lamma Fabrizio Riguzzi Sergio Storari Paola Mello Anna Nanetti 《New Generation Computing》2003,21(2):123-133
A huge amount of data is daily collected from clinical microbiology laboratories. These data concern the resistance or susceptibility
of bacteria to tested antibiotics. Almost all microbiology laboratories follow standard antibiotic testing guidelines which
suggest antibiotic test execution methods and result interpretation and validation (among them, those annually published by
NCCLS2,3). Guidelines basically specify, for each species, the antibiotics to be tested, how to interpret the results of tests and
a list of exceptions regarding particular antibiotic test results. Even if these standards are quite assessed, they do not
consider peculiar features of a given hospital laboratory, which possibly influence the antimicrobial test results, and the
further validation process.
In order to improve and better tailor the validation process, we have applied knowledge discovery techniques, and data mining
in particular, to microbiological data with the purpose of discovering new validation rules, not yet included in NCCLS guidelines,
but considered plausible and correct by interviewed experts. In particular, we applied the knowledge discovery process in
order to find (association) rules relating to each other the susceptibility or resistance of a bacterium to different antibiotics.
This approach is not antithetic, but complementary to that based on NCCLS rules: it proved very effective in validating some
of them, and also in extending that compendium. In this respect, the new discovered knowledge has lead microbiologists to
be aware of new correlations among some antimicrobial test results, which were previously unnoticed. Last but not least, the
new discovered rules, taking into account the history of the considered laboratory, are better tailored to the hospital situation,
and this is very important since some resistances to antibiotics are specific to particular, local hospital environments.
Evelina Lamma, Ph.D.: She got her degree in Electrical Engineering at the University of Bologna in 1985, and her Ph.D. in Computer Science in 1990.
Her research activity centers on logic programming languages, artificial intelligence and agent-based programming. She was
co-organizers of the 3rd International Workshop on Extensions of Logic Programming ELP92, held in Bologna in February 1992,
and of the 6th Italian Congress on Artificial Intelligence, held in Bologna in September 1999. She is a member of the Italian
Association for Artificial Intelligence (AI*IA), associated with ECCAI. Currently, she is Full Professor at the University of Ferrara, where she teaches Artificial Intelligence
and Fondations of Computer Science.
Fabrizio Riguzzi, Ph.D.: He is Assistant Professor at the Department of Engineering of the University of Ferrara, Italy. He received his Laurea from
the University of Bologna in 1999. He joined the Department of Engineering of the University of Ferrara in 1999. He has been
a visiting researcher at the University of Cyprus and at the New University of Lisbon. His research interests include: data
mining (and in particular methods for learning from multirelational data), machine learning, belief revision, genetic algorithms
and software engineering.
Sergio Storari: He got his degree in Electrical Engineering at the University of Ferrara in 1998. His research activity centers on artificial
intelligence, knowledge-based systems, data mining and multi-agent systems. He is a member of the Italian Association for
Artificial Intelligence (AI*IA), associated with ECCAI. Currently, he is attending the third year of Ph.D. course about “Study and application of Artificial
Intelligence techniques for medical data analysis” at DEIS University of Bologna.
Paola Mello, Ph.D.: She got her degree in Electrical Engineering at the University of Bologna in 1982, and her Ph.D. in Computer Science in 1988.
Her research activity centers on knowledge representation, logic programming, artificial intelligence and knowledge-based
systems. She was co-organizers of the 3rd International Workshop on Extensions of Logic Programming ELP92, held in Bologna
in February 1992, and of the 6th Italian Congress on Artificial Intelligence, Held in Bologna in September 1999. She is a
member of the Italian Association for Artificial Intelligence (AI*IA), associated with ECCAI. Currently, she is Full Professor at the University of Bologna, where she teaches Artificial Intelligence
and Fondations of Computer Science.
Anna Nanetti: She got a degree in biologics sciences at the University of Bologna in 1974. Currently, she is an Academic Recearcher in
the Microbiology section of the Clinical, Specialist and Experimental Medicine Department of the Faculty of Medicine and Surgery,
University of Bologna. 相似文献
2.
We present a system for performing belief revision in a multi-agent environment. The system is called GBR (Genetic Belief
Revisor) and it is based on a genetic algorithm. In this setting, different individuals are exposed to different experiences.
This may happen because the world surrounding an agent changes over time or because we allow agents exploring different parts
of the world. The algorithm permits the exchange of chromosomes from different agents and combines two different evolution
strategies, one based on Darwin’s and the other on Lamarck’s evolutionary theory. The algorithm therefore includes also a
Lamarckian operator that changes the memes of an agent in order to improve their fitness. The operator is implemented by means
of a belief revision procedure that, by tracing logical derivations, identifies the memes leading to contradiction. Moreover,
the algorithm comprises a special crossover mechanism for memes in which a meme can be acquired from another agent only if
the other agent has “accessed” the meme, i.e. if an application of the Lamarckian operator has read or modified the meme.
Experiments have been performed on the η-queen problem and on a problem of digital circuit diagnosis. In the case of the η-queen
problem, the addition of the Lamarckian operator in the single agent case improves the fitness of the best solution. In both
cases the experiments show that the distribution of constraints, even if it may lead to a reduction of the fitness of the
best solution, does not produce a significant reduction.
Evelina Lamma, Ph.D.: She is Full Professor at the University of Ferrara. She got her degree in Electrical Engineering at the University of Bologna
in 1985, and her Ph.D. in Computer Science in 1990. Her research activity centers on extensions of logic programming languages
and artificial intelligence. She was coorganizers of the 3rd International Workshop on Extensions of Logic Programming ELP92,
held in Bologna in February 1992, and of the 6th Italian Congress on Artificial Intelligence, held in Bologna in September
1999. Currently, she teaches Artificial Intelligence and Fondations of Computer Science.
Fabrizio Riguzzi, Ph.D.: He is Assistant Professor at the Department of Engineering of the University of Ferrara, Italy. He received his Laurea from
the University of Bologna in 1995 and his Ph.D. from the University of Bologna in 1999. He joined the Department of Engineering
of the University of Ferrara in 1999. He has been a visiting researcher at the University of Cyprus and at the New University
of Lisbon. His research interests include: data mining (and in particular methods for learning from multirelational data),
machine learning, belief revision, genetic algorithms and software engineering.
Luís Moniz Pereira, Ph.D.: He is Full Professor of Computer Science at Departamento de Informática, Universidade Nova de Lisboa, Portugal. He received
his Ph.D. in Artificial Intelligence from Brunel University in 1974. He is the director of the Artificial Intelligence Centre
(CENTRIA) at Universidade Nova de Lisboa. He has been elected Fellow of the European Coordinating Committee for Artificial
Intelligence in 2001. He has been a visiting Professor at the U. California at Riverside, USA, the State U. NY at Stony Brook,
USA and the U. Bologna, Italy. His research interests include: knowledge representation, reasoning, learning, rational agents
and logic programming. 相似文献
3.
An Integrated Framework for Semantic Annotation and Adaptation 总被引:1,自引:1,他引:0
Tools for the interpretation of significant events from video and video clip adaptation can effectively support automatic extraction and distribution of relevant content from video streams. In fact, adaptation can adjust meaningful content, previously detected and extracted, to the user/client capabilities and requirements. The integration of these two functions is increasingly important, due to the growing demand of multimedia data from remote clients with limited resources (PDAs, HCCs, Smart phones). In this paper we propose an unified framework for event-based and object-based semantic extraction from video and semantic on-line adaptation. Two cases of application, highlight detection and recognition from soccer videos and people behavior detection in domotic* applications, are analyzed and discussed.Domotics is a neologism coming from the Latin word domus (home) and informatics.Marco Bertini has a research grant and carries out his research activity at the Department of Systems and Informatics at the University of Florence, Italy. He received a M.S. in electronic engineering from the University of Florence in 1999, and Ph.D. in 2004. His main research interest is content-based indexing and retrieval of videos. He is author of more than 25 papers in international conference proceedings and journals, and is a reviewer for international journals on multimedia and pattern recognition.Rita Cucchiara (Laurea Ingegneria Elettronica, 1989; Ph.D. in Computer Engineering, University of Bologna, Italy 1993). She is currently Full Professor in Computer Engineering at the University of Modena and Reggio Emilia (Italy). She was formerly Assistant Professor (‘93–‘98) at the University of Ferrara, Italy and Associate Professor (‘98–‘04) at the University of Modena and Reggio Emilia, Italy. She is currently in the Faculty staff of Computer Engenering where has in charges the courses of Computer Architectures and Computer Vision.Her current interests include pattern recognition, video analysis and computer vision for video surveillance, domotics, medical imaging, and computer architecture for managing image and multimedia data.Rita Cucchiara is author and co-author of more than 100 papers in international journals, and conference proceedings. She currently serves as reviewer for many international journals in computer vision and computer architecture (e.g. IEEE Trans. on PAMI, IEEE Trans. on Circuit and Systems, Trans. on SMC, Trans. on Vehicular Technology, Trans. on Medical Imaging, Image and Vision Computing, Journal of System architecture, IEEE Concurrency). She participated at scientific committees of the outstanding international conferences in computer vision and multimedia (CVPR, ICME, ICPR, ...) and symposia and organized special tracks in computer architecture for vision and image processing for traffic control. She is in the editorial board of Multimedia Tools and Applications journal. She is member of GIRPR (Italian chapter of Int. Assoc. of Pattern Recognition), AixIA (Ital. Assoc. Of Artificial Intelligence), ACM and IEEE Computer Society.Alberto Del Bimbo is Full Professor of Computer Engineering at the Università di Firenze, Italy. Since 1998 he is the Director of the Master in Multimedia of the Università di Firenze. At the present time, he is Deputy Rector of the Università di Firenze, in charge of Research and Innovation Transfer. His scientific interests are Pattern Recognition, Image Databases, Multimedia and Human Computer Interaction. Prof. Del Bimbo is the author of over 170 publications in the most distinguished international journals and conference proceedings. He is the author of the “Visual Information Retrieval” monography on content-based retrieval from image and video databases edited by Morgan Kaufman. He is Member of IEEE (Institute of Electrical and Electronic Engineers) and Fellow of IAPR (International Association for Pattern Recognition). He is presently Associate Editor of Pattern Recognition, Journal of Visual Languages and Computing, Multimedia Tools and Applications Journal, Pattern Analysis and Applications, IEEE Transactions on Multimedia, and IEEE Transactions on Pattern Analysis and Machine Intelligence. He was the Guest Editor of several special issues on Image databases in highly respected journals.Andrea Prati (Laurea in Computer Engineering, 1998; PhD in Computer Engineering, University of Modena and Reggio Emilia, 2002). He is currently an assistant professor at the University of Modena and Reggio Emilia (Italy), Faculty of Engineering, Dipartimento di Scienze e Metodi dell’Ingegneria, Reggio Emilia. During last year of his PhD studies, he has spent six months as visiting scholar at the Computer Vision and Robotics Research (CVRR) lab at University of California, San Diego (UCSD), USA, working on a research project for traffic monitoring and management through computer vision. His research interests are mainly on motion detection and analysis, shadow removal techniques, video transcoding and analysis, computer architecture for multimedia and high performance video servers, video-surveillance and domotics. He is author of more than 60 papers in international and national conference proceedings and leading journals and he serves as reviewer for many international journals in computer vision and computer architecture. He is a member of IEEE, ACM and IAPR. 相似文献
4.
F. Esposito S. Ferilli T. M. A. Basile N. Di Mauro 《Knowledge and Information Systems》2007,11(2):217-242
In real-life domains, learning systems often have to deal with various kinds of imperfections in data such as noise, incompleteness
and inexactness. This problem seriously affects the knowledge discovery process, specifically in the case of traditional Machine
Learning approaches that exploit simple or constrained knowledge representations and are based on single inference mechanisms.
Indeed, this limits their capability of discovering fundamental knowledge in those situations. In order to broaden the investigation
and the applicability of machine learning schemes in such particular situations, it is necessary to move on to more expressive
representations which require more complex inference mechanisms. However, the applicability of such new and complex inference
mechanisms, such as abductive reasoning, strongly relies on a deep background knowledge about the specific application domain.
This work aims at automatically discovering the meta-knowledge needed to abduction inference strategy to complete the incoming
information in order to handle cases of missing knowledge.
Floriana Esposito received the Laurea degree in electronic Physics from the University of Bari, Italy, in 1970. Since 1994 is Full Professor
of Computer Science at the University of Bari and Dean of the Faculty of Computer Science from 1997 to 2002. She founded and
chairs the Laboratory for Knowledge Acquisition and Machine Learning of the Department of Computer Science. Her research activity
started in the field of numerical models and statistical pattern recognition. Then her interests moved to the field of Artificial
Intelligence and Machine Learning. The current research concerns the logical and algebraic foundations of numerical and symbolic
methods in machine learning with the aim of the integration, the computational models of incremental and multistrategy learning,
the revision of logical theories, the knowledge discovery in data bases. Application include document classification and understanding,
content based document retrieval, map interpretation and Semantic Web. She is author of more than 270 scientific papers and
is in the scientific committees of many international scientific Conferences in the field of Artificial Intelligence and Machine
Learning. She co-chaired ICML96, MSL98, ECML-PKDD 2003, IEA-AIE 2005, ISMIS 2006.
Stefano Ferilli was born in 1972. After receiving his Laurea degree in Information Science in 1996, he got a Ph.D. in Computer Science at
the University of Bari in 2001. Since 2002 he is an Assistant Professor at the Department of Computer Science of the University
of Bari. His research interests are centered on Logic and Algebraic Foundations of Machine Learning, Inductive Logic Programming,
Theory Revision, Multi-Strategy Learning, Knowledge Representation, Electronic Document Processing and Digital Libraries.
He participated in various National and European (ESPRIT and IST) projects concerning these topics, and is a (co-)author of
more than 80 papers published on National and International journals, books and conferences/workshops proceedings.
Teresa M.A. Basile got the Laurea degree in Computer Science at the University of Bari, Italy (2001). In March 2005 she discussed a Ph.D. thesis
in Computer Science at the University of Bari titled “A Multistrategy Framework for First-Order Rules Learning.” Since April
2005, she is a research at the Computer Science Department of the University of Bari working on methods and techniques of
machine learning for the Semantic Web. Her research interests concern the investigation of symbolic machine learning techniques,
in particular of the cooperation of different inferences strategies in an incremental learning framework, and their application
to document classification and understanding based on their semantic. She is author of about 40 papers published on National
and International journals and conferences/workshops proceedings and was/is involved in various National and European projects.
Nicola Di Mauro got the Laurea degree in Computer Science at the University of Bari, Italy. From 2001 he went on making research on machine
learning in the Knowledge Acquisition and Machine Learning Laboratory (LACAM) at the Department of Computer Science, University
of Bari. In March 2005 he discussed a Ph.D. thesis in Computer Science at the University of Bari titled “First Order Incremental
Theory Refinement” which faces the problem of Incremental Learning in ILP. Since January 2005, he is an assistant professor
at the Department of Computer Science, University of Bari. His research activities concern Inductive Logic Programming (ILP),
Theory Revision and Incremental Learning, Multistrategy Learning, with application to Automatic Document Processing. On such
topics HE is author of about 40 scientific papers accepted for presentation and publication on international and national
journals and conference proceedings. He took part to the European projects 6th FP IP-507173 VIKEF (Virtual Information and
Knowledge Environment Framework) and IST-1999-20882 COLLATE (Collaboratory for Annotation, Indexing and Retrieval of Digitized
Historical Archive Materials), and to various national projects co-funded by the Italian Ministry for the University and Scientific
Research. 相似文献
5.
Chance discovery and scenario analysis 总被引:1,自引:0,他引:1
Scenario analysis is often used to identify possible chance events. However, no formal, computational theory yet exists for
scenario analysis. In this paper, we commence development of such a theory by defining a scenario in an argumentation context,
and by considering the question of when two scenarios are the same.
Peter McBurney, Ph.D.: He is a lecturer in the Department of Computer Science at the University of Liverpool, UK. He has a first degree in Pure
Mathematics and Statistics from the Australian National University, Canberra, and a Ph.D in Artificial Intelligence from the
University of Liverpool. His Ph.D research concerned the design of protocols for rational interaction between autonomous software
agents, and he has several publications in this area. Prior to completing his Ph.D he worked as a consultant to major telecommunications
network operating companies, primarily in mobile and satellite communications, where his work involved strategic marketing
programming.
Simon Parsons, Ph.D.: He is currently visiting the Sloan School of Management at Massachusetts Institute of Technology (MIT) and is a Visiting
Professor at the University of Liverpool, UK. He holds a first degree in Engineering from Cambridge University, and an MSc
and Ph.D in Artificial Intelligence from the University of London. In 1998, he was awarded the Young Engineer Achievement
Medal of the British Institution of Electrical Engineers (IEE), the largest professional engineering society in Europe. He
has published 4 books and over 100 articles on autonomous agents and multi-agent systems, uncertainty formalisms, risk and
decision-making. 相似文献
6.
A separation method for DNA computing based on concentration control is presented. The concentration control method was earlier
developed and has enabled us to use DNA concentrations as input data and as filters to extract target DNA. We have also applied
the method to the shortest path problems, and have shown the potential of concentration control to solve large-scale combinatorial
optimization problems. However, it is still quite difficult to separate different DNA with the same length and to quantify
individual DNA concentrations. To overcome these difficulties, we use DGGE and CDGE in this paper. We demonstrate that the
proposed method enables us to separate different DNA with the same length efficiently, and we actually solve an instance of
the shortest path problems.
Masahito Yamamoto, Ph.D.: He is associate professor of information engineering at Hokkaido University. He received Ph.D. from the Graduate School
of Engineering, Hokkaido University in 1996. His current research interests include DNA computing based the laboratory experiments.
He is a member of Operations Research Society of Japan, Japanese Society for Artificial Intelligence, Information Processing
Society of Japan etc.
Atsushi Kameda, Ph.D.: He is the research staff of Japan Science and Technology Corporation, and has participated in research of DNA computing
in Hokkaido University. He received his Ph.D. from Hokkaido University in 2001. For each degree he majored in molecular biology.
His research theme is about the role of polyphosphate in the living body. As one of the researches relevant to it, he constructed
the ATP regeneration system using two enzyme which makes polyphosphate the phosphagen.
Nobuo Matsuura: He is a master course student of Division of Systems and Information Engineering of Hokkaido University. His research interests
relate to DNA computing with concentration control for shortest path problems, as a means of solution of optimization problems
with bimolecular.
Toshikazu Shiba, Ph.D.: He is associate, professor of biochemical engineering at Hokkaido University. He received his Ph.D. from Osaka University
in 1991. He majored in molecular genetics and biochemistry. His research has progressed from bacterial molecular biology (regulation
of gene expression of bacterial cells) to tissue engineering (bone regeneration). Recently, he is very interested in molecular
computation and trying to apply his biochemical idea to information technology.
Yumi Kawazoe: She is a master course student of Division of Molecular Chemistry of Hokkaido University. Although her major is molecular
biology, she is very interested in molecular computation and bioinformatics.
Azuma Ohuchi, Ph.D.: He is professor of Information Engineering at the University of Hokkaido, Sapporo, Japan. He has been developing a new field
of complex systems engineering, i.e., Harmonious Systems Engineering since 1995. He has published numerous papers on systems
engineering, operations research, and computer science. In addition, he is currently supervising projects on DNA computing,
multi-agents based artificial market systems, medical informatics, and autonomous flying objects. He was awarded “The 30th
Anniversary Award for Excellent Papers” by the Information Processing Society of Japan. He is a member of Operations Research
Society of Japan, Japanese Society for Artificial Intelligence, Information Processing Society of Japan, Japan Association
for Medical Informatics, IEEE Computer Society, IEEE System, Man and Cybernetics Society etc. He received PhD from Hokkaido
University in 1976. 相似文献
7.
C. Urdiales E. J. Perez J. Vázquez-Salceda M. Sànchez-Marrè F. Sandoval 《Autonomous Robots》2006,21(1):65-78
This paper presents a new sonar based purely reactive navigation technique for mobile platforms. The method relies on Case-Based
Reasoning to adapt itself to any robot and environment through learning, both by observation and self experience. Thus, unlike
in other reactive techniques, kinematics or dynamics do not need to be explicitly taken into account. Also, learning from
different sources allows combination of their advantages into a safe and smooth path to the goal. The method has been succesfully
implemented on a Pioneer robot wielding 8 Polaroid sonar sensors.
Cristina Urdiales is a Lecturer at the Department of Tecnología Electrónica (DTE) of the University of Málaga (UMA). She received a MSc degree
in Telecommunication Engineering at the Universidad Politécnica de Madrid (UPM) and her Ph.D. degree at University of Málaga
(UMA). Her research is focused on robotics and computer vision.
E.J. Pérez was born in Barcelona, Spain, in 1974. He received his title of Telecommunication Engineering from the University of Málaga,
Spain, in 1999. During 1999 he worked in a research project under a grant by the Spanish CYCIT. From 2000 to the present day
he has worked as Assistant Professor in the Department of Tecnología Electrónica of the University of Málaga. His research
is focused on robotics and artificial vision.
Javier Vázquez-Salceda is an Associate Researcher of the Artificial Intelligence Section of the Software Department (LSI), at the Technical University
of Catalonia (UPC). Javier obtained an MSc degree in Computer Science at UPC. After his master studies he became research
assistant in the KEMLg Group at UPC. In 2003 he presented his Ph.D. dissertation (with honours), which has been awarded with
the 2003 ECCAI Artificial Intelligence Dissertation Award. The dissertation has been also recently published as a book by
Birkhauser-Verlag. From 2003 to 2005 he was researcher in the Intelligent Systems Group at Utrecht University. Currently he
is again member of the KEMLg Group at UPC. His research is focused on theoretical and applied issues of Normative Systems,
software and physical agents' autonomy and social control, especially in distributed applications for complex domains such
as eCommerce or Medicine.
Miquel Sànchez-Marrè (Barcelona, 1964) received a Ph.D. in Computer Science in 1996 from the Technical University of Catalonia (UPC). He is Associate
Professor in the Computer Software Department (LSI) of the UPC since 1990 (tenure 1996). He was the head of the Artificial
Intelligence section of LSI (1997–2000). He is a pioneer member of International Environmental Modelling and Software Society
(IEMSS) and a board member of IEMSS also, since 2000. He is a member of the Editorial Board of International Journal of Applied
Intelligence, since October 2001. Since October 2004 he is Associate Editor of Environmental Modelling and Software journal.
His main research topics are case-based reasoning, machine learning, knowledge acquisition and data mining, knowledge engineering,
intelligent decision-support systems, and integrated AI architectures. He has an special interest on the application of AI
techniques to Environmental Decision Support Systems.
Francisco Sandoval was born in Spain in 1947. He received the title of Telecommunication Engineering and Ph.D. degree from the Technical University
of Madrid, Spain, in 1972 and 1980, respectively. From 1972 to 1989 he was engaged in teaching and research in the fields
of opto-electronics and integrated circuits in the Universidad Politécnica de Madrid (UPM) as an Assistant Professor and a
Lecturer successively. In 1990 he joined the University of Málaga as Full Professor in the Department of Tecnología Electrónica.
He is currently involved in autonomous systems and foveal vision, application of Artificial Neural Networks to Energy Management
Systems, and in Broad Band and Multimedia Communication. 相似文献
8.
Manish Gupta Manghui Tu Latifur Khan Farokh Bastani I-Ling Yen 《Knowledge and Information Systems》2005,8(4):414-437
Advances in wireless and mobile computing environments allow a mobile user to access a wide range of applications. For example,
mobile users may want to retrieve data about unfamiliar places or local life styles related to their location. These queries
are called location-dependent queries. Furthermore, a mobile user may be interested in getting the query results repeatedly,
which is called location-dependent continuous querying. This continuous query emanating from a mobile user may retrieve information
from a single-zone (single-ZQ) or from multiple neighbouring zones (multiple-ZQ). We consider the problem of handling location-dependent
continuous queries with the main emphasis on reducing communication costs and making sure that the user gets correct current-query
result. The key contributions of this paper include: (1) Proposing a hierarchical database framework (tree architecture and
supporting continuous query algorithm) for handling location-dependent continuous queries. (2) Analysing the flexibility of
this framework for handling queries related to single-ZQ or multiple-ZQ and propose intelligent selective placement of location-dependent
databases. (3) Proposing an intelligent selective replication algorithm to facilitate time- and space-efficient processing
of location-dependent continuous queries retrieving single-ZQ information. (4) Demonstrating, using simulation, the significance
of our intelligent selective placement and selective replication model in terms of communication cost and storage constraints,
considering various types of queries.
Manish Gupta received his B.E. degree in Electrical Engineering from Govindram Sakseria Institute of Technology & Sciences, India, in
1997 and his M.S. degree in Computer Science from University of Texas at Dallas in 2002. He is currently working toward his
Ph.D. degree in the Department of Computer Science at University of Texas at Dallas. His current research focuses on AI-based
software synthesis and testing. His other research interests include mobile computing, aspect-oriented programming and model
checking.
Manghui Tu received a Bachelor degree of Science from Wuhan University, P.R. China, in 1996, and a Master's Degree in Computer Science
from the University of Texas at Dallas 2001. He is currently working toward the Ph.D. degree in the Department of Computer
Science at the University of Texas at Dallas. Mr. Tu's research interests include distributed systems, wireless communications,
mobile computing, and reliability and performance analysis. His Ph.D. research work focuses on the dependent and secure data
replication and placement issues in network-centric systems.
Latifur R. Khan has been an Assistant Professor of Computer Science department at University of Texas at Dallas since September 2000. He
received his Ph.D. and M.S. degrees in Computer Science from University of Southern California (USC) in August 2000 and December
1996, respectively. He obtained his B.Sc. degree in Computer Science and Engineering from Bangladesh University of Engineering
and Technology, Dhaka, Bangladesh, in November of 1993. Professor Khan is currently supported by grants from the National
Science Foundation (NSF), Texas Instruments, Alcatel, USA, and has been awarded the Sun Equipment Grant. Dr. Khan has more
than 50 articles, book chapters and conference papers focusing in the areas of database systems, multimedia information management
and data mining in bio-informatics and intrusion detection. Professor Khan has also served as a referee for database journals,
conferences (e.g. IEEE TKDE, KAIS, ADL, VLDB) and he is currently serving as a program committee member for the 11th ACM SIGKDD
International Conference on Knowledge Discovery and Data Mining (SIGKDD2005), ACM 14th Conference on Information and Knowledge
Management (CIKM 2005), International Conference on Database and Expert Systems Applications DEXA 2005 and International Conference
on Cooperative Information Systems (CoopIS 2005), and is program chair of ACM SIGKDD International Workshop on Multimedia
Data Mining, 2004.
Farokh Bastani received the B.Tech. degree in Electrical Engineering from the Indian Institute of Technology, Bombay, and the M.S. and Ph.D.
degrees in Computer Science from the University of California, Berkeley. He is currently a Professor of Computer Science at
the University of Texas at Dallas. Dr. Bastani's research interests include various aspects of the ultrahigh dependable systems,
especially automated software synthesis and testing, embedded real-time process-control and telecommunications systems and
high-assurance systems engineering.
Dr. Bastani was the Editor-in-Chief of the IEEE Transactions on Knowledge and Data Engineering (IEEE-TKDE). He is currently
an emeritus EIC of IEEE-TKDE and is on the editorial board of the International Journal of Artificial Intelligence Tools,
the International Journal of Knowledge and Information Systems and the Springer-Verlag series on Knowledge and Information
Management. He was the program cochair of the 1997 IEEE Symposium on Reliable Distributed Systems, 1998 IEEE International
Symposium on Software Reliability Engineering, 1999 IEEE Knowledge and Data Engineering Workshop, 1999 International Symposium
on Autonomous Decentralised Systems, and the program chair of the 1995 IEEE International Conference on Tools with Artificial
Intelligence. He has been on the program and steering committees of several conferences and workshops and on the editorial
boards of the IEEE Transactions on Software Engineering, IEEE Transactions on Knowledge and Data Engineering and the Oxford
University Press High Integrity Systems Journal.
I-Ling Yen received her B.S. degree from Tsing-Hua University, Taiwan, and her M.S. and Ph.D. degrees in Computer Science from the University
of Houston. She is currently an Associate Professor of Computer Science at University of Texas at Dallas. Dr. Yen's research
interests include fault-tolerant computing, security systems and algorithms, distributed systems, Internet technologies, E-commerce
and self-stabilising systems. She has published over 100 technical papers in these research areas and received many research
awards from NSF, DOD, NASA and several industry companies. She has served as Program Committee member for many conferences
and Program Chair/Cochair for the IEEE Symposium on Application-Specific Software and System Engineering & Technology, IEEE
High Assurance Systems Engineering Symposium, IEEE International Computer Software and Applications Conference, and IEEE International
Symposium on Autonomous Decentralized Systems. She has also served as a guest editor for a theme issue of IEEE Computer devoted
to high-assurance systems. 相似文献
9.
Alexandros Kalousis Julien Prados Melanie Hilario 《Knowledge and Information Systems》2007,12(1):95-116
With the proliferation of extremely high-dimensional data, feature selection algorithms have become indispensable components
of the learning process. Strangely, despite extensive work on the stability of learning algorithms, the stability of feature
selection algorithms has been relatively neglected. This study is an attempt to fill that gap by quantifying the sensitivity
of feature selection algorithms to variations in the training set. We assess the stability of feature selection algorithms
based on the stability of the feature preferences that they express in the form of weights-scores, ranks, or a selected feature
subset. We examine a number of measures to quantify the stability of feature preferences and propose an empirical way to estimate
them. We perform a series of experiments with several feature selection algorithms on a set of proteomics datasets. The experiments
allow us to explore the merits of each stability measure and create stability profiles of the feature selection algorithms.
Finally, we show how stability profiles can support the choice of a feature selection algorithm.
Alexandros Kalousis received the B.Sc. degree in computer science, in 1994, and the M.Sc. degree in advanced information systems, in 1997, both
from the University of Athens, Greece. He received the Ph.D. degree in meta-learning for classification algorithm selection
from the University of Geneva, Department of Computer Science, Geneva, in 2002. Since then he is a Senior Researcher in the
same university. His research interests include relational learning with kernels and distances, stability of feature selection
algorithms, and feature extraction from spectral data.
Julien Prados is a Ph.D. student at the University of Geneva, Switzerland. In 1999 and 2001, he received the B.Sc. and M.Sc. degrees in
computer science from the University Joseph Fourier (Grenoble, France). After a year of work in industry, he joined the Geneva
Artificial Intelligence Laboratory, where he is working on bioinformatics and datamining tools for mass spectrometry data
analysis.
Melanie Hilario has a Ph.D. in computer science from the University of Paris VI and currently works at the University of Geneva’s Artificial
Intelligence Laboratory. She has initiated and participated in several European research projects on neuro-symbolic integration,
meta-learning, and biological text mining. She has served on the program committees of many conferences and workshops in machine
learning, data mining, and artificial intelligence. She is currently an Associate Editor of theInternational Journal on Artificial Intelligence Toolsand a member of the Editorial Board of theIntelligent Data Analysis journal. 相似文献
10.
Mining user access patterns with traversal constraint for predicting web page requests 总被引:4,自引:4,他引:0
Mei-Ling Shyu Choochart Haruechaiyasak Shu-Ching Chen 《Knowledge and Information Systems》2006,10(4):515-528
The recent increase in HyperText Transfer Protocol (HTTP) traffic on the World Wide Web (WWW) has generated an enormous amount of log records on Web server databases. Applying Web mining techniques on these server log records can discover potentially useful patterns and reveal user access behaviors on the Web site. In this paper, we propose a new approach for mining user access patterns for predicting Web page requests, which consists of two steps. First, the Minimum Reaching Distance (MRD) algorithm is applied to find the distances between the Web pages. Second, the association rule mining technique is applied to form a set of predictive rules, and the MRD information is used to prune the results from the association rule mining process. Experimental results from a real Web data set show that our approach improved the performance over the existing Markov-model approach in precision, recall, and the reduction of user browsing time.
Mei-Ling Shyu received her Ph.D. degree from the School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN in 1999, and three Master's degrees from Computer Science, Electrical Engineering, and Restaurant, Hotel, Institutional, and Tourism Management from Purdue University. She has been an Associate Professor in the Department of Electrical and Computer Engineering (ECE) at the University of Miami (UM), Coral Gables, FL, since June 2005, Prior to that, she was an Assistant Professor in ECE at UM dating from January 2000. Her research interests include data mining, multimedia database systems, multimedia networking, database systems, and security. She has authored and co-authored more than 120 technical papers published in various prestigious journals, refereed conference/symposium/workshop proceedings, and book chapters. She is/was the guest editor of several journal special issues.
Choochart Haruechaiyasak received his Ph.D. degree from the Department of Electrical and Computer Engineering, University of Miami, in 2003 with the Outstanding Departmental Graduating Student award from the College of Engineering. After receiving his degree, he has joined the National Electronics and Computer Technology Center (NECTEC), located in Thailand Science Park, as a researcher in Information Research and Development Division (RDI). His current research interests include data/ text/ Web mining, Natural Language Processing, Information Retrieval, Search Engines, and Recommender Systems. He is currently leading a small group of researchers and programmer to develop an open-source search engine for Thai language. One of his objectives is to promote the use of data mining technology and other advanced applications in Information Technology in Thailand. He is also a visiting lecturer for Data Mining, Artificial Intelligence and Decision Support Systems courses in many universities in Thailand.
Shu-Ching Chen received his Ph.D. from the School of Electrical and Computer Engineering at Purdue University, West Lafayette, IN, USA in December, 1998. He also received Master's degrees in Computer Science, Electrical Engineering, and Civil Engineering from Purdue University. He has been an Associate Professor in the School of Computing and Information Sciences (SCIS), Florida International University (FIU) since August, 2004. Prior to that, he was an Assistant Professor in SCIS at FIU dating from August, 1999. His main research interests include distributed multimedia database systems and multimedia data mining. Dr. Chen has authored and co-authored more than 140 research papers in journals, refereed conference/symposium/workshop proceedings, and book chapters. In 2005, he was awarded the IEEE Systems, Man, and Cybernetics Society's Outstanding Contribution Award. He was also awarded a University Outstanding Faculty Research Award from FIU in 2004, Outstanding Faculty Service Award from SCIS in 2004 and Outstanding Faculty Research Award from SCIS in 2002. 相似文献
11.
A Technique for Adaptive Scheduling of Soft Real-Time Tasks 总被引:1,自引:1,他引:0
A number of multimedia and process control applications can take advantage from the ability to adapt soft real-time load to
available computational capacity. This capability is required, for example, to react to changed operating conditions as well
as to ensure graceful degradation of an application under transient overloads. In this paper, we illustrate a novel adaptive
scheduling technique based on rate modulation of a set of periodic tasks in a range of admissible rates. By casting constraints
on rate ranges in a linear programming formulation, several adaptation policies can be considered, along with additional constraints
reflecting various application requirements. The paper investigates the effectiveness of rate modulation strategies both on
simulated task sets and on real experiments.
Partial support for this research has been provided by MURST, Italy (PRIN project ISIDE on “Dependable reactive computing
systems for industrial applications” and special project “RoboCare” funded by L. 449/97), and by ASI, Agenzia Spaziale Italiana
(contract I/R/134/00).
Giuseppe Beccari received the Laurea degree in Electronic Engineering in 1993, and the Ph.D. in Information Technology in 1999, both from
the University of Parma, Italy. In 1995 he was visiting scholar at the Technical University of Delft, Holland, and at the
Laboratoire de Robotique de Paris, France. In 1999 he was employed by CSELT (Centro Studi E Laboratori Telecomunicazioni,
currently TILAB, the Telecom Italia Group research center). In 2002 he moved to a spin off company involved in the EUROSAM/FSAF
(Future Surface-to-Air Family self defense missile system) project. While his current professional duties focus more on software
development and team coordination, dr. Beccari still enjoys investigating real-time scheduling issues and technology.
Stefano Caselli received a Laurea degree in Electronic Engineering in 1982 and the Ph.D. degree in Computer and Electronic Engineering in
1987, both from the University of Bologna, Italy. In 1989-90 he has been visiting scholar at the University of Florida. From
1990 to 1999 he has held research fellow and associate professor positions at the University of Parma, Italy. He is now professor
of Computer Engineering at the University of Parma, where he is also director of the Laboratory of Robotics and Intelligent
Machines (RIMLab). His current research interests include development of autonomous and remotely operated robot systems, service
robotics, and real-time systems.
Francesco Zanichelli received a Laurea degree in Electronic Engineering in 1987 from the University of Bologna, Italy and the Ph.D. degree in
Information Technologies in 1994 from the University of Parma, Italy. Since 1996 he has been an Assistant Professor with the
Department of Information Engineering of the University of Parma where he is currently teaching Operating Systems, Information
Systems and Multimedia Systems courses. His current research interests include distributed multimedia architectures and protocols,
real-time systems, security and Quality of Service technologies for wireless networks, as well as service-oriented Grid middleware. 相似文献
12.
Xiu-LiMa Yun-HaiTong Shi-WeiTang Dong-QingYang 《计算机科学技术学报》2004,19(6):0-0
Mining frequent patterns has been studied popularly in data mining area. However, little work has been done on mining patterns when the database has an influx of fresh data constantly. In these dynamic scenarios, efficient maintenance of the discovered patterns is crucial. Most existing methods need to scan the entire database repeatedly, which is an obvious disadvantage. In this paper, an efficient incremental mining algorithm, Incremental-Mining (IM), is proposed for maintenance of the frequent patterns when new incremental data come. Based on the frequent pattern tree (FP-tree) structure, IM gives a way to make the most of the things from the previous mining process, and requires scanning the original data once at most. Furthermore, IM can identify directly the differential set of frequent patterns, which may be more informative to users. Moreover, IM can deal with changing thresholds as well as changing data, thus provide a full maintenance scheme. IM has been implemented and the performance study shows it outperforms three other incremental algorithms: FUP, DB-tree and re-running frequent pattern growth (FP-growth). 相似文献
13.
This paper examines two seemingly unrelated qualitative spatial reasoning domains; geometric proportional analogies and topographic
(land-cover) maps. We present a Structure Matching algorithm that combines Gentner’s structuremapping theory with an attributematching process. We use structure matching to solve geometric analogy problems that involve manipulating attribute information, such
as colors and patterns. Structure matching is also used to creatively interpret topographic (land-cover) maps, adding a wealth
of semantic knowledge and providing a far richer interpretation of the raw data. We return to the geometric proportional analogies,
identify alternate attribute matching processes that are required to solve different categories of problems. Finally, we assess
some implications for computationally creative and inventive models.
Diarmuid P. O’Donoghue, Ph.D.: He received his B.Sc. and M.Sc. from University College Cork in 1988 and 1990, and his Ph.D. from University College Dublin.
He has been a lecturer at the Department of Computer Science NUI Maynooth since 1996 and is also an associate of the National
Centre for Geocomputation. His interests are in artificial intelligence, analogical reasoning, topology, and qualitative spatial
reasoning.
Amy Bohan, B.Sc, M.Sc.: She received her B.Sc. from the National University of Ireland, Maynooth in 2000. She received her M.Sc. in 2003 from University
College Dublin where she also recently completed her Ph.D. She is a member of the Cognitive Science society. Her interests
are in cognitive science, analogical argumentation, geometric proportional analogies and computational linguistics.
Prof. Mark T. Keane: He is Chair of Computer Science and Associate Dean of Science at University College Dublin. He is also Director of ICT, at
Science Foundation Ireland. Prof. Keane has made significant contributions in the areas of analogy, case-based reasoning and
creativity. He has published over 100 publications, including 16 books, that are cited widely. He is co-author of a Cognitive
Science textbook, written with Mike Eysenck (University of London) that has been translated into Portuguese, Hungarian, Italian
and Chinese and is now entering its fifth edition. Prof. Keane is a fellow of ECCAI (European Co-ordinating Committee on Artificial
Intelligence) and received the Special Award for Merit from the Psychology Society of Ireland, for his work on human creativity. 相似文献
14.
15.
PAN is a general purpose, portable environment for executing logic programs in parallel. It combines a flexible, distributed
architecture which is resilient to software and platform evolution with facilities for automatically extracting and exploiting
AND and OR parallelism in ordinary Prolog programs. PAN incorporates a range of compile-time and run-time techniques to deliver
the performance benefits of parallel execution while rertaining sequential execution semantics. Several examples illustrate
the efficiency of the controls that facilitate the execution of logic programs in a distributed manner and identify the class
of applications that benefit from distributed platforms like PAN.
George Xirogiannis, Ph.D.: He received his B.S. in Mathematics from the University of Ioannina, Greece in 1993, his M.S in Artificial Intelligence
from the University of Bristol in 1994 and his Ph.D. in Computer Science from Heriot-Watt University, Edinburgh in 1998. His
Ph.D. thesis concerns the automated execution of Prolog on distributed heterogeneous multi-processors. His research interests
have progressed from knowledge-based systems to distributed logic programming and data mining. Currently, he is working as
a senior IT consultant at Pricewaterhouse Coopers. He is also a Research Associate at the National Technical University of
Athens, researching in knowledge and data mining.
Hamish Taylor, Ph.D.: He is a lecturer in Computer Science in the Computing and Electrical Engineering Department of Heriot-Watt University in
Edinburgh. He received M.A. and MLitt degrees in philosophy from Cambridge University and an M.S. and a Ph.D. degree in computer
science from Heriot-Watt University, Scotland. Since 1985 he has worked on research projects concerned with implementing concurrent
logic programming languages, developing formal models for automated reasoning, performance modelling parallel relational database
systems, and visualisizing resources in shared web caches. His current research interests are in applications of collaborative
virtual environments, parallel logic programming and networked computing technologies. 相似文献
16.
Inductive logic programming (ILP) is concerned with the induction of logic programs from examples and background knowledge.
In ILP, the shift of attention from program synthesis to knowledge discovery resulted in advanced techniques that are practically
applicable for discovering knowledge in relational databases. This paper gives a brief introduction to ILP, presents selected
ILP techniques for relational knowledge discovery and reviews selected ILP applications.
Nada Lavrač, Ph.D.: She is a senior research associate at the Department of Intelligent Systems, J. Stefan Institute, Ljubljana, Slovenia (since
1978) and a visiting professor at the Klagenfurt University, Austria (since 1987). Her main research interest is in machine
learning, in particular inductive logic programming and intelligent data analysis in medicine. She received a BSc in Technical
Mathematics and MSc in Computer Science from Ljubljana University, and a PhD in Technical Sciences from Maribor University,
Slovenia. She is coauthor of KARDIO: A Study in Deep and Qualitative Knowledge for Expert Systems, The MIT Press 1989, and
Inductive Logic Programming: Techniques and Applications, Ellis Horwood 1994, and coeditor of Intelligent Data Analysis in
Medicine and Pharmacology, Kluwer 1997. She was the coordinator of the European Scientific Network in Inductive Logic Programming
ILPNET (1993–1996) and program cochair of the 8th European Machine Learning Conference ECML’95, and 7th International Workshop
on Inductive Logic Programming ILP’97.
Sašo Džeroski, Ph.D.: He is a research associate at the Department of Intelligent Systems, J. Stefan Institute, Ljubljana, Slovenia (since 1989).
He has held visiting researcher positions at the Turing Institute, Glasgow (UK), Katholieke Universiteit Leuven (Belgium),
German National Research Center for Computer Science (GMD), Sankt Augustin (Germany) and the Foundation for Research and Technology-Hellas
(FORTH), Heraklion (Greece). His research interest is in machine learning and knowledge discovery in databases, in particular
inductive logic programming and its applications and knowledge discovery in environmental databases. He is co-author of Inductive
Logic Programming: Techniques and Applications, Ellis Horwood 1994. He is the scientific coordinator of ILPnet2, The Network
of Excellence in Inductive Logic Programming. He was program co-chair of the 7th International Workshop on Inductive Logic
Programming ILP’97 and will be program co-chair of the 16th International Conference on Machine Learning ICML’99.
Masayuki Numao, Ph.D.: He is an associate professor at the Department of Computer Science, Tokyo Institute of Technology. He received a bachelor
of engineering in electrical and electronics engineering in 1982 and his Ph.D. in computer science in 1987 from Tokyo Institute
of Technology. He was a visiting scholar at CSLI, Stanford University from 1989 to 1990. His research interests include Artificial
Intelligence, Global Intelligence and Machine Learning. Numao is a member of Information Processing Society of Japan, Japanese
Society for Artificial Intelligence, Japanese Cognitive Science Society, Japan Society for Software Science and Technology
and AAAI. 相似文献
17.
Manolis Gergatsoulis Panos Rondogiannis Themis Panayiotopoulos 《New Generation Computing》2001,19(1):87-100
In this paper we introduce the logic programming languageDisjunctive Chronolog which combines the programming paradigms of temporal and disjunctive logic programming. Disjunctive Chronolog is capable
of expressing dynamic behaviour as well as uncertainty, two notions that are very common in a variety of real systems. We
present the minimal temporal model semantics and the fixpoint semantics for the new programming language and demonstrate their
equivalence. We also show how proof procedures developed for disjunctive logic programs can be easily extended to apply to
Disjunctive Chronolog programs.
Manolis Gergatsoulis, Ph.D.: He received his B.Sc. in Physics in 1983, the M.Sc. and the Ph.D. degrees in Computer Science in 1986 and 1995 respectively
all from the University of Athens, Greece. Since 1996 he is a Research Associate in the Institute of Informatics and Telecommunications,
NCSR ‘Demokritos’, Athens. His research interests include logic and temporal programming, program transformations and synthesis,
as well as theory of programming languages.
Panagiotis Rondogiannis, Ph.D.: He received his B.Sc. from the Department of Computer Engineering and Informatics, University of Patras, Greece, in 1989,
and his M.Sc. and Ph.D. from the Department of Computer Science, University of Victoria, Canada, in 1991 and 1994 respectively.
From 1995 to 1996 he served in the Greek army. From 1996 to 1997 he was a visiting professor in the Department of Computer
Science, University of Ioannina, Greece, and since 1997 he is a Lecturer in the same Department. In January 2000 he was elected
Assistant Professor in the Department of Informatics at the University of Athens. His research interests include functional,
logic and temporal programming, as well as theory of programming languages.
Themis Panayiotopoulos, Ph.D.: He received his Diploma on Electrical Engineering from the Department of Electrical Engineering, National Technical Univesity
of Athens, in 1984, and his Ph.D. on Artificial Intelligence from the above mentioned department in 1989. From 1991 to 1994
he was a visiting professor at the Department of Mathematics, University of the Aegean, Samos, Greece and a Research Associate
at the Institute of Informatics and Telecommunications of “Democritos” National Research Center. Since 1995 he is an Assistant
Prof. at the Department of Computer Science, University of Piraeus. His research interests include temporal programming, logic
programming, expert systems and intelligent agent architectures. 相似文献
18.
We propose a notion of a real-world knowledge medium by presenting our ongoing project to build a guidance system for exhibition
tours. In order to realize a knowledge medium usable in the real world, we focus on the context-awareness of users and their
environments. Our system is a personal mobile assistant that provides visitors touring exhibitions with information based
on their spatial/temporal locations and individual interests. We also describe an application of knowledge sharing used in
the actual exhibition spaces.
Yasuyuki Sumi, Ph.D.: He has been a researcher at ATR Media Integration & Communications Research Laboratories since 1995. His research interests
include knowledge-based systems, creativity supporting systems, and their applications for facilitating human collaboration.
He received his B. Eng. degree from Waseda University in 1990, and M. Eng. and D. Eng. degrees in information engineering
from the University of Tokyo in 1992 and 1995, respectively. He is a member of Institutes of Electronics, Information and
Communication Engineers (IEICE) of Japan, the Information Processing Society of Japan (IPSJ), the Japanese Society for Artificial
Intelligence (JSAI), and American Association for Artificial Intelligence (AAAI).
Kenji Mase, Ph.D.: He received the B.S. degree in Electrical Engineering and the M.S. and Ph.D. degrees in Information Engineering from Nagoya
University in 1979, 1981 and 1992 respectively. He has been with ATR (Advanced Telecommunications Research Institute) Media
Integration & Communications Research Laboratories since 1995 and is currently the head of Department 2. He joined the Nippon
Telegraph and Telephone Corporation (NTT) in 1981 and had been with the NTT Human Interface Laboratories. He was a visiting
researcher at the Media Laboratory, MIT in 1988–1989. His research interests include image sequence processing of human actions,
computer graphics, computer vision, artificial intelligence and their applications for computer-aided communications and human-machine
interfaces. He is a member of the Information Processing Society of Japan (IPSJ), Institutes of Electronics, Information and
Communication Engineers (IEICE) of Japan and IEEE Computer Society. 相似文献
19.
The pairwise attribute noise detection algorithm 总被引:1,自引:3,他引:1
Jason D. Van Hulse Taghi M. Khoshgoftaar Haiying Huang 《Knowledge and Information Systems》2007,11(2):171-190
Analyzing the quality of data prior to constructing data mining models is emerging as an important issue. Algorithms for identifying
noise in a given data set can provide a good measure of data quality. Considerable attention has been devoted to detecting
class noise or labeling errors. In contrast, limited research work has been devoted to detecting instances with attribute
noise, in part due to the difficulty of the problem. We present a novel approach for detecting instances with attribute noise
and demonstrate its usefulness with case studies using two different real-world software measurement data sets. Our approach,
called Pairwise Attribute Noise Detection Algorithm (PANDA), is compared with a nearest neighbor, distance-based outlier detection
technique (denoted DM) investigated in related literature. Since what constitutes noise is domain specific, our case studies
uses a software engineering expert to inspect the instances identified by the two approaches to determine whether they actually
contain noise. It is shown that PANDA provides better noise detection performance than the DM algorithm.
Jason Van Hulse is a Ph.D. candidate in the Department of Computer Science and Engineering at Florida Atlantic University. His research interests
include data mining and knowledge discovery, machine learning, computational intelligence and statistics. He is a student
member of the IEEE and IEEE Computer Society. He received the M.A. degree in mathematics from Stony Brook University in 2000,
and is currently Director, Decision Science at First Data Corporation.
Taghi M. Khoshgoftaar is a professor at the Department of Computer Science and Engineering, Florida Atlantic University, and the director of the
Empirical Software Engineering and Data Mining and Machine Learning Laboratories. His research interests are in software engineering,
software metrics, software reliability and quality engineering, computational intelligence, computer performance evaluation,
data mining, machine learning, and statistical modeling. He has published more than 300 refereed papers in these subjects.
He has been a principal investigator and project leader in a number of projects with industry, government, and other research-sponsoring
agencies. He is a member of the IEEE, the IEEE Computer Society, and IEEE Reliability Society. He served as the program chair
and general chair of the IEEE International Conference on Tools with Artificial Intelligence in 2004 and 2005, respectively.
Also, he has served on technical program committees of various international conferences, symposia, and workshops. He has
served as North American editor of the Software Quality Journal, and is on the editorial boards of the journals Empirical Software Engineering, Software Quality, and Fuzzy Systems.
Haiying Huang received the M.S. degree in computer engineeringfrom Florida Atlantic University, Boca Raton, Florida, USA, in 2002. She
is currently a Ph.D. candidate in the Department of Computer Science and Engineering at Florida Atlantic University. Her research
interests include software engineering, computational intelligence, data mining, software measurement, software reliability,
and quality engineering. 相似文献
20.
It is hard to have knowledge including all events which may have caused observed events. This makes it difficult to infer
significant causes of observed events. However, unexpected relations detected between known events by a computer suggest unknown
events to humans, being combined with the vast human knowledge acquired by rich experience. This paper presents a method to
have a computer express “unknown” hidden causes, i.e. not included in the given knowledge. The inference method of the computer,
for inferring known causes of observed time-series events, is Cost-based Cooperation of Multi-Abducers (CCMA) here aiming
at detecting unexpectedly strong co-occurrences among known events. The detected relations are expressed to user, which makes
significant unknown causal events easily understood. The empirical results encourages that the presented method helps in discovering
significant unknown events.
Yukio Ohsawa, Ph.D.: He is an Associate Professor in the Graduate School of Systems Management, University of Tsukuba. He obtained his bachelors,
masters, and Ph.D. degrees in Engineering from the University of Tokyo in 1990, 1992 and 1995 respectively. He was a research
associate in Osaka University from 1995 to 1999. His research interests are in discovering signs of future events affecting
human life, from data, based on his background of artificial intelligence. He received the Paper Award from the Japanese Society
of Artificial Intelligence in 1999 and some awards for conference papers. He has served on program commitees of several conferences
and workshops on AI and agents, currently chairing Multi-agent and Cooperative Computing workshops (MACC99).
Masahiko Yachida, Ph.D.: He is a professor at the Dept. of Systems Engineering of Osaka University since 1993. He obtained his B. E., M.Sc in electrical
engineering and Ph.D. in control engineering from Osaka University in 1969, 1971, and 1976 respectively. He became a professor
of the Dept. of Information and Computer Science of the same university in 1990, and moved to the current department as a
professor. He was a research fellow at the Fachbereich Informatik, Hamburg University from 1981 to 1982, and a CDC professor
at the Dept. of Computer Science, University of Minessota in 1983. He received several prizes including Ohkawa Publishing
Prize, and is presently a Chairman of Technical Committee on Pattern Recognition & Media Understanding. 相似文献