2012 IIAI International Conference on Advanced Applied Informatics 2012
DOI: 10.1109/iiai-aai.2012.71
|View full text |Cite
|
Sign up to set email alerts
|

Extracting Topic Changes through Word Co-occurrence Graphs from Japanese Subtitles of VOD Lecture

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…The co-occurrence word-graph method treats words in each micro-b10gging as initial nodes, linking nearby co occurrence words with high levels of co-occurrence with edges [13].In this paper, word x and word ya re linked when C(x, y) is greater than or equal to j3 that is the lower limit of co-occurrence. Each connected sub graphs of the co-occurr ence word-graph is a topic.…”
Section: ) Co-occurrence Word-graphmentioning
confidence: 99%
“…The co-occurrence word-graph method treats words in each micro-b10gging as initial nodes, linking nearby co occurrence words with high levels of co-occurrence with edges [13].In this paper, word x and word ya re linked when C(x, y) is greater than or equal to j3 that is the lower limit of co-occurrence. Each connected sub graphs of the co-occurr ence word-graph is a topic.…”
Section: ) Co-occurrence Word-graphmentioning
confidence: 99%