Graph based natural language processing and information retrieval:
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge [u.a.]
Cambridge Univ. Press
2011
|
| Ausgabe: | 1. publ. |
| Schlagwörter: | |
| Links: | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024512762&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| Umfang: | VIII, 192 S. graph. Darst. |
| ISBN: | 9780521896139 0521896134 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV039663443 | ||
| 003 | DE-604 | ||
| 005 | 20131211 | ||
| 007 | t| | ||
| 008 | 111027s2011 xx d||| |||| 00||| eng d | ||
| 020 | |a 9780521896139 |c (hbk.) £40.00 |9 978-0-521-89613-9 | ||
| 020 | |a 0521896134 |c (hbk.) £40.00 |9 0-521-89613-4 | ||
| 035 | |a (OCoLC)671573419 | ||
| 035 | |a (DE-599)HBZHT016733627 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-83 |a DE-19 |a DE-20 |a DE-92 |a DE-91G | ||
| 082 | 0 | |a 005.4/37 |2 22 | |
| 084 | |a ST 270 |0 (DE-625)143638: |2 rvk | ||
| 084 | |a ST 306 |0 (DE-625)143654: |2 rvk | ||
| 084 | |a DAT 825f |2 stub | ||
| 084 | |a DAT 710f |2 stub | ||
| 084 | |a MAT 059f |2 stub | ||
| 100 | 1 | |a Mihalcea, Rada F. |d 1974- |e Verfasser |0 (DE-588)101335429X |4 aut | |
| 245 | 1 | 0 | |a Graph based natural language processing and information retrieval |c Rada Mihalcea ; Dragomir Radev |
| 246 | 1 | |a Graph-based natural language processing and information retrieval | |
| 250 | |a 1. publ. | ||
| 264 | 1 | |a Cambridge [u.a.] |b Cambridge Univ. Press |c 2011 | |
| 300 | |a VIII, 192 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 0 | 7 | |a Information Retrieval |0 (DE-588)4072803-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Computerlinguistik |0 (DE-588)4035843-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 653 | |a Natural language processing (Computer science) | ||
| 653 | |a Information retrieval. | ||
| 689 | 0 | 0 | |a Information Retrieval |0 (DE-588)4072803-1 |D s |
| 689 | 0 | 1 | |a Computerlinguistik |0 (DE-588)4035843-4 |D s |
| 689 | 0 | 2 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 0 | 3 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Radev, Dragomir R. |d 1968- |e Verfasser |0 (DE-588)101335530X |4 aut | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024512762&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-024512762 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0048 DAT 710f 2014 A 398 |
|---|---|
| DE-BY-TUM_katkey | 1971056 |
| DE-BY-TUM_location | LSB |
| DE-BY-TUM_media_number | 040080394192 |
| _version_ | 1821934459912454146 |
| adam_text | Titel: Graph based natural language processing and information retrieval
Autor: Mihalcea, Rada F.
Jahr: 2011
Contents
Introduction pagel
0.1 Background 3
0.2 Book Organization 4
0.3 Acknowledgments 7
Part I. Introduction to Graph Theory
1 Notations, Properties, and Representations 11
1.1 Graph Terminology and Notations 11
1.2 Graph Properties 13
1.3 Graph Types 14
1.4 Representing Graphs as Matrices 15
1.5 Using Matrices to Compute Graph Properties 16
1.6 Representing Graphs as Linked Lists 17
1.7 Eigenvalues and Eigenvectors 18
2 Graph-Based Algorithms 20
2.1 Depth-First Graph Traversal 20
2.2 Breadth-First Graph Traversal 22
2.3 Minimum Spanning Trees 23
2.4 Shortest-Path Algorithms 26
2.5 Cuts and Flows 29
2.6 Graph Matching 31
2.7 Dimensionality Reduction 32
2.8 Stochastic Processes on Graphs 34
2.9 Harmonic Functions 38
2.10 Random Walks 40
2.11 Spreading Activation 41
2.12 Electrical Interpretation of Random Walks 42
2.13 Power Method 44
vi Contents
2.14 Linear Algebra Methods for Computing Harmonic
Functions 45
2.15 Method of Relaxations 46
2.16 Monte Carlo Methods 47
53
53
54
54
57
58
61
62
62
63
65
67
67
68
69
70
72
74
76
76
78
78
80
81
85
Part III. Graph-Based Information Retrieval
5 Link Analysis for the World Wide Web 91
5.1 The Web as a Graph 91
5.2 PageRank 92
5.3 Undirected Graphs 95
5.4 Weighted Graphs 95
Part II. Networks
3 Random Networks
3.1 Networks and Graphs
3.2 Random Graphs
3.3 Degree Distributions
3.4 Power Laws
3.5 Zipf s Law
3.6 Preferential Attachment
3.7 Giant Component
3.8 Clustering Coefficient
3.9 Small Worlds
3.10 Assortativity
3.11 Centrality
3.12 Degree Centrality
3.13 Closeness Centrality
3.14 Betweenness Centrality
3.15 Network Example
3.16 Dynamic Processes: Percolation
3.17 Strong and Weak Ties
3.18 Assortative Mixing
3.19 Structural Holes
4 Language Networks
4.1 Co-Occurrence Networks
4.2 Syntactic Dependency Networks
4.3 Semantic Networks
4.4 Similarity Networks
Contents vii
5.5 Combining PageRank with Content Analysis 97
5.6 Topic-Sensitive Link Analysis 97
5.7 Query-Dependent Link Analysis 100
5.8 Hyperlinked-Induced Topic Search 101
5.9 Document Reranking with Induced Links 103
6 Text Clustering 106
6.1 Graph-Based Clustering 108
6.2 Spectral Methods 111
6.3 The Fiedler Method 113
6.4 The Kernighan-Lin Method 114
6.5 Betweenness-Based Clustering 115
6.6 Min-Cut Clustering 117
6.7 Text Clustering Using Random Walks 119
Part IV. Graph-Based Natural Language Processing
7 Semantics 123
7.1 Semantic Classes 123
7.2 Synonym Detection 125
7.3 Semantic Distance 126
7.4 Textual Entailment 129
7.5 Word-Sense Disambiguation 131.
7.6 Name Disambiguation 134
7.7 Sentiment and Subjectivity 135
8 Syntax 140
8.1 Part-of-Speech Tagging 140
8.2 Dependency Parsing 141
8.3 Prepositional-Phrase Attachment 144
8.4 Co-Reference Resolution 146
9 Applications 149
9.1 Summarization 149
9.2 Semi-supervised Passage Retrieval 150
9.3 Keyword Extraction 154
9.4 Topic Identification 156
9.5 Topic Segmentation 161
9.6 Discourse 162
9.7 Machine Translation 165
vüi Contents
9.8 Cross-Language Information Retrieval 166
9.9 Information Extraction 169
9.10 Question Answering 171
9.11 Term Weighting 174
Bibliography 179
Index 191
|
| any_adam_object | 1 |
| author | Mihalcea, Rada F. 1974- Radev, Dragomir R. 1968- |
| author_GND | (DE-588)101335429X (DE-588)101335530X |
| author_facet | Mihalcea, Rada F. 1974- Radev, Dragomir R. 1968- |
| author_role | aut aut |
| author_sort | Mihalcea, Rada F. 1974- |
| author_variant | r f m rf rfm d r r dr drr |
| building | Verbundindex |
| bvnumber | BV039663443 |
| classification_rvk | ST 270 ST 306 |
| classification_tum | DAT 825f DAT 710f MAT 059f |
| ctrlnum | (OCoLC)671573419 (DE-599)HBZHT016733627 |
| dewey-full | 005.4/37 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.4/37 |
| dewey-search | 005.4/37 |
| dewey-sort | 15.4 237 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| edition | 1. publ. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02156nam a2200517 c 4500</leader><controlfield tag="001">BV039663443</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20131211 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">111027s2011 xx d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521896139</subfield><subfield code="c">(hbk.) £40.00</subfield><subfield code="9">978-0-521-89613-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521896134</subfield><subfield code="c">(hbk.) £40.00</subfield><subfield code="9">0-521-89613-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)671573419</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)HBZHT016733627</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.4/37</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 270</subfield><subfield code="0">(DE-625)143638:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 306</subfield><subfield code="0">(DE-625)143654:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 825f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 710f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 059f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Mihalcea, Rada F.</subfield><subfield code="d">1974-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)101335429X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graph based natural language processing and information retrieval</subfield><subfield code="c">Rada Mihalcea ; Dragomir Radev</subfield></datafield><datafield tag="246" ind1="1" ind2=" "><subfield code="a">Graph-based natural language processing and information retrieval</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. publ.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge [u.a.]</subfield><subfield code="b">Cambridge Univ. Press</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VIII, 192 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="650" ind1="0" ind2="7"><subfield code="a">Information Retrieval</subfield><subfield code="0">(DE-588)4072803-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Computerlinguistik</subfield><subfield code="0">(DE-588)4035843-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Natural language processing (Computer science)</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Information retrieval.</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Information Retrieval</subfield><subfield code="0">(DE-588)4072803-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Computerlinguistik</subfield><subfield code="0">(DE-588)4035843-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Radev, Dragomir R.</subfield><subfield code="d">1968-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)101335530X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ 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=024512762&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024512762</subfield></datafield></record></collection> |
| id | DE-604.BV039663443 |
| illustrated | Illustrated |
| indexdate | 2024-12-20T15:59:41Z |
| institution | BVB |
| isbn | 9780521896139 0521896134 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024512762 |
| oclc_num | 671573419 |
| open_access_boolean | |
| owner | DE-83 DE-19 DE-BY-UBM DE-20 DE-92 DE-91G DE-BY-TUM |
| owner_facet | DE-83 DE-19 DE-BY-UBM DE-20 DE-92 DE-91G DE-BY-TUM |
| physical | VIII, 192 S. graph. Darst. |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | Cambridge Univ. Press |
| record_format | marc |
| spellingShingle | Mihalcea, Rada F. 1974- Radev, Dragomir R. 1968- Graph based natural language processing and information retrieval Information Retrieval (DE-588)4072803-1 gnd Computerlinguistik (DE-588)4035843-4 gnd Graphentheorie (DE-588)4113782-6 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4072803-1 (DE-588)4035843-4 (DE-588)4113782-6 (DE-588)4001183-5 |
| title | Graph based natural language processing and information retrieval |
| title_alt | Graph-based natural language processing and information retrieval |
| title_auth | Graph based natural language processing and information retrieval |
| title_exact_search | Graph based natural language processing and information retrieval |
| title_full | Graph based natural language processing and information retrieval Rada Mihalcea ; Dragomir Radev |
| title_fullStr | Graph based natural language processing and information retrieval Rada Mihalcea ; Dragomir Radev |
| title_full_unstemmed | Graph based natural language processing and information retrieval Rada Mihalcea ; Dragomir Radev |
| title_short | Graph based natural language processing and information retrieval |
| title_sort | graph based natural language processing and information retrieval |
| topic | Information Retrieval (DE-588)4072803-1 gnd Computerlinguistik (DE-588)4035843-4 gnd Graphentheorie (DE-588)4113782-6 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Information Retrieval Computerlinguistik Graphentheorie Algorithmus |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024512762&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT mihalcearadaf graphbasednaturallanguageprocessingandinformationretrieval AT radevdragomirr graphbasednaturallanguageprocessingandinformationretrieval |
Inhaltsverzeichnis
Paper/Kapitel scannen lassen
Paper/Kapitel scannen lassen
Handapparate (nicht verfügbar)
| Signatur: |
0048 DAT 710f 2014 A 398
Lageplan |
|---|---|
| Exemplar 1 | Dauerhaft ausgeliehen Ausgeliehen – Rückgabe bis: 31.12.9999 |