Secular Form to Affiliation Rule Mining Employing P-tree and T-tree

Aparna Agarwal, Deevyankar Agarwal

Abstract


The real commercialisminformation often demonstrates temporal feature and time varying behavior. Temporal affiliation rule has thus got an active area of explore. A calendar part such as months and days, clock parts such as hours and seconds and differentiated units such as business days and academic years, act a major role in a wide range of information system applications. The calendar-based form has already been proposed by explorers to restrict the time-based association ships. This paper advises a novel algorithmic program to determine association rule on time dependent data employingeffective T tree and P-tree data structures. The algorithm complicates the significant advantage in terms of time and memory while comprising time dimension. Our approach path of scanning based on time-intervals yields littlerinformation set for a given valid interval thus cutting down the processing time. This approach is enforced on a synthetic data-set and result shows that temporal TFP tree collapses better performance over a TFP tree access.

Full Text:

PDF

References


R. Agrawal and R. Srikant , R : Fast algorithm for mining association rule. In VLDB’94 Chile , Sept (1994) ,pp –487-499.

Coenen, F.P., Goulbourne, G. and Leng, P.H. (2001). Computing Association Rules Using Partial Totals. In de Raedt, L. and Siebes, A. (Eds), Principles of Data Mining and Knowledge Discovery, Proc PKDD 2001, Spring Verlag LNAI 2168, pp 54-66.

FransCoenen, Paul Leng, and Shakil Ahmed, Data Structure for Association Rule Min-ing T-tree and P- Tree, IEEE transaction on Knowledge Discovery and Data Engineer-ing, Vol 16, No 6 ,(2004).

Chris Giannella_, JiaweiHany, JianPeiz, XifengYany, Philip S. Yu R: Mining Frequent Forms in Data Streams at Multiple TimeGranularities, pg 191 – 210, H. Kargupta, A. Joshi, K. Sivakumar, and Y. Yesha (eds.), Next Generation Data Mining, (2003).

Juan M .Ale , Gustavo H. Rossi R: An approach to discovering temporal association rules, ACM SIGDD March 1..21,(2002).

BanuOzden , Sridhar Ramaswamy , AviSilberschatz R: “Cyclic Association Rule” ,In Proc. Of forteenth International conference on Data Engineering (1998), pp 412-425.

Jian Pei, Jiawei Han, Yiwen Yin and Running Mao R : Mining Frequent Form without Candidate GenerationProc. ACM-SIGMOD Int’l Conf. Management of Data, pp. 1-12, (2000).

John F. Roddick, Kathleen Hornsby, Myra Spiliopoulou: An Updated Bibliography of Temporal, Spatial, and Spatio-temporal Data Mining Explore. TSDM 2000: pp147-164.

Chris P. Rainsford, John F. Roddick R: Adding Temporal semantics to association rule, 3rdInternational conference KSS Springer 1999, pp 504-509.

Xiandong Chen, IiiasPetrounian, Book “Knowledge Discovery and Data Mining” Chap-ter 5 “ A Development Example of Temporal data Mining”, pp 93,2001.

Yingjiu Li, PengNing, X. Sean Wang ,SushilJajodia. Discovering calendar- based temporal association rules, Data and Knowledge Engineering volume 4,Elesvier publisher, Volume 44 pp– 193-214 ,(2003).

FransCoenen, Paul Leng, and Shakil Ahmed , Data Structure for Association Rule Mining : T-tree and P- Tree, IEEE transaction on Knowledge Discovery and Data Engi-neering, Vol 16, No 6 ,(2004).

R. Rymon,.Search Through Systematic Set Enumeration, Proc. Third Int’l Conf. Princi-ples of Knowledge and Reasoning, pp. 539-550, (1992).


Refbacks

  • There are currently no refbacks.




© International Journals of Advanced Research in Computer Science and Software Engineering (IJARCSSE)| All Rights Reserved | Powered by Advance Academic Publisher.