Skip to main content
Have a personal or library account? Click to login
An algorithm for reducing the dimension and size of a sample for data exploration procedures Cover

An algorithm for reducing the dimension and size of a sample for data exploration procedures

International Journal of Applied Mathematics and Computer Science
Volume 24 (2014): Issue 1 (March 2014)
By:  and    
Open Access
|Mar 2014
References

References

  1. Aarts, E., Korst, J. and van Laarhoven, P. (1997). Simulated annealing,E. Aarts and J. Lenstra (Eds.),, Wiley, Chichester, pp. 91-120.
    Search in Google Scholar
  2. Alba, E. (2005)., Wiley, New York, NY.
    Open DOISearch in Google Scholar
  3. Aswani Kumar, C. and Srinivas, S. (2006). Latent semantic indexing using eigenvalue analysis for efficient information retrieval,(4): 551-558.
    Search in Google Scholar
  4. Aswani Kumar, C. (2009). Analysis of unsupervised dimensionality techniques,(2): 217-227.
    Open DOISearch in Google Scholar
  5. Azencot, R. (1992)., Wiley, New York, NY.
    Search in Google Scholar
  6. Bartenhagen, C., Klein, H.-U., Ruckert, C., Jiang, X. and Dugas, M. (2010). Comparative study of unsupervised dimension reduction techniques for the visualization of microarray gene expression data,, paper no. 567.
    Search in Google Scholar
  7. Bartkuté, V. and Sakalauskas, L. (2009). Statistical inferences for termination of Markov type random search algorithms,(3): 475-493.
    Open DOISearch in Google Scholar
  8. Ben-Ameur, W. (2004). Computing the initial temperature of simulated annealing,(3): 367-383.
    Open DOISearch in Google Scholar
  9. Borg, I. and Groenen, P. (2005)., Springer-Verlag, Berlin.
    Search in Google Scholar
  10. Camastra, F. (2003). Data dimensionality estimation methods: A survey,(12): 2945-2954.
    Open DOISearch in Google Scholar
  11. Charytanowicz, M., Niewczas, J., Kulczycki, P., Kowalski, P., Łukasik, S. and ˙Zak, S. (2010). Complete gradient clustering algorithm for features analysis of x-ray images,E. Pia˛tka and J. Kawa (Eds.),, Vol. 2, Springer-Verlag, Berlin, pp. 15-24.
    Open DOISearch in Google Scholar
  12. Cortez, P., Cerdeira, A., Almeida, F., Matos, T. and Reis, J. (2009). Modeling wine preferences by data mining from physicochemical properties,(4): 547-553.
    Open DOISearch in Google Scholar
  13. Cox, T. and Cox, M. (2000)., Chapman and Hall, Boca Raton, FL.
    Open DOISearch in Google Scholar
  14. Cunningham, P. (2007). Dimension reduction,, UCD School of Computer Science and Informatics, Dublin.
    Search in Google Scholar
  15. Czarnowski, I. and J˛edrzejowicz, P. (2011). Application of agent-based simulated annealing and tabu search procedures to solving the data reduction problem,(1): 57-68, DOI: 10.2478/v10006-011-0004-3.
    Open DOISearch in Google Scholar
  16. David, H. and Nagaraja, H. (2003).,Wiley, New York, NY.
    Open DOISearch in Google Scholar
  17. Deng, Z., Chung, F.-L. and Wang, S. (2008). FRSDE: Fast reduced set density estimator using minimal enclosing ball approximation,(4): 1363-1372.
    Open DOISearch in Google Scholar
  18. François, D., Wertz, V. and Verleysen, M. (2007). The concentration of fractional distances,(7): 873-886.
    Open DOISearch in Google Scholar
  19. Geman, S. and Geman, D. (1984). Stochastic relaxation, Gibbs distribution and the Bayesian restoration in images,: 721-741.
    Open DOISearch in Google Scholar
  20. Gendreau, M. and Potvin, J.-Y. (2010)., Springer, New York, NY.
    Open DOISearch in Google Scholar
  21. Han, J. and Kamber, M. (2006)., Morgan Kaufmann, San Francisco, CA.
    Search in Google Scholar
  22. Ingber, L. (1996). Adaptive simulated annealing (ASA): Lessons learned,(1): 33-54.
    Search in Google Scholar
  23. Inza, I., Larranaga, P., Etxeberria, R. and Sierra, B. (2000). Feature subset selection by Bayesian network-based optimization,(1-2): 157-184.
    Open DOISearch in Google Scholar
  24. Ishibuchi, H., Nakashima, T. and Murata, T. (2001). Three-objective genetics-based machine learning for linguistic rule extraction,(1-4): 109-133.
    Open DOISearch in Google Scholar
  25. Kerdprasop, K., Kerdprasop, N. and Sattayatham, P. (2005). Weighted k-means for density-biased clustering,A. Tjoa and J. Trujillo (Eds.),Lecture Notes in Computer Science, Vol. 3589, Springer-Verlag, Berlin pp. 488-497.
    Open DOISearch in Google Scholar
  26. Kulczycki, P. (2005)., WNT, Warsaw, (in Polish). Kulczycki, P. (2008). Kernel estimators in industrial applications,B. Prasad (Ed.),, Springer-Verlag, Berlin, pp. 69-91.
    Open DOISearch in Google Scholar
  27. Kulczycki, P. and Charytanowicz, M. (2010). A complete gradient clustering algorithm formed with kernel estimators,(1): 123-134, DOI: 10.2478/v10006-010-0009-3.
    Open DOISearch in Google Scholar
  28. Kulczycki, P. and Kowalski, P. (2011). Bayes classification of imprecise information of interval type,(1): 101-123.
    Search in Google Scholar
  29. Kulczycki, P. and Łukasik, S. (2014). Reduction of dimension and size of data set by parallel fast simulated annealing,L.T. Koczy, C.R. Pozna, R. Claudiu and J. Kacprzyk (Eds.),, Springer-Verlag, Berlin, pp. 273-292.
    Open DOISearch in Google Scholar
  30. Kuo, Y. (2010). Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem,(1): 157-165.
    Open DOISearch in Google Scholar
  31. Łukasik, S. and Kulczycki, P. (2011). An algorithm for sample and data dimensionality reduction using fast simulated annealing,J. Tang, I. King, L. Chen and J. Wang (Eds.),, Lecture Notes in Computer Science, Vol. 7120, Springer-Verlag, Berlin, pp. 152-161.
    Open DOISearch in Google Scholar
  32. Łukasik, S. and Kulczycki, P. (2013). Using topology preservation measures for multidimensional intelligent data analysis in the reduced feature space,L. Rutkowski, M. Korytkowski, R. Scherer, R. Tadeusiewicz, L. Zadeh and J. Zurada (Eds.),Lecture Notes in Computer Science, Vol. 7895, Springer-Verlag, Berlin, pp. 184-193.
    Open DOISearch in Google Scholar
  33. Maaten, van der, L. (2009)., Ph.D. thesis, Tilburg University, Tilburg.
    Search in Google Scholar
  34. Mangasarian, O. and Wolberg, W. (1990). Cancer diagnosis via linear programming,(5): 1-18.
    Search in Google Scholar
  35. Mitra, P., Murthy, C. and Pal, S. (2002). Density-based multiscale data condensation,(6): 734-747.
    Open DOISearch in Google Scholar
  36. Nam, D., Lee, J.-S. and Park, C. (2004).-dimensional Cauchy neighbor generation for the fast simulated annealing,(11): 2499-2502.
    Search in Google Scholar
  37. Oliveira, J. and Pedrycz, W. (Eds.) (2007)., Wiley, Chichester.
    Search in Google Scholar
  38. Pal, S. and Mitra, P. (2004)., Chapman and Hall, Boca Raton, FL.
    Open DOISearch in Google Scholar
  39. Parvin, H., Alizadeh, H. and Minati, B. (1971). Objective criteria for the evaluation of clustering methods,(336): 846-850.
    Open DOISearch in Google Scholar
  40. Parvin, H., Alizadeh, H. and Minati, B. (2010). A modification on-nearest neighbor classifier,(14): 37-41.
    Search in Google Scholar
  41. Sait, S. and Youssef, H. (2000)., IEEE Computer Society Press, Los Alamitos, CA.
    Search in Google Scholar
  42. Sammon, J. (1969). A nonlinear mapping for data structure analysis,(5): 401-409.
    Open DOISearch in Google Scholar
  43. Saxena, A., Pal, N. and Vora, M. (2010). Evolutionary methods for unsupervised feature selection using Sammon’s stress function,(3): 229-247.
    Open DOISearch in Google Scholar
  44. Strickert, M., Teichmann, S., Sreenivasulu, N. and Seiffert, U. (2005). DIPPP online self-improving linear map for distance-preserving data analysis,, pp. 661-668.
    Search in Google Scholar
  45. Sumi, S.M., Zaman, M.F. and Hirose, H. (2012). A rainfall forecasting method using machine learning models and its application to the Fukuoka city case,(4): 841-854, DOI: 10.2478/v10006-012-0062-1.
    Open DOISearch in Google Scholar
  46. Szu, H. and Hartley, R. (1987). Fast simulated annealing,(3-4): 157-162.
    Open DOISearch in Google Scholar
  47. Tian, T., Wilcox, R. and James, G. (2010). Data reduction in classification: A simulated annealing based projection method,(5): 319-331.
    Open DOISearch in Google Scholar
  48. UC Irvine Machine Learning Repository (2013). http://archive.ics.uci.edu/ml/.
    Search in Google Scholar
  49. Vanstrum, M. and Starks, S. (1981). An algorithm for optimal linear maps,, pp. 106-110.
    Search in Google Scholar
  50. Wand, M. and Jones, M. (1995)., Chapman and Hall, London.
    Open DOISearch in Google Scholar
  51. Wilson, D. and Martinez, T. (2000). Reduction techniques for instance-based learning algorithms,(3): 257-286.
    Open DOISearch in Google Scholar
  52. Xu, R. and Wunsch, D. (2009).,Wiley, Hoboken, NJ.
    Open DOISearch in Google Scholar
  53. Zhigljavsky, A. and Žilinskas, A. (2008)., Springer-Verlag, Berlin.
    Search in Google Scholar
DOI: https://doi.org/10.2478/amcs-2014-0011 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Journal RSS Feed
Language: English
Page range: 133 - 149
Published on: Mar 25, 2014
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
dimension reduction,
sample size reduction,
linear transformation,
simulated annealing,
data mining.
Related subjects:
Mathematics,
Applied mathematics

© 2014 Piotr Kulczycki, Szymon Lukasik, published by University of Zielona Góra
This work is licensed under the Creative Commons License.

Volume 24 (2014): Issue 1 (March 2014)
Previous article
Next article