Searching the Web by Discovering and Clustering Related Terms
Description
The amount of information on the web is growing so fast that
it is becoming more and more difficult for classical search engines to
find relevant information. Indeed, due to the frenetic increase of
webpages written in different languages and sometimes in mis-interpreted
languages, the degree of ambiguity of the human language has been
constantly evolving to levels unseen so far. However, people still query
the systems with no more than 2 words on average. As a consequence, new
information retrieval systems need to be proposed to decrease the level
of ambiguity of the queries. Such systems usually make use of query
expansion techniques to solve this problem. In this talk, I will present
a system based on the automatic discovery of terms that are related to
the query as a means of helping the user to search for relevant
information. This technique can be classified within Interactive Query Expansion
systems. However, unlike other systems, we use Web Mining Techniques to
discover related terms based on different features such as association
measures, document similarity, document relevance, etc.
In the second part of my talk, I will present the future extensions of
our retrieval systems based on the automatic discovery of relations
between related terms. So, by using agglomerative clustering techniques
and an auto-fed WebWarehouse, we hope to be able to propose
less ambiguous query expansion terms than in present systems
where the user needs to sort out the terms he is interested in.
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Related content
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !




