Clustering and ranking for web information retrieval: methodologies for searching the web
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Saarbrücken
VDM Verl., Müller
2008
|
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | Teilw. zugl.: Pisa, Univ., Diss., 2006 |
Beschreibung: | 137 S. graph. Darst. |
ISBN: | 9783836456579 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV023267860 | ||
003 | DE-604 | ||
005 | 20080604 | ||
007 | t | ||
008 | 080421s2008 d||| m||| 00||| eng d | ||
020 | |a 9783836456579 |9 978-3-8364-5657-9 | ||
035 | |a (OCoLC)271282008 | ||
035 | |a (DE-599)BVBBV023267860 | ||
040 | |a DE-604 |b ger |e rakwb | ||
041 | 0 | |a eng | |
049 | |a DE-19 | ||
050 | 0 | |a ZA4230 | |
100 | 1 | |a Gullì, Antonio |d 1971- |e Verfasser |0 (DE-588)135634164 |4 aut | |
245 | 1 | 0 | |a Clustering and ranking for web information retrieval |b methodologies for searching the web |c Antonio Gullî |
264 | 1 | |a Saarbrücken |b VDM Verl., Müller |c 2008 | |
300 | |a 137 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
500 | |a Teilw. zugl.: Pisa, Univ., Diss., 2006 | ||
650 | 7 | |a Information Retrieval |2 swd | |
650 | 7 | |a World Wide Web |2 swd | |
650 | 4 | |a Mathematisches Modell | |
650 | 4 | |a Document clustering | |
650 | 4 | |a Information retrieval |x Mathematical models | |
650 | 4 | |a Internet searching |x Mathematical models | |
650 | 4 | |a Web sites |x Ratings and rankings |x Mathematical models | |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016452930&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
999 | |a oai:aleph.bib-bvb.de:BVB01-016452930 |
Datensatz im Suchindex
_version_ | 1804137579958763520 |
---|---|
adam_text | CONTENTS INTRODUCTION 9 AN OVERVIEW OF WEB INFORMATION RETRIEVAL 15 1.1
AN OVERVIEW OF TRADITIONAL IR 15 1.2 MODERN WEBLR IT 1.3 SIZE OF THE WEB
1!) 1.3.1 ESTIMATING SIZES AND OVERLAPS OF SEARCH ENGINES 1!) 1.3.2
ESTIMATING THE INDEXABLE WEB 21 AN OVERVIEW OF WEB SNIPPET CLUSTERING 23
2.1 BASIC DEFINITION AND NOTATION 24 2.1.1 SIMILARITY AND DISSIMILARITY
24 2.1.2 PARTITION APPROACHES 24 2.1.3 GEOMETRIC APPROACHES 26 2.1.4
SYNTACTICAL CLUSTERING 27 2.1.5 PROBABILISTIC APPROACHES AND OTHER
METHODS 28 2.1.6 CLUSTERING REQUIREMENTS AND LIMITATIONS 28 2.2 WEB
SNIPPET CLUSTERING 29 2.2.1 THE COMMERCIAL SCENARIO 2!) 2.2.2 THE
SCIENTIFIC SCENARIO 30 2.2.3 A DEEP OVERVIEW OF THE MOST IMPORTANT
CLUSTERING ALGORITHMS 32 AN OVERVIEW OF WEB RANKING 41 3.1 BASIC
DEFINITION AND NOTATION 41 3.2 THE MATHEMATIC BEHIND TRADITIONAL WEB
RANKING 42 3.2.1 PAGERANK 44 3.2.2 HITS 45 3.2.3 SALSA 47 3.3
PERSONALIZED WEB RANKING 48 3.4 EXTENSIONS TO THE TRADITIONAL WEB
METRICS 50 3.5 ACCELERATING THE COMPUTATION OF PAGERANK 50 3.6 RANKING
ALGORITHMS BASED ON QUERY LEARNING 55 SNAKET: SNIPPET AGGREGATION FOR
KNOWLEDGE EXTRACTION 57 4.1 OUR CONTRIBUTION 58 4.2 THE ANATOMY OF
SNAKET. THE CLUSTERING ENGINE 60 4.2.1 TWO KNOWLEDGE BASES 61 4.2.2 THE
FIRST MODULE: THE SNIPPET ANALYZER 64 4.2. BIBLIOGRAFISCHE INFORMATIONEN
HTTP://D-NB.INFO/987753223 DIGITALISIERT DURCH BIBLIOGRAPHY 125 4.4
EXPERIMENTAL RESULTS 76 4.4.1 USERS SURVEYS 77 4.4.2 SNAKET S DATASET
AND ANECDOTAL EVIDENCE 77 4.4.3 EVALUATION OF SNAKET 78 4.5 CONCLUSIONS
81 5 RANKING A STREAM OF NEWS 85 5.1 OUR CONTRIBUTION 87 5.2 STIME
DESIDERATA 88 5.3 A MODEL FOR NEWS ARTICLES 89 5.4 ALGORITHMS FOR NEWS
ARTICLES AND NEWS SOURCES 90 5.4.1 TIME-UNAWARE RANKING ALGORITHMS 91
5.4.2 TIME-AWARE RANKING ALGORITHMS 92 5.5 THE FINAL TIME-AWARE
ALGORITLMI: TA3 94 5.5.1 USING A CLUSTERING TECHNIQUE 94 5.5.2 RANKING
THE EVENTS 95 5.0 THE ANATOMY OF COMETOMYHEAD. THE NEWS SEARCH ENGINE 95
5.7 EXPERIMENTAL RESULTS 98 5.7.1 EVALUATION OF THE RANKING ALGORITHMS
98 5.8 CONCLUSIONS 103 6 A METHODOLOGY FOR FAST PAGERANK COMPUTATION 105
6.1 OUR CONTRIBUTION 105 6.2 A SPARSE LINEAR SYSTEM FORMULATION 107
6.2.1 THE CONDITIONING OF THE PROBLEM IN THE NEW FORMULATION 109 6.3
EXPLOITING THE WEB MATRIX PERMUTATIONS 110 6.4 EXPERIMENTAL RESULTS 114
6.4.1 EVALUATING THE RANKING ALGORITHMS 115 6.5 CONCLUSIONS 117 7
CONCLUSIONS AND FUTURE WORKS 121 7.1 DISCUSSION ABOUT CLUSTERING AND
RANKING 121 7.2 A SYNTHESIS OF OUR CONTRIBUTIONS 122 7.3 FUTURE LINES OF
RESEARCH 123
|
adam_txt |
CONTENTS INTRODUCTION 9 AN OVERVIEW OF WEB INFORMATION RETRIEVAL 15 1.1
AN OVERVIEW OF TRADITIONAL IR 15 1.2 MODERN WEBLR IT 1.3 SIZE OF THE WEB
1!) 1.3.1 ESTIMATING SIZES AND OVERLAPS OF SEARCH ENGINES 1!) 1.3.2
ESTIMATING THE INDEXABLE WEB 21 AN OVERVIEW OF WEB SNIPPET CLUSTERING 23
2.1 BASIC DEFINITION AND NOTATION 24 2.1.1 SIMILARITY AND DISSIMILARITY
24 2.1.2 PARTITION APPROACHES 24 2.1.3 GEOMETRIC APPROACHES 26 2.1.4
SYNTACTICAL CLUSTERING 27 2.1.5 PROBABILISTIC APPROACHES AND OTHER
METHODS 28 2.1.6 CLUSTERING REQUIREMENTS AND LIMITATIONS 28 2.2 WEB
SNIPPET CLUSTERING 29 2.2.1 THE COMMERCIAL SCENARIO 2!) 2.2.2 THE
SCIENTIFIC SCENARIO 30 2.2.3 A DEEP OVERVIEW OF THE MOST IMPORTANT
CLUSTERING ALGORITHMS 32 AN OVERVIEW OF WEB RANKING 41 3.1 BASIC
DEFINITION AND NOTATION 41 3.2 THE MATHEMATIC BEHIND TRADITIONAL WEB
RANKING 42 3.2.1 PAGERANK 44 3.2.2 HITS 45 3.2.3 SALSA 47 3.3
PERSONALIZED WEB RANKING 48 3.4 EXTENSIONS TO THE TRADITIONAL WEB
METRICS 50 3.5 ACCELERATING THE COMPUTATION OF PAGERANK 50 3.6 RANKING
ALGORITHMS BASED ON QUERY LEARNING 55 SNAKET: SNIPPET AGGREGATION FOR
KNOWLEDGE EXTRACTION 57 4.1 OUR CONTRIBUTION 58 4.2 THE ANATOMY OF
SNAKET. THE CLUSTERING ENGINE 60 4.2.1 TWO KNOWLEDGE BASES 61 4.2.2 THE
FIRST MODULE: THE SNIPPET ANALYZER 64 4.2. BIBLIOGRAFISCHE INFORMATIONEN
HTTP://D-NB.INFO/987753223 DIGITALISIERT DURCH BIBLIOGRAPHY 125 4.4
EXPERIMENTAL RESULTS 76 4.4.1 USERS SURVEYS 77 4.4.2 SNAKET'S DATASET
AND ANECDOTAL EVIDENCE 77 4.4.3 EVALUATION OF SNAKET 78 4.5 CONCLUSIONS
81 5 RANKING A STREAM OF NEWS 85 5.1 OUR CONTRIBUTION 87 5.2 STIME
DESIDERATA 88 5.3 A MODEL FOR NEWS ARTICLES 89 5.4 ALGORITHMS FOR NEWS
ARTICLES AND NEWS SOURCES 90 5.4.1 TIME-UNAWARE RANKING ALGORITHMS 91
5.4.2 TIME-AWARE RANKING ALGORITHMS 92 5.5 THE FINAL TIME-AWARE
ALGORITLMI: TA3 94 5.5.1 USING A CLUSTERING TECHNIQUE 94 5.5.2 RANKING
THE EVENTS 95 5.0 THE ANATOMY OF COMETOMYHEAD. THE NEWS SEARCH ENGINE 95
5.7 EXPERIMENTAL RESULTS 98 5.7.1 EVALUATION OF THE RANKING ALGORITHMS
98 5.8 CONCLUSIONS 103 6 A METHODOLOGY FOR FAST PAGERANK COMPUTATION 105
6.1 OUR CONTRIBUTION 105 6.2 A SPARSE LINEAR SYSTEM FORMULATION 107
6.2.1 THE CONDITIONING OF THE PROBLEM IN THE NEW FORMULATION 109 6.3
EXPLOITING THE WEB MATRIX PERMUTATIONS 110 6.4 EXPERIMENTAL RESULTS 114
6.4.1 EVALUATING THE RANKING ALGORITHMS 115 6.5 CONCLUSIONS 117 7
CONCLUSIONS AND FUTURE WORKS 121 7.1 DISCUSSION ABOUT CLUSTERING AND
RANKING 121 7.2 A SYNTHESIS OF OUR CONTRIBUTIONS 122 7.3 FUTURE LINES OF
RESEARCH 123 |
any_adam_object | 1 |
any_adam_object_boolean | 1 |
author | Gullì, Antonio 1971- |
author_GND | (DE-588)135634164 |
author_facet | Gullì, Antonio 1971- |
author_role | aut |
author_sort | Gullì, Antonio 1971- |
author_variant | a g ag |
building | Verbundindex |
bvnumber | BV023267860 |
callnumber-first | Z - Library Science |
callnumber-label | ZA4230 |
callnumber-raw | ZA4230 |
callnumber-search | ZA4230 |
callnumber-sort | ZA 44230 |
callnumber-subject | ZA - Information Resources |
ctrlnum | (OCoLC)271282008 (DE-599)BVBBV023267860 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01521nam a2200385 c 4500</leader><controlfield tag="001">BV023267860</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20080604 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">080421s2008 d||| m||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783836456579</subfield><subfield code="9">978-3-8364-5657-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)271282008</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV023267860</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-19</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">ZA4230</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gullì, Antonio</subfield><subfield code="d">1971-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)135634164</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Clustering and ranking for web information retrieval</subfield><subfield code="b">methodologies for searching the web</subfield><subfield code="c">Antonio Gullî</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Saarbrücken</subfield><subfield code="b">VDM Verl., Müller</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">137 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Teilw. zugl.: Pisa, Univ., Diss., 2006</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Information Retrieval</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">World Wide Web</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematisches Modell</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Document clustering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information retrieval</subfield><subfield code="x">Mathematical models</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Internet searching</subfield><subfield code="x">Mathematical models</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Web sites</subfield><subfield code="x">Ratings and rankings</subfield><subfield code="x">Mathematical models</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016452930&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016452930</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV023267860 |
illustrated | Illustrated |
index_date | 2024-07-02T20:34:40Z |
indexdate | 2024-07-09T21:14:33Z |
institution | BVB |
isbn | 9783836456579 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016452930 |
oclc_num | 271282008 |
open_access_boolean | |
owner | DE-19 DE-BY-UBM |
owner_facet | DE-19 DE-BY-UBM |
physical | 137 S. graph. Darst. |
publishDate | 2008 |
publishDateSearch | 2008 |
publishDateSort | 2008 |
publisher | VDM Verl., Müller |
record_format | marc |
spelling | Gullì, Antonio 1971- Verfasser (DE-588)135634164 aut Clustering and ranking for web information retrieval methodologies for searching the web Antonio Gullî Saarbrücken VDM Verl., Müller 2008 137 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Teilw. zugl.: Pisa, Univ., Diss., 2006 Information Retrieval swd World Wide Web swd Mathematisches Modell Document clustering Information retrieval Mathematical models Internet searching Mathematical models Web sites Ratings and rankings Mathematical models (DE-588)4113937-9 Hochschulschrift gnd-content DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016452930&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Gullì, Antonio 1971- Clustering and ranking for web information retrieval methodologies for searching the web Information Retrieval swd World Wide Web swd Mathematisches Modell Document clustering Information retrieval Mathematical models Internet searching Mathematical models Web sites Ratings and rankings Mathematical models |
subject_GND | (DE-588)4113937-9 |
title | Clustering and ranking for web information retrieval methodologies for searching the web |
title_auth | Clustering and ranking for web information retrieval methodologies for searching the web |
title_exact_search | Clustering and ranking for web information retrieval methodologies for searching the web |
title_exact_search_txtP | Clustering and ranking for web information retrieval methodologies for searching the web |
title_full | Clustering and ranking for web information retrieval methodologies for searching the web Antonio Gullî |
title_fullStr | Clustering and ranking for web information retrieval methodologies for searching the web Antonio Gullî |
title_full_unstemmed | Clustering and ranking for web information retrieval methodologies for searching the web Antonio Gullî |
title_short | Clustering and ranking for web information retrieval |
title_sort | clustering and ranking for web information retrieval methodologies for searching the web |
title_sub | methodologies for searching the web |
topic | Information Retrieval swd World Wide Web swd Mathematisches Modell Document clustering Information retrieval Mathematical models Internet searching Mathematical models Web sites Ratings and rankings Mathematical models |
topic_facet | Information Retrieval World Wide Web Mathematisches Modell Document clustering Information retrieval Mathematical models Internet searching Mathematical models Web sites Ratings and rankings Mathematical models Hochschulschrift |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016452930&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT gulliantonio clusteringandrankingforwebinformationretrievalmethodologiesforsearchingtheweb |