A personal information management scheme using shared labels and implication links

Gaurav Dubey, Xiaolong Zhang

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

The tree-based file management scheme is universally deployed as a personal information management approach; however, it has several weaknesses. In this paper, we identify and discuss some of the weaknesses of the tree-based approach: these include conceptual fragmentation, conceptual non-comprehensiveness, entry point restriction, and enforced ordering. After describing some previous attempts at building alternative schemes for PIM, we propose our own scheme, based on shared labels and implication links. Location addresses consist of unordered sets of labels, and each location has connections to other addresses that are subsets and super- sets of the location's address. Implication links can be used to capture implication relationships between concepts: specifying a link from one label to another means that the first label will automatically be accompanied by the second in addresses. We discuss the components of the new scheme, in addition to methods for manipulating it. We describe the ways in which the new scheme addresses the problems identified with the tree-based approach. We also present a mockup of a prototype application for browsing information repositories based on the new scheme. To conclude, we discuss future research directions, including theoretical analysis, implementation, and testing.

Original languageEnglish (US)
JournalProceedings of the ASIST Annual Meeting
Volume49
Issue number1
DOIs
StatePublished - Dec 1 2012

Fingerprint

information management
Information management
Labels
fragmentation
management
Testing

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Library and Information Sciences

Cite this

@article{319a812ba7eb4c46ac9ac19ac6c272b5,
title = "A personal information management scheme using shared labels and implication links",
abstract = "The tree-based file management scheme is universally deployed as a personal information management approach; however, it has several weaknesses. In this paper, we identify and discuss some of the weaknesses of the tree-based approach: these include conceptual fragmentation, conceptual non-comprehensiveness, entry point restriction, and enforced ordering. After describing some previous attempts at building alternative schemes for PIM, we propose our own scheme, based on shared labels and implication links. Location addresses consist of unordered sets of labels, and each location has connections to other addresses that are subsets and super- sets of the location's address. Implication links can be used to capture implication relationships between concepts: specifying a link from one label to another means that the first label will automatically be accompanied by the second in addresses. We discuss the components of the new scheme, in addition to methods for manipulating it. We describe the ways in which the new scheme addresses the problems identified with the tree-based approach. We also present a mockup of a prototype application for browsing information repositories based on the new scheme. To conclude, we discuss future research directions, including theoretical analysis, implementation, and testing.",
author = "Gaurav Dubey and Xiaolong Zhang",
year = "2012",
month = "12",
day = "1",
doi = "10.1002/meet.14504901082",
language = "English (US)",
volume = "49",
journal = "Proceedings of the ASIST Annual Meeting",
issn = "1550-8390",
publisher = "Learned Information",
number = "1",

}

A personal information management scheme using shared labels and implication links. / Dubey, Gaurav; Zhang, Xiaolong.

In: Proceedings of the ASIST Annual Meeting, Vol. 49, No. 1, 01.12.2012.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A personal information management scheme using shared labels and implication links

AU - Dubey, Gaurav

AU - Zhang, Xiaolong

PY - 2012/12/1

Y1 - 2012/12/1

N2 - The tree-based file management scheme is universally deployed as a personal information management approach; however, it has several weaknesses. In this paper, we identify and discuss some of the weaknesses of the tree-based approach: these include conceptual fragmentation, conceptual non-comprehensiveness, entry point restriction, and enforced ordering. After describing some previous attempts at building alternative schemes for PIM, we propose our own scheme, based on shared labels and implication links. Location addresses consist of unordered sets of labels, and each location has connections to other addresses that are subsets and super- sets of the location's address. Implication links can be used to capture implication relationships between concepts: specifying a link from one label to another means that the first label will automatically be accompanied by the second in addresses. We discuss the components of the new scheme, in addition to methods for manipulating it. We describe the ways in which the new scheme addresses the problems identified with the tree-based approach. We also present a mockup of a prototype application for browsing information repositories based on the new scheme. To conclude, we discuss future research directions, including theoretical analysis, implementation, and testing.

AB - The tree-based file management scheme is universally deployed as a personal information management approach; however, it has several weaknesses. In this paper, we identify and discuss some of the weaknesses of the tree-based approach: these include conceptual fragmentation, conceptual non-comprehensiveness, entry point restriction, and enforced ordering. After describing some previous attempts at building alternative schemes for PIM, we propose our own scheme, based on shared labels and implication links. Location addresses consist of unordered sets of labels, and each location has connections to other addresses that are subsets and super- sets of the location's address. Implication links can be used to capture implication relationships between concepts: specifying a link from one label to another means that the first label will automatically be accompanied by the second in addresses. We discuss the components of the new scheme, in addition to methods for manipulating it. We describe the ways in which the new scheme addresses the problems identified with the tree-based approach. We also present a mockup of a prototype application for browsing information repositories based on the new scheme. To conclude, we discuss future research directions, including theoretical analysis, implementation, and testing.

UR - http://www.scopus.com/inward/record.url?scp=84878602206&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84878602206&partnerID=8YFLogxK

U2 - 10.1002/meet.14504901082

DO - 10.1002/meet.14504901082

M3 - Article

VL - 49

JO - Proceedings of the ASIST Annual Meeting

JF - Proceedings of the ASIST Annual Meeting

SN - 1550-8390

IS - 1

ER -