scispace - formally typeset
Search or ask a question
Book

Fundamentals of neural networks

01 Jan 1993-
About: The article was published on 1993-01-01 and is currently open access. It has received 1921 citations till now. The article focuses on the topics: Time delay neural network & Physical neural network.
Citations
More filters
Journal ArticleDOI
TL;DR: In this article, the authors investigate the role of artificial neural networks (ANNs) in hydrology and show that ANNs are gaining popularity, as is evidenced by the increasing number of papers on this topic.
Abstract: In this two-part series, the writers investigate the role of artificial neural networks (ANNs) in hydrology. ANNs are gaining popularity, as is evidenced by the increasing number of papers on this ...

1,334 citations

Journal ArticleDOI
TL;DR: In this article, the authors present the various methodologies and practices that are being employed for the prediction of surface roughness, including machining theory, experimental investigation, designed experiments and artificial intelligence (AI).
Abstract: The general manufacturing problem can be described as the achievement of a predefined product quality with given equipment, cost and time constraints. Unfortunately, for some quality characteristics of a product such as surface roughness it is hard to ensure that these requirements will be met. This paper aims at presenting the various methodologies and practices that are being employed for the prediction of surface roughness. The resulting benefits allow for the manufacturing process to become more productive and competitive and at the same time to reduce any re-processing of the machined workpiece so as to satisfy the technical specifications. Each approach with its advantages and disadvantages is outlined and the present and future trends are discussed. The approaches are classified into those based on machining theory, experimental investigation, designed experiments and artificial intelligence (AI).

903 citations

Proceedings ArticleDOI
08 Dec 2003
TL;DR: This paper proposes two new approaches to using PSO to cluster data, one which basically usesPSO to refine the clusters formed by K-means, and the other which uses PSO in a different way to seed the initial swarm.
Abstract: This paper proposes two new approaches to using PSO to cluster data. It is shown how PSO can be used to find the centroids of a user specified number of clusters. The algorithm is then extended to use K-means clustering to seed the initial swarm. This second algorithm basically uses PSO to refine the clusters formed by K-means. The new PSO algorithms are evaluated on six data sets, and compared to the performance of K-means clustering. Results show that both PSO clustering techniques have much potential.

766 citations

Journal ArticleDOI
TL;DR: In this article, the authors look at how data-driven techniques are playing a big role in deciphering processing-structure-property-performance relationships in materials, with illustrative examples of both forward models (property prediction) and inverse models (materials discovery).
Abstract: Our ability to collect “big data” has greatly surpassed our capability to analyze it, underscoring the emergence of the fourth paradigm of science, which is data-driven discovery. The need for data informatics is also emphasized by the Materials Genome Initiative (MGI), further boosting the emerging field of materials informatics. In this article, we look at how data-driven techniques are playing a big role in deciphering processing-structure-property-performance relationships in materials, with illustrative examples of both forward models (property prediction) and inverse models (materials discovery). Such analytics can significantly reduce time-to-insight and accelerate cost-effective materials discovery, which is the goal of MGI.

705 citations

Journal ArticleDOI
TL;DR: This bibliography provides a classification of a comprehensive list of 1380 references on the theory and application of metaheuristics that have had widespread successes in attacking a variety of difficult combinatorial optimization problems that arise in many practical areas.
Abstract: Metaheuristics are the most exciting development in approximate optimization techniques of the last two decades. They have had widespread successes in attacking a variety of difficult combinatorial optimization problems that arise in many practical areas. This bibliography provides a classification of a comprehensive list of 1380 references on the theory and application of metaheuristics. Metaheuristics include but are not limited to constraint logic programming; greedy random adaptive search procedures; natural evolutionary computation; neural networks; non-monotonic search strategies; space-search methods; simulated annealing; tabu search; threshold algorithms and their hybrids. References are presented in alphabetical order under a number of subheadings.

646 citations