CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Article:A Survey on Mining services for Better Enhancement in Small HandHeld Devices

by Ganesh Raj Kushwaha, Niresh Sharma
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 6 - Number 1
Year of Publication: 2010
Authors: Ganesh Raj Kushwaha, Niresh Sharma
10.5120/1044-1351

Ganesh Raj Kushwaha, Niresh Sharma . Article:A Survey on Mining services for Better Enhancement in Small HandHeld Devices. International Journal of Computer Applications. 6, 1 ( September 2010), 40-43. DOI=10.5120/1044-1351

@article{ 10.5120/1044-1351,
author = { Ganesh Raj Kushwaha, Niresh Sharma },
title = { Article:A Survey on Mining services for Better Enhancement in Small HandHeld Devices },
journal = { International Journal of Computer Applications },
issue_date = { September 2010 },
volume = { 6 },
number = { 1 },
month = { September },
year = { 2010 },
issn = { 0975-8887 },
pages = { 40-43 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume6/number1/1044-1351/ },
doi = { 10.5120/1044-1351 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:54:18.381912+05:30
%A Ganesh Raj Kushwaha
%A Niresh Sharma
%T Article:A Survey on Mining services for Better Enhancement in Small HandHeld Devices
%J International Journal of Computer Applications
%@ 0975-8887
%V 6
%N 1
%P 40-43
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper presents a case study on data mining services able to support decision makers in strategic planning for the enhancement of small handheld devices. The application provides e-Knowledge services for the analysis of territorial dynamics by processing and modeling huge amount of data, in order to discover rules and patterns in a distributed and heterogeneous content environment. For the analysis of structured data, the application covers the whole Knowledge Discovery process. The purpose of the paper is to show how to implement existing techniques in a flexible architecture for providing new added value services. Finally in our paper, a case study of different data mining task is thrive under different category like in WWW, Mobile environment, PDA Devices, Web log techniques etc. We also use MIDP (Mobile Information device Profile) and CLDC (Connected Limited Device Configuration) of J2ME.

References
  1. “Java  2 Platform Micro Edition (J2ME) Technologies for Creating Mobile Devices”, White Paper, Sun Microsystems, Inc., 2000,
  2. “Java 2 Platform, Micro Edition Datasheet”, Sun Microsystems, Inc., 2002,
  3. Dan Lim, “Ubiquitous mobile Computing: UMC’s model and success”, Educational Technology & society 2(4) 1999 ISSN 1436-4522.
  4. C. Y Chang, M.S Chen, “Integrating web caching and Web prefetching in client-side proxies”, in: Proceedings of the ACM 11th International conference Information and Knowledge Management, 2002.
  5. J. L. Chen, “Resource allocation for cellular data services using multivalent schemes”, IEEE Trans. Syst. Man Cybern. 31 (6) (2001) 864-869.
  6. Jiawei Han and Micheline Kamber, Data Mining Concepts and techniques, www.mkp.com or www.books.elsevier.com.
  7. R. Agrawal and R. Srikant, “Mining sequential Patterns,” 11th International Conference on Data Engineering, Taipei, Taiwan, Mar. 1995.
  8. Vincent S. Tseng, Kawuu W. Lin, “Efficient Mining and prediction of user behavior patterns in mobile web systems”, Information and software technology, 2005.
  9. M. Bichler and K.-J. Lin. Service-oriented computing. IEEE Computer, 39(3):99–101, March 2006
  10. J. S. Ide and F. G. Cozman. Generating random bayesian networks. Proceedings on 16th Brazilian Symposium on Artificial Intelligence (SBIA 2002) , Advances in Artificial Intelligence,Springer-Verlag, Berlin, pages 366 – 375, November 2002.
  11. D. S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256– 278, 1974.
  12. K. B. Korb and A. E. Nicholson. Bayesian Artificial Intelligence.Chapman & Hall/CRC, London, UK, 2004.
  13. K.-J. Lin, J. Y. Hsu, Y. Zhang, and T. Yu. A distributed reputation broker framework for web service applications. Journal of E-Commerce Research, 7(3), 2006.
  14. M. P. Papazoglou, P. Traverso, S. Dustdar, and F. Leymann.Service-oriented computing: State of the art and Research challenges. IEEE Computer, 40:38–45, November 2007.
  15. David A. Levine.The shadow cluster concept for resource allocation and call admission in ATM-based wireless networks
  16. J].Mobile Computing and Networking, pages 142–150, 1995.
  17. Amiya Bhattacharya: An information-theoretic approach to track mobile users in PCS networks
  18. J]. ACM/Kluwer Wireless Networks, 8(2-3):121–135, March–May 2002.
  19. John G. Cleary and W. J. Teahan. Unbounded length contexts for PPM
  20. J]. The Computer Journal, 40(2/3), 1997.
  21. Christine Cheng, Ravi Jain. Location prediction algorithms for mobile wireless systems
  22. M]. In . Illyas and B. Furht, editors, Handbook of Wireless Internet. CRC Press, 2003.
  23. Libo Song, David Kotz, Ravi Jain, and Xiaoning He, Evaluating location predictors with extensive Wi-Fi mobility data
  24. A], in Proc. of INFOCOM
  25. C], March 2004, pp. 1414 – 1424.
  26. U. Varshney, R. J. Vetter, and R. Kalakota, “Mobile Commerce: A New Frontier”, IEEE Computer, Vol. 33, No. 10, pp. 32-38, October 2000.
  27. J. Veijalainene, “Transaction in Mobile Electronic Commerce”, in Proceedings of the International Workshop on Foundations of Models and Languages for Data and Objects, Dagstuhl Castle,Germany, pp. 203-227, September 1999.
  28. J. B. Schafer, J. Konstan, and J. Riedl, “Recommender systems in Ecommerce”,in Proceedings of ACM Conference on Electronic Commerce, Denver, Co, pp. 158-166, November 1999.
  29. C. H. Yun and M. S. Chen, “Mining Mobile Sequential Patterns in a Mobile Commerce Environment”, IEEE Transaction on Systems, Man, and Cybernetics, Part C, Vol. 37, No. 2, pp. 278-295, March 2007.
  30. R. Agrawal, T. Imielinski and A. Swami, “Mining Association Rules between Sets of Items in Large Databases”, Proceedings of ACM SIGMOD International Conference on the Management of Data, 1993, pp. 207-216.
  31. Gokhan Yavas, Dimitrios Katsaros, Ozgur Ulssoy, and Yannis Manolopoulos, “A Data Mining Approach for Location Prediction in Mobile Web Environments”, IEEE Transaction on Data and Knowledge Engineering, 2005.
  32. R. Agrawal and J. Shafer, “Parallel Mining of Association Rules”, IEEE Transaction on Knowledge and Data Engineering, 1996, pp. 962-969.
  33. R. Agrawal, T. Imielinski and A. Swami, “Mining Association Rules between Sets of Items in Large Databases”, Proceedings of ACM SIGMOD International Conference on the Management of Data, 1993, pp. 207-216.
  34. Gokhan Yavas, Dimitrios Katsaros, Ozgur Ulssoy, and Yannis Manolopoulos, “A Data Mining Approach for Location Prediction in Mobile Web Environments”, IEEE Transaction on Data and Knowledge Engineering, Sce. 2005, pp.121-146.
  35. Assaf Schuster, Ran Wolff, and Dan Trock, “A High- Performance Distributed Algorithm for Mining Association Rules”, Knowledge and Information Systems (KAIS) Journal,
  36. Luo, Anil L. Pereira, and Soon M. Chung, “Distributed Mining of Maximal Frequent Item sets on a Data Grid System”, The Journal of Super Computing, 2006, pp.71-90.
  37. Mario Cannataro, Antonio Congiusta, Andrea Pugliese, Talia, and Paolo Trunfio, ”Distributed Data Mining on Grids: Services, Tools and Applications”, IEEE Transaction on Systems Man and Cybernetics, Dec. 2004, pp.2451-2465.
  38. Ian Foster, “Globus Toolkit Version 4: Software for Service-Oriented System”, Journal of Computer Science and Technology, Jul. 2006, pp. 513-520.
  39. Cristian Aflori and Mitica Craus, “Grid Implementation of Apriori Algorithm”, Advances in Engineering Software, pp. 295-300.
  40. C. Tang, Su. Chunhua and Sa. Kouichi. A Distributed Privacy-Preserving Association Rules Mining Scheme Using Frequent-Pattern Tree,In ADMA,2008.
  41. W. Jing, L. Huang, Y. Luo, W. Xu and Y. Yao. An Algorithm for Privacy-Preserving Quantitative Association Rules Mining. In Proceedings of the 2nd IEEE International Symposium on Dependable, Autonomic and Secure Computing, 2006.
  42. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDB, 1994.
  43. H.M. Wang, Y.J. Wang, M. Xian, “Data Collection Technique of Computer Network Attack Effect Evaluation Based on Mobile Agent”, Computer Engineering, vol. 33, 2007, pp. 160-162.
  44. “A 4+1 bit month-scale regularity mining algorithm With one-path and distributed server constraints for mobile internet,” in NBiS 2008, vol. LNCS 5186. Springer Verlag, September 2008, pp. 232–241.
  45. Toshihiko Yamasaki, A Space-optimal Month-scale Regularity Mining Method with One-path and Distributed Server Constraints for Mobile Internet, 2009.
Index Terms

Computer Science
Information Sciences

Keywords

J2ME DMS CLDC MIDP

Powered by PhDFocusTM