Skip to main content

A Cooperative Unsupervised Connectionist Model to Identify the Optimal Conditions of a Pneumatic Drill

  • Conference paper
Soft Computing as Transdisciplinary Science and Technology

Part of the book series: Advances in Soft Computing ((AINSC,volume 29))

  • 625 Accesses

Abstract

A novel connectionist method to feature selection is proposed in this paper to identify the optimal conditions to perform drilling tasks. The aim is to extract information from complex high dimensional data sets. The model used is based on a family of cost functions which maximizes the likelihood of identifying a specific distribution in a data set. It employs lateral connections derived from the Rectified Gaussian Distribution to enforce a more sparse representation in each weight vector. The data investigated is obtained from the sensors allocated in a robot used to drill and build industrial warehouses. It is hoped that in classifying this data related with the strength, the water volume for refrigerating, speed and time of each sample, it will help in the search of the best conditions to perform the drilling of reinforce concrete slabs. This would produce a great saving for the company which owns the drilling robot.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Fyfe C. (1996). “A Neural Network for PCA and Beyond”, Neural Processing Letters, 6:33–41.

    Article  Google Scholar 

  2. Corchado E., MacDonald D., Fyfe C. (May 2004). “Maximun and Minimun Likelihood Hebbian Learning for Exploratory Projection Pursuit”, Data Mining and Knowledge Discovery, Vol. 8, No. 3, pp. 203–225. Kluwer Academic Publishing.

    Article  MathSciNet  Google Scholar 

  3. Corchado E., Fyfe C. (April 2003) “Orientation Selection Using Maximum Likelihood Hebbian Learning”, International Journal of Knowledge-Based Intelligent Engineering Systems, Vol. 7, No.2, ISSN: 1327-2314. Brighton, United Kingdom.

    Google Scholar 

  4. Corchado E., Han Y., Fyfe C. (2003), “Structuring Global Responses of Local Filters Using Lateral Connections”. J. Exp. Theor. Artif. Intell. 15(4): 473–487.

    Article  MATH  Google Scholar 

  5. Seung H.S., Socci N.D., Lee. (1998) “The Rectified Gaussian Distribution”, Advances in Neural Information Processing Systems, 10.350.

    Google Scholar 

  6. Oja E. (1989) “Neural Networks, Principal Components and Subspaces”, International Journal of Neural Systems, 1:61–68.

    Article  MathSciNet  Google Scholar 

  7. Charles D. (1999). “Unsupervised Artificial Neural Networks for the Identification of Multiple Causes in Data”. PhD thesis, Uni. Paisley.

    Google Scholar 

  8. Corchado E., Corchado J.M., Sáiz L., Lara A. (Sep. 2004). “Constructing a Global and Integral Model of Business Management Using a CBR System”, First International Conference on Cooperative Design, Visualization and Engineering 2004. Spain. Pp: 141–147.

    Google Scholar 

  9. Corchado E., Herrero A., Baruque B., Sáiz J.M. (2005) “Intrusion Detection System Based on a Cooperative Topology Preserving Method”. International Conference on Adaptive and Natural Computing Algorithms 2005. Coimbra. Portugal. (Accepted).

    Google Scholar 

  10. Pearson K. (1901). “On Lines and Planes of Closest Fit to Systems of Points in Space”, Philosophical Magazine, 2:559–572.

    Google Scholar 

  11. Hotellind H. (1933). “Analysis of a Complex of Statistical Variables into Principal Components”, Journal of Education Psychology, 24:417–444.

    Article  Google Scholar 

  12. Spearman C. (1904). “General Intelligence, Objectively Determined and Measured”, American Journal of Psychology.

    Google Scholar 

  13. Hyvärinen, A. (2001). “Complexity Pursuit: Separating interesting components from time series”. Neural Computation, 13: 883–898.

    Article  MATH  Google Scholar 

  14. Freedman J., Tukey J. (1974). “A Projection Pursuit Algorithm for Exploratory Data Analysis”. IEEE Transaction on Computers, (23):881–890.

    Article  Google Scholar 

  15. Diaconis P., Freedman D. (1984). “Asymptotics of Graphical Projections”. The Annals of Statistics. 12(3): 793–815.

    MATH  MathSciNet  Google Scholar 

  16. Bertsekas D. P. (May 1995). “Nonlinear Programming”. Athena Scientific, Belmont.

    Google Scholar 

  17. Lorenzo M., Bravo P., Preciado M. (2004) “Parametrización del Corte en Hormigón Fuertemente Armado Mediante Coronas de Diamante”. IX Congreso Nacional de Propiedades Mecánicas de Sólidos, Spain.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Corchado, E., Curiel, L., Bravo, P. (2005). A Cooperative Unsupervised Connectionist Model to Identify the Optimal Conditions of a Pneumatic Drill. In: Abraham, A., Dote, Y., Furuhashi, T., Köppen, M., Ohuchi, A., Ohsawa, Y. (eds) Soft Computing as Transdisciplinary Science and Technology. Advances in Soft Computing, vol 29. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32391-0_77

Download citation

  • DOI: https://doi.org/10.1007/3-540-32391-0_77

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25055-5

  • Online ISBN: 978-3-540-32391-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics