Name
Abstract | ||
|---|---|---|
In order to construct story databases, it is crucial to have an effective index that represents the plot and event sequences in a document. For this purpose, we have already proposed a method using the concept of maximal analogy to represent a generalized event sequence of documents with a maximal set of events. However, it is expensive to calculate a maximal analogy from documents with a large number of sentences. Therefore, in this paper, we propose an efficient algorithm to generate a maximal analogy, based on graph theory, and we confirm its effectiveness experimentally. We also discuss how to use a maximal analogy as an index for a story database, and outline our future plans. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-32279-5_17 | Intuitive Human Interfaces for Organizing and Accessing Intellectual Assets |
Keywords | Field | DocType |
future plan,generalized event sequence,story databases,story database,maximal analogy,large number,graph theory,effective index,efficient algorithm,event sequence,indexation | Graph theory,Maximal set,Link generation,Event sequence,Analogy,Plot (narrative),Database,Mathematics | Conference |
Volume | ISSN | ISBN |
3359 | 0302-9743 | 3-540-24465-4 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Masaharu Yoshioka | 1 | 368 | 41.40 |
| Makoto Haraguchi | 2 | 173 | 32.53 |
| Akihito Mizoe | 3 | 0 | 0.34 |