"BisoNet" Generation Using Textual Data
Description
According to Koestler, the notion of a bisociation denotes
a connection between pieces of information from habitually separated
domains or categories. In this paper, we consider a methodology to find
such bisociations using a network representation of knowledge, which is
called a BisoNet, because it promises to contain bisociations. In a first
step, we consider how to create BisoNets from several textual databases
taken from different domains using simple text-mining techniques. To
achieve this, we introduce a procedure to link nodes of a BisoNet and
to endow such links with weights, which is based on a new measure for
comparing text frequency vectors. In a second step, we try to rediscover
known bisociations, which were originally found by a human domain
expert, namely indirect relations between migraine and magnesium as
they are hidden in medical research articles published before 1987. We
observe that these bisociations are easily rediscovered by simply following the strongest links. Future work includes extending our methods to
non-textual data, improving the similarity measure, and applying more
sophisticated graph mining methods.
| Slides | |
| 0:00 | “BisoNet” Generation using textual data |
| 0:41 | Content |
| 1:20 | Definition of a Bisociation |
| 2:07 | BisoNet definition |
| 3:07 | BisoNet generation requires |
| 3:49 | Our choices |
| 4:50 | Actual structure of the Bisonet |
| 5:37 | Nodes selection |
| 6:53 | A link is created |
| 7:48 | Specificity of the Bison measure |
| 9:30 | The Swanson benchmark |
| 10:19 | Benchmarks, results and futher work (1) |
| 12:01 | Benchmarks, results and futher work (2) |
| 12:31 | Benchmarks, results and futher work (3) |
| 13:32 | Benchmarks, results and further works (4) |
| 14:53 | Benchmarks, results and further work (6) |
| 16:09 | First results |
| 17:06 | Conclusion |
| 18:25 | - Questions |
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 !


