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

Submit your paper
Know more
Reseach Article

A Survey on Hesitation Information Mining

by Surabhi Pathak, Akhilesh Tiwari
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 141 - Number 9
Year of Publication: 2016
Authors: Surabhi Pathak, Akhilesh Tiwari
10.5120/ijca2016909791

Surabhi Pathak, Akhilesh Tiwari . A Survey on Hesitation Information Mining. International Journal of Computer Applications. 141, 9 ( May 2016), 14-21. DOI=10.5120/ijca2016909791

@article{ 10.5120/ijca2016909791,
author = { Surabhi Pathak, Akhilesh Tiwari },
title = { A Survey on Hesitation Information Mining },
journal = { International Journal of Computer Applications },
issue_date = { May 2016 },
volume = { 141 },
number = { 9 },
month = { May },
year = { 2016 },
issn = { 0975-8887 },
pages = { 14-21 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume141/number9/24812-2016909791/ },
doi = { 10.5120/ijca2016909791 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:43:03.638911+05:30
%A Surabhi Pathak
%A Akhilesh Tiwari
%T A Survey on Hesitation Information Mining
%J International Journal of Computer Applications
%@ 0975-8887
%V 141
%N 9
%P 14-21
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The tremendous advancement in technology has given rise to an increasing requirement for the storage of data in files, databases and other data repositories. As a result, decision-makers are required to use new and powerful automated tools for the purpose of the analysis and interpretation of the stored data, as well as for the extraction of interesting patterns in data. Since the stored data is not always exact and precise, some means are required to handle this aspect of data and extract the useful information (e.g. hesitation information) arising from such uncertainties. For this purpose vague set theory has been applied for efficiently modeling the uncertainties that occur in datasets. Vague sets are an extension of the classical set theory. They extend the application of set theory to vague and uncertain problems. Vague set theory has emerged as a new tool to deal with the uncertainties of the data and the parameters attached to the data. This theory exhibits a very promising approach to analyzing uncertain data and deriving some interesting results suitable for use in various applications. This paper discusses the notions of vague sets and vague association rules. Also, optimization techniques have been introduced that would be helpful in optimizing the outcomes. When both are implemented together, a new approach will be created which is expected to generate much improved results. This paper emphasizes on the study of vague sets for a series of applications especially in decision making problems.

References
  1. U. M. Fayyad, G. P. Shapiro and P. Smyth, “From Data Mining to Knowledge Discovery in Databases,” 0738-4602-1996, AI Magazine (Fall 1996). pp: 37–53.
  2. J. Han and M. Kamber, Data Mining: Concepts and Techniques, 2nd edition. The Morgan Kaufmann Series in Data Management Systems, Jim Gray, Series Editor 2006.
  3. R. Agrawal, R. Srikant, “Fast algorithms for mining association rules”. In: Proceedings of the 20th International Conference on Very Large Databases, Santiago, Chile, 1994.
  4. An Lu and Wilfred Ng, “Mining Hesitation Information by Vague Association Rules”. 2007© Springer.
  5. A. Lu, W. Ng, “Managing merged data by vague functional dependencies,” ER. (2004) 259–272.
  6. A. Lu, W. Ng, “Vague sets or intuitionistic fuzzy sets for handling vague data: Which one is better,” 2005 Springer.
  7. W. L. Gau, D. J. Buehrer, “Vague sets”, (1993) IEEE Transactions on Systems, Man, and Cybernetics. Vol. 23 (2), 610–614.
  8. An Lu, Yiping Ke, James Cheng, and Wilfred Ng, “Mining Vague Association Rules,” Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Hong Kong, China.
  9. T. Bernecker, H. Kriegel, M. Renz, F. Verhein, and A. Zuefle, “Probabilistic Frequent Itemset Mining in Uncertain Databases,” Proc. 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2009.
  10. L. Zadeh, “Fuzzy Sets”, © 1965 Elsevier Inc.
  11. Z. Pawlak, “Rough sets”, 1982 International Journal Computer Information Science 11 (5) 341–356.
  12. D Molodtsov, “Soft Set Theory – First Results”, © 1999 Elsevier Inc.
  13. Q. Zhang, F. Li, and K. Yi, “Finding Frequent Items in Probabilistic Data,” Proc. ACM SIGMOD International Conference on Management of Data, 2008.
  14. An Lu and Wilfred Ng, “Vague Sets or Intuitionistic Fuzzy Sets for Handling Vague Data- Which One Is Better?” 2005 © Springer.
  15. An Lu, Yiping Ke, James Cheng, and Wilfred Ng, “Mining Vague Association Rules” 2007 © Springer.
  16. An Lu and Wilfred Ng, “Handling inconsistency of vague relations with functional dependencies,” Proceedings of the 26th international conference on Conceptual modeling, Pages 229-244, Springer-Verlag Berlin, Heidelberg ©2007.
  17. A. Pandey and K.R. Pardasani, “A Model for Mining Course Information using Vague Association Rule”, International Journal of Computer Applications (0975 – 8887) Volume 58– No.20, November 2012.
  18. A. Pandey and K.R. Pardasani, “A Model for Vague Association Rule Mining in Temporal Databases,” Journal of Information and Computing Science Vol. 8, No. 1, 2013, pp. 063-074, ISSN 1746-7659, England, UK.
  19. B. Y. Chilakalapudi, N. Satyala and S. Menda, “An Improved Algorithm for Efficient Mining of Frequent Item Sets on Large Uncertain Databases”, International Journal of Computer Applications (0975 – 8887) Volume 73– No.12, July 2013.
  20. P. Bajaj and S. Raheja, “A Vague Improved Markov Model Approach for Web Page Prediction,” International Journal of Computer Science & Engineering Survey (IJCSES) Vol.5, No.2, April 2014.
  21. V. Badhe et al., “Vague Set Theory for Profit Pattern and Decision Making in Uncertain Data”, (IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 6, No. 6, 2015.
  22. H. De. Garis, “Genetic programming: building artificial nervous systems using genetically programmed neural network modules,” Proc. of the 7th international conference on machine learning. 132-139. Morgan Kaufmann 1990.
  23. John J. Grefenstette, “Optimization of control parameters for genetic algorithms,” IEEE Transaction on Systems, Man, Cybernetics, SMC-16(1):122-128, 1986.
  24. C. Zhang, J. Ning and D. Ouyang, “An artificial bee colony approach for clustering,” Expert Systems with Applications, vol. 37, (2010), pp. 4761-4767.
  25. D. Karaboga and C. Ozturk, “A Novel clustering approach: Artificial bee colony (ABC) algorithm,” Applied Soft Computing, vol. 11, (2011), pp. 652-657.
  26. X. Yan, Y. Zhu, W. Zou and L. Wang, “A new approach for data clustering using hybrid artificial bee colony algorithm”, Neural computing, vol. 97, (2012), pp. 241-250.
  27. D. Karaboga, C. Ozturk, N. Karaboga, B. Gorkemli, “Artificial bee colony programming for symbolic regression”. Information Science 209:1–15 (2012).1
  28. X. Li, J. Zhang, and M. Yin, “Animal migration optimization: an optimization algorithm inspired by animal migration behavior,” Neural Computing and Applications, 2013.
  29. J. Kennedy and R. C. Eberhart, “Particle Swarm Optimization,” Proc. IEEE int’l conf. on neural networks, Vol. 4, pp. 1942-1948. IEEE service center, Piscataway, NJ, 1995.
Index Terms

Computer Science
Information Sciences

Keywords

Fuzzy Sets Optimization Techniques Rough Sets Soft Sets Vague Sets