We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Future Trend Prediction of Indian IT Stock Market using Association Rule Mining of Transaction data

by Rajesh V. Argiddi, S. S. Apte
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 39 - Number 10
Year of Publication: 2012
Authors: Rajesh V. Argiddi, S. S. Apte
10.5120/4858-7132

Rajesh V. Argiddi, S. S. Apte . Future Trend Prediction of Indian IT Stock Market using Association Rule Mining of Transaction data. International Journal of Computer Applications. 39, 10 ( February 2012), 30-34. DOI=10.5120/4858-7132

@article{ 10.5120/4858-7132,
author = { Rajesh V. Argiddi, S. S. Apte },
title = { Future Trend Prediction of Indian IT Stock Market using Association Rule Mining of Transaction data },
journal = { International Journal of Computer Applications },
issue_date = { February 2012 },
volume = { 39 },
number = { 10 },
month = { February },
year = { 2012 },
issn = { 0975-8887 },
pages = { 30-34 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume39/number10/4858-7132/ },
doi = { 10.5120/4858-7132 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:26:06.250288+05:30
%A Rajesh V. Argiddi
%A S. S. Apte
%T Future Trend Prediction of Indian IT Stock Market using Association Rule Mining of Transaction data
%J International Journal of Computer Applications
%@ 0975-8887
%V 39
%N 10
%P 30-34
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The approach stated in this paper mainly focuses on minimizing the length of the transaction table of the stock market, based on some common features among the attributes which indirectly minimize the complexity involved in processing; we call this approach as Fragment Based Mining. This deals mainly with reducing the time and space complexity involved in processing the data. Experimentally we try to show our approach is promising one. We conclude that this approach can potentially be used for predictions and recommendations stock trading platforms.

References
  1. Osmar R.Zaiane, “Principles of Knowledge Discovery in Databases”, 1999.
  2. Dattatray P.Gandhmal, Ranjeetsingh Parihar,and Rajesh Argiddi “An Optimized approach to analyze stock market using data mining technique”, IJCA, ICETT 2011.
  3. H. Lu, J. Han, and L. Feng (2000). "Beyond intratransaction association analysis: mining multidimensional intertransaction association rules." ACM Transactions on Information Systems 18(4): 423-454.
  4. Wanzhong Yang, “Granule Based Knowledge Representation for Intra and Inter Transaction Association Mining”, Queensland University of Technology, July 2009.
  5. J. Dong and M. Han (2007). IFCIA: An Efficient Algorithm for Mining Intertransaction Frequent Closed Item sets. The fourth international conference on fuzzy systems and knowledge discovery, China.
  6. Gebouw D, B-3590 Diepenbeek, Belgium “Building an Association Rules Framework to Improve Product Assortment Decisions” 2004.
  7. Eugene F. Fama “The Behavior of Stock Market Prices”, The Journal of Business, Jan 1965.
  8. R. S. Monteiro, G. Zimbrão, H. Schwarz, B. Mitschang, and J. M. Souza (2005). "Building the Data Warehouse of Frequent Itemsets in the DWFIST Approach." Foundations of Intelligent Systems 3488: 294-303.
  9. K. M. Ahmed, N. M. El-Makky, and Y. Taha (1998). Effective data mining: a data warehouse-backboned architecture. The 1998 conference of the Centre for Advanced Studies on Collaborative research, Toronto.
  10. Professor Lee “Apriori Algorithm Review for Finals” Spring 2007.
  11. Ole Kristian Fivelstad “Temporal Text Mining” Norwegian University of Science and Technology, June 2007.
  12. M. Chen, C. Huang, H. Wu, M. Hsu, F. Hsu (2005). A Data Mining Technique to Grouping Customer Orders in Warehouse Management System. The Fourth IEEE International Workshop on Soft Computing as Tran disciplinary Science and Technology.
Index Terms

Computer Science
Information Sciences

Keywords

Apriori FITI Fragment Based Mining Stock Data

Powered by PhDFocusTM