Intelligent Exploration of the Web

Szczepaniak, Piotr S. (EDT); Segovia, Javier (EDT); Kacprzyk, Janusz (EDT); Zadeh, Lotfi Asker (EDT); Segovia, Javier; Kacprzyk, Janusz; Zadeh, Lotfi Asker

ISBN 10: 3790815292 / ISBN 13: 9783790815290

Edité par Physica, 2002

A propos de cet article

N° de réf. du vendeur 986507-n

Détails bibliographiques

• Titre: Intelligent Exploration of the Web
• Éditeur: Physica
• Date de parution: 2002
• Langue: anglais
• ISBN à 10 chiffres: 3790815292
• ISBN à 13 chiffres: 9783790815290
• Reliure: Couverture rigide
• État de l'article: New

A propos de ce titre

Synopsis

The Web is the nervous system of information society. As such, it has a pervasive influence on our daily lives. And yet, in some ways the Web does not have a high MIQ (Machine IQ). What can be done to enhance it? This is the leitmotif of "Intelligent Exploration of the Web," (lEW)--a collection of articles co-edited by Drs. Szczepaniak, Segovia, Kacprzyk and, to a small degree, myself. The articles that comprise lEW address many basic problems ranging from structure analysis of Internet documents and Web dialogue management to intelligent Web agents for extraction of information, and bootstrapping an ontology-based information extraction system. Among the basic problems, one that stands out in importance is the problem of search. Existing search engines have many remarkable capabilities. But what is not among them is the deduction capability--the capability to answer a query by drawing on information which resides in various parts of the knowledge base. An example of a query might be "How many Ph.D. degrees in computer science were granted by European universities in 1996?" No existing search engine is capable of dealing with queries of comparable or even much lower complexity. Basically, what we would like to do is to add deduction capability to a search engine, with the aim of transforming it into a question-answering system, or a QI A system, for short. This is a problem that is of major importance and a challenge that is hard to meet.