Unsupervised Link Discovery in Multi-relational Data via Rarity Analysis (2003)
Cached
Download Links
- [www.csie.ntu.edu.tw]
- [www.isi.edu]
- [www.isi.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IEEE International Conference on Data Mining |
| Citations: | 24 - 1 self |
BibTeX
@INPROCEEDINGS{Lin03unsupervisedlink,
author = {Shou-de Lin},
title = {Unsupervised Link Discovery in Multi-relational Data via Rarity Analysis},
booktitle = {IEEE International Conference on Data Mining},
year = {2003},
pages = {171--178}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A significant portion of knowledge discovery and data mining research focuses on finding patterns of interest in data. Once a pattern is found, it can be used to recognize satisfying instances. The new area of link discovery requires a complementary approach, since patterns of interest might not yet be known or might have too few examples to be learnable. This paper presents an unsupervised link discovery method aimed at discovering unusual, interestingly linked entities in multi-relational datasets. Various notions of rarity are introduced to measure the "interestingness " of sets of paths and entities. These measurements have been implemented and applied to a real-world bibliographic dataset where they give very promising results. 1.
