Multi-hop closure theorem in rolodex model using ptrees

Arijit Chatterjee, Arjun G. Roy, Mohammad Hossain, William Perrizo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper1 we mainly introduce the concept of the multi-hop closure theorem in RoloDex model [24] using pTrees. The significance of Association rules is measured via support and confidence and they are used to identify the strength of rules in particular transactions. In this paper we will however try to extrapolate that notion into the concept of using hops as relationships between multiple entities in the RoloDex model. The first section of the paper provides an outline of what association rules are and the notion of the support and confidence to measure the strength of these association rules. The second section provides details on the RoloDex model and the pTree algorithm. The third section of the paper provides details on the multi-hop closure theorem by providing examples of how the theorem holds the closure property as well as providing a section on the proof of the theorem. We finally wrap this paper with a section on limitations and conclusions drawn from this paper.

Original languageEnglish (US)
Title of host publicationProceedings of the 21st International Conference on Software Engineering and Data Engineering, SEDE 2012
Pages179-184
Number of pages6
StatePublished - Dec 1 2012
Externally publishedYes
Event21st International Conference on Software Engineering and Data Engineering, SEDE 2012 - Los Angeles, CA, United States
Duration: Jun 27 2012Jun 29 2012

Publication series

NameProceedings of the 21st International Conference on Software Engineering and Data Engineering, SEDE 2012

Conference

Conference21st International Conference on Software Engineering and Data Engineering, SEDE 2012
Country/TerritoryUnited States
CityLos Angeles, CA
Period6/27/126/29/12

Fingerprint

Dive into the research topics of 'Multi-hop closure theorem in rolodex model using ptrees'. Together they form a unique fingerprint.

Cite this