Mark Last – författare

Today, in the middle of the ?rst decade of the 21st century, the Internet has become a major communication medium, where virtually any kind of content can be transferred instantly and reliably between individual users and entire - ganizations located in any part of the globe. The World Wide Web (WWW) has a tremendous e?ect on our daily activities at work and at home. Consequently, more e?ective and e?cient methods and technologies are needed to make the most of the Web’s nearly unlimited potential. The new Web-related research directions include intelligent methods usually associated with the ?elds of c- putational intelligence, soft computing, and data mining. AWIC, the “Atlantic Web Intelligence Conferences” continue to be a forum for exchange of new ideas and novel practical solutions in this new and exciting area. The conference was born as an initiative of the WIC-Poland and the WIC- Spain Research Centers, both belonging to the Web Intelligence Consortium – WIC (http://wi-consortium.org/). Prior to this year, three AWIC conferences have been held: in Madrid, Spain (2003), in Cancun, Mexico (2004), and in L´ od´ z, Poland (2005). AWIC 2006 took place in Beer-Sheva, Israel during June 5–7, 2006, organized locally by Ben-Gurion University of the Negev. The book presents state-of-the-art developments in the ?eld of computati- ally intelligent methods applied to various aspects and ways of Web exploration.

Today, in the middle of the ?rst decade of the 21st century, the Internet has become a major communication medium, where virtually any kind of content can be transferred instantly and reliably between individual users and entire - ganizations located in any part of the globe. The World Wide Web (WWW) has a tremendous e?ect on our daily activities at work and at home. Consequently, more e?ective and e?cient methods and technologies are needed to make the most of the Web’s nearly unlimited potential. The new Web-related research directions include intelligent methods usually associated with the ?elds of c- putational intelligence, soft computing, and data mining. AWIC, the “Atlantic Web Intelligence Conferences” continue to be a forum for exchange of new ideas and novel practical solutions in this new and exciting area. The conference was born as an initiative of the WIC-Poland and the WIC- Spain Research Centers, both belonging to the Web Intelligence Consortium – WIC (http://wi-consortium.org/). Prior to this year, three AWIC conferences have been held: in Madrid, Spain (2003), in Cancun, Mexico (2004), and in L´ od´ z, Poland (2005). AWIC 2006 took place in Beer-Sheva, Israel during June 5–7, 2006, organized locally by Ben-Gurion University of the Negev. The book presents state-of-the-art developments in the ?eld of computati- ally intelligent methods applied to various aspects and ways of Web exploration.

Graph theory has strong historical roots in mathematics, especially in topology. Its birth is usually associated with the “four-color problem” posed by Francis Guthrie 1 in 1852, but its real origin probably goes back to the Seven Bridges of Konigsber ¨ g 2 problem proved by Leonhard Euler in 1736. A computational solution to these two completely different problems could be found after each problem was abstracted to the level of a graph model while ignoring such irrelevant details as country shapes or cross-river distances. In general, a graph is a nonempty set of points (vertices) and the most basic information preserved by any graph structure refers to adjacency relationships (edges) between some pairs of points. In the simplest graphs, edges do not have to hold any attributes, except their endpoints, but in more sophisticated graph structures, edges can be associated with a direction or assigned a label. Graph vertices can be labeled as well. A graph can be represented graphically as a drawing (vertex=dot,edge=arc),but,aslongaseverypairofadjacentpointsstaysconnected by the same edge, the graph vertices can be moved around on a drawing without changing the underlying graph structure. The expressive power of the graph models placing a special emphasis on c- nectivity between objects has made them the models of choice in chemistry, physics, biology, and other ?elds.

Graph theory has strong historical roots in mathematics, especially in topology. Its birth is usually associated with the “four-color problem” posed by Francis Guthrie 1 in 1852, but its real origin probably goes back to the Seven Bridges of Konigsber ¨ g 2 problem proved by Leonhard Euler in 1736. A computational solution to these two completely different problems could be found after each problem was abstracted to the level of a graph model while ignoring such irrelevant details as country shapes or cross-river distances. In general, a graph is a nonempty set of points (vertices) and the most basic information preserved by any graph structure refers to adjacency relationships (edges) between some pairs of points. In the simplest graphs, edges do not have to hold any attributes, except their endpoints, but in more sophisticated graph structures, edges can be associated with a direction or assigned a label. Graph vertices can be labeled as well. A graph can be represented graphically as a drawing (vertex=dot,edge=arc),but,aslongaseverypairofadjacentpointsstaysconnected by the same edge, the graph vertices can be moved around on a drawing without changing the underlying graph structure. The expressive power of the graph models placing a special emphasis on c- nectivity between objects has made them the models of choice in chemistry, physics, biology, and other ?elds.

A sharp increase in the computing power of modern computers, accompanied by a decrease in the data storage costs, has triggered the development of extremely powerful algorithms that can analyze complex patterns in large amounts of data within a very short period of time. Consequently, it has become possible to apply pattern recognition techniques to new tasks characterized by tight real-time requirements (e.g., person identification) and/or high complexity of raw data (e.g., clustering trajectories of mobile objects). The main goal of this book is to cover some of the latest application domains of pattern recognition while presenting novel techniques that have been developed or customized in those domains.

Today, in the middle of the ?rst decade of the 21st century, the Internet has become a major communication medium, where virtually any kind of content can be transferred instantly and reliably between individual users and entire - ganizations located in any part of the globe. The World Wide Web (WWW) has a tremendous e?ect on our daily activities at work and at home. Consequently, more e?ective and e?cient methods and technologies are needed to make the most of the Web’s nearly unlimited potential. The new Web-related research directions include intelligent methods usually associated with the ?elds of c- putational intelligence, soft computing, and data mining. AWIC, the “Atlantic Web Intelligence Conferences” continue to be a forum for exchange of new ideas and novel practical solutions in this new and exciting area. The conference was born as an initiative of the WIC-Poland and the WIC- Spain Research Centers, both belonging to the Web Intelligence Consortium – WIC (http://wi-consortium.org/). Prior to this year, three AWIC conferences have been held: in Madrid, Spain (2003), in Cancun, Mexico (2004), and in L´ od´ z, Poland (2005). AWIC 2006 took place in Beer-Sheva, Israel during June 5–7, 2006, organized locally by Ben-Gurion University of the Negev. The book presents state-of-the-art developments in the ?eld of computati- ally intelligent methods applied to various aspects and ways of Web exploration.

Graph theory has strong historical roots in mathematics, especially in topology. Its birth is usually associated with the “four-color problem” posed by Francis Guthrie 1 in 1852, but its real origin probably goes back to the Seven Bridges of Konigsber ¨ g 2 problem proved by Leonhard Euler in 1736. A computational solution to these two completely different problems could be found after each problem was abstracted to the level of a graph model while ignoring such irrelevant details as country shapes or cross-river distances. In general, a graph is a nonempty set of points (vertices) and the most basic information preserved by any graph structure refers to adjacency relationships (edges) between some pairs of points. In the simplest graphs, edges do not have to hold any attributes, except their endpoints, but in more sophisticated graph structures, edges can be associated with a direction or assigned a label. Graph vertices can be labeled as well. A graph can be represented graphically as a drawing (vertex=dot,edge=arc),but,aslongaseverypairofadjacentpointsstaysconnected by the same edge, the graph vertices can be moved around on a drawing without changing the underlying graph structure. The expressive power of the graph models placing a special emphasis on c- nectivity between objects has made them the models of choice in chemistry, physics, biology, and other ?elds.

A sharp increase in the computing power of modern computers, accompanied by a decrease in the data storage costs, has triggered the development of extremely powerful algorithms that can analyze complex patterns in large amounts of data within a very short period of time. Consequently, it has become possible to apply pattern recognition techniques to new tasks characterized by tight real-time requirements (e.g., person identification) and/or high complexity of raw data (e.g., clustering trajectories of mobile objects). The main goal of this book is to cover some of the latest application domains of pattern recognition while presenting novel techniques that have been developed or customized in those domains.

The volume offers a comprehensive coverage of the recent advances in the application of soft computing and fuzzy logic theory to data mining and knowledge discovery databases. It focuses on some of the hardest, and yet unsolved, issues of data mining like understandability of patterns, finding complex relationships between attributes, handling missing and noisy data, mining very large datasets, change detection in time series, and integration of the discovery process with database management systems.

Many business decisions are made in the absence of complete information about the decision consequences. Credit lines are approved without knowing the future behavior of the customers; stocks are bought and sold without knowing their future prices; parts are manufactured without knowing all the factors affecting their final quality; etc. All these cases can be categorized as decision making under uncertainty. Decision makers (human or automated) can handle uncertainty in different ways. Deferring the decision due to the lack of sufficient information may not be an option, especially in real-time systems. Sometimes expert rules, based on experience and intuition, are used. Decision tree is a popular form of representing a set of mutually exclusive rules. An example of a two-branch tree is: if a credit applicant is a student, approve; otherwise, decline. Expert rules are usually based on some hidden assumptions, which are trying to predict the decision consequences. A hidden assumption of the last rule set is: a student will be a profitable customer. Since the direct predictions of the future may not be accurate, a decision maker can consider using some information from the past. The idea is to utilize the potential similarity between the patterns of the past (e.g., "most students used to be profitable") and the patterns of the future (e.g., "students will be profitable").

Many business decisions are made in the absence of complete information about the decision consequences. Credit lines are approved without knowing the future behavior of the customers; stocks are bought and sold without knowing their future prices; parts are manufactured without knowing all the factors affecting their final quality; etc. All these cases can be categorized as decision making under uncertainty. Decision makers (human or automated) can handle uncertainty in different ways. Deferring the decision due to the lack of sufficient information may not be an option, especially in real-time systems. Sometimes expert rules, based on experience and intuition, are used. Decision tree is a popular form of representing a set of mutually exclusive rules. An example of a two-branch tree is: if a credit applicant is a student, approve; otherwise, decline. Expert rules are usually based on some hidden assumptions, which are trying to predict the decision consequences. A hidden assumption of the last rule set is: a student will be a profitable customer. Since the direct predictions of the future may not be accurate, a decision maker can consider using some information from the past. The idea is to utilize the potential similarity between the patterns of the past (e.g., "most students used to be profitable") and the patterns of the future (e.g., "students will be profitable").

Software is an integral part of our lives today. Modern software systems are highly complex and often pose new challenges in different aspects of Software Engineering (SE).Artificial Intelligence (AI) is a growing field in computer science that has been proven effective in applying and developing AI techniques to address various SE challenges.This unique compendium covers applications of state-of-the-art AI techniques to the key areas of SE (design, development, debugging, testing, etc).All the materials presented are up-to-date. This reference text will benefit researchers, academics, professionals, and postgraduate students in AI, machine learning and software engineering.Related Link(s)

This unique compendium provides a comprehensive overview of the state-of-the-art methods in the extremely "hot" area of online propaganda detection and monitoring. It discusses the difficulties of developing automated methods and systems for online propaganda and misinformation detection, along with the potential contributions of machine learning techniques.The presented methods are built upon the latest AI and Natural Language Processing technologies. Case studies refer to recent events such as the COVID-19 pandemic and the Russian-Ukrainian military conflict.This useful reference text benefits academics, researchers, professionals and graduate students in AI, NLP, machine learning and information sciences.

The edited volume includes papers in the fields of fuzzy mathematical analysis and advances in computational mathematics. The fields of fuzzy mathematical analysis and advances in computational mathematics can provide valuable solutions to complex problems. They have been applied in multiple areas such as high dimensional data analysis, medical diagnosis, computer vision, hand-written character recognition, pattern recognition, machine intelligence, weather forecasting, network optimization, VLSI design, etc. The volume covers ongoing research in fuzzy and computational mathematical analysis and brings forward its recent applications to important real-world problems in various fields. The book includes selected high-quality papers from the International Conference on Fuzzy Mathematical Analysis and Advances in Computational Mathematics (FMAACM 2020).

The edited volume includes papers in the fields of fuzzy mathematical analysis and advances in computational mathematics. The fields of fuzzy mathematical analysis and advances in computational mathematics can provide valuable solutions to complex problems. They have been applied in multiple areas such as high dimensional data analysis, medical diagnosis, computer vision, hand-written character recognition, pattern recognition, machine intelligence, weather forecasting, network optimization, VLSI design, etc. The volume covers ongoing research in fuzzy and computational mathematical analysis and brings forward its recent applications to important real-world problems in various fields. The book includes selected high-quality papers from the International Conference on Fuzzy Mathematical Analysis and Advances in Computational Mathematics (FMAACM 2020).

An inadequate infrastructure for software testing is causing major losses to the world economy. The characteristics of software quality problems are quite similar to other tasks successfully tackled by artificial intelligence techniques. The aims of this book are to present state-of-the-art applications of artificial intelligence and data mining methods to quality assurance of complex software systems, and to encourage further research in this important and challenging area.

This book describes exciting new opportunities for utilizing robust graph representations of data with common machine learning algorithms. Graphs can model additional information which is often not present in commonly used data representations, such as vectors. Through the use of graph distance — a relatively new approach for determining graph similarity — the authors show how well-known algorithms, such as k-means clustering and k-nearest neighbors classification, can be easily extended to work with graphs instead of vectors. This allows for the utilization of additional information found in graph representations, while at the same time employing well-known, proven algorithms.To demonstrate and investigate these novel techniques, the authors have selected the domain of web content mining, which involves the clustering and classification of web documents based on their textual substance. Several methods of representing web document content by graphs are introduced; an interesting feature of these representations is that they allow for a polynomial time distance computation, something which is typically an NP-complete problem when using graphs. Experimental results are reported for both clustering and classification in three web document collections using a variety of graph representations, distance measures, and algorithm parameters.In addition, this book describes several other related topics, many of which provide excellent starting points for researchers and students interested in exploring this new area of machine learning further. These topics include creating graph-based multiple classifier ensembles through random node selection and visualization of graph-based data using multidimensional scaling.

As became apparent after the tragic events of September 11, 2001, terrorist groups are increasingly using the Internet as a communication and propaganda tool where they can safely communicate with their affiliates, coordinate action plans, raise funds, and introduce new supporters to their networks. This is evident from the large number of web sites run by different terrorist organizations, though the URLs and geographical locations of these web sites are frequently moved around the globe. The wide use of the Internet by terrorists makes some people think that the risk of a major cyber-attack against the communication infrastructure is low. However, this situation may change abruptly once the terrorists decide that the Net does not serve their purposes anymore and, like any other invention of our civilization, deserves destruction.Fighting Terror in Cyberspace is a unique volume, which provides, for the first time, a comprehensive overview of terrorist threats in cyberspace along with state-of-the-art tools and technologies that can deal with these threats in the present and in the future. The book covers several key topics in cyber warfare such as terrorist use of the Internet, the Cyber Jihad, data mining tools and techniques of terrorist detection on the web, analysis and detection of terror financing, and automated identification of terrorist web sites in multiple languages. The contributors include leading researchers on international terrorism, as well as distinguished experts in information security and cyber intelligence. This book represents a valuable source of information for academic researchers, law enforcement and intelligence experts, and industry consultants who are involved in detection, analysis, and prevention of terrorist activities on the Internet.

This compendium is a completely revised version of an earlier book, Data Mining in Time Series Databases, by the same editors. It provides a unique collection of new articles written by leading experts that account for the latest developments in the field of time series and data stream mining.The emerging topics covered by the book include weightless neural modeling for mining data streams, using ensemble classifiers for imbalanced and evolving data streams, document stream mining with active learning, and many more. In particular, it addresses the domain of streaming data, which has recently become one of the emerging topics in Data Science, Big Data, and related areas. Existing titles do not provide sufficient information on this topic.