C. Plant, S. T. Mai, Junming Shao, Fabian J Theis, A. Meyer-Bäse, Christian Böhm
Independent component analysis (ICA) is an essential building block for data analysis in many applications. Selecting the truly meaningful components from the result of an ICA algorithm, or comparing the results of different algorithms, however, is nontrivial problems. We introduce a very general technique for evaluating ICA results rooted in information-theoretic model selection. The basic idea is to exploit the natural link between non-Gaussianity and data compression: the better the data transformation represented by one or several ICs improves the effectiveness of data compression, the higher is the relevance of the ICs. We propose two different methods which allow an efficient data compression of non-Gaussian signals: Phi-transformed histograms and fuzzy histograms. In an extensive experimental evaluation, we demonstrate that our novel information-theoretic measures robustly select non-Gaussian components from data in a fully automatic way, that is, without requiring any restrictive assumptions or thresholds.
{"title":"Measuring Non-Gaussianity by Phi-Transformed and Fuzzy Histograms","authors":"C. Plant, S. T. Mai, Junming Shao, Fabian J Theis, A. Meyer-Bäse, Christian Böhm","doi":"10.1155/2012/962105","DOIUrl":"https://doi.org/10.1155/2012/962105","url":null,"abstract":"Independent component analysis (ICA) is an essential building block for data analysis in many applications. Selecting the truly meaningful components from the result of an ICA algorithm, or comparing the results of different algorithms, however, is nontrivial problems. We introduce a very general technique for evaluating ICA results rooted in information-theoretic model selection. The basic idea is to exploit the natural link between non-Gaussianity and data compression: the better the data transformation represented by one or several ICs improves the effectiveness of data compression, the higher is the relevance of the ICs. We propose two different methods which allow an efficient data compression of non-Gaussian signals: Phi-transformed histograms and fuzzy histograms. In an extensive experimental evaluation, we demonstrate that our novel information-theoretic measures robustly select non-Gaussian components from data in a fully automatic way, that is, without requiring any restrictive assumptions or thresholds.","PeriodicalId":7288,"journal":{"name":"Adv. Artif. Neural Syst.","volume":"25 1","pages":"962105:1-962105:13"},"PeriodicalIF":0.0,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75531776","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Ortiz, J. Górriz, J. Ramírez, D. Salas-González
The primary goal of brain image segmentation is to partition a given brain image into different regions representing anatomical structures. Magnetic resonance image (MRI) segmentation is especially interesting, since accurate segmentation in white matter, grey matter and cerebrospinal fluid provides a way to identify many brain disorders such as dementia, schizophrenia or Alzheimer's disease (AD). Then, image segmentation results in a very interesting tool for neuroanatomical analyses. In this paper we show three alternatives to MR brain image segmentation algorithms, with the Self-Organizing Map (SOM) as the core of the algorithms. The procedures devised do not use any a priori knowledge about voxel class assignment, and results in fully-unsupervised methods for MRI segmentation, making it possible to automatically discover different tissue classes. Our algorithm has been tested using the images from the Internet Brain Image Repository (IBSR) outperforming existing methods, providing values for the average overlap metric of 0.7 for the white and grey matter and 0.45 for the cerebrospinal fluid. Furthermore, it also provides good results for high-resolution MR images provided by the NuclearMedicine Service of the "Virgen de las Nieves" Hospital (Granada, Spain).
脑图像分割的主要目的是将给定的脑图像分割成代表解剖结构的不同区域。磁共振图像(MRI)分割特别有趣，因为对白质、灰质和脑脊液的准确分割为识别许多脑部疾病(如痴呆、精神分裂症或阿尔茨海默病(AD))提供了一种方法。然后，图像分割产生了一个非常有趣的神经解剖分析工具。本文以自组织映射(SOM)算法为核心，提出了三种磁共振脑图像分割算法的替代方案。设计的程序不使用任何关于体素类分配的先验知识，并产生完全无监督的MRI分割方法，使自动发现不同的组织类成为可能。我们的算法已经使用来自互联网脑图像库(IBSR)的图像进行了测试，其性能优于现有方法，白质和灰质的平均重叠度量值为0.7，脑脊液的平均重叠度量值为0.45。此外，它还为“Virgen de las Nieves”医院(西班牙格拉纳达)核医学服务处提供的高分辨率MR图像提供了良好的结果。
{"title":"Unsupervised Neural Techniques Applied to MR Brain Image Segmentation","authors":"A. Ortiz, J. Górriz, J. Ramírez, D. Salas-González","doi":"10.1155/2012/457590","DOIUrl":"https://doi.org/10.1155/2012/457590","url":null,"abstract":"The primary goal of brain image segmentation is to partition a given brain image into different regions representing anatomical structures. Magnetic resonance image (MRI) segmentation is especially interesting, since accurate segmentation in white matter, grey matter and cerebrospinal fluid provides a way to identify many brain disorders such as dementia, schizophrenia or Alzheimer's disease (AD). Then, image segmentation results in a very interesting tool for neuroanatomical analyses. In this paper we show three alternatives to MR brain image segmentation algorithms, with the Self-Organizing Map (SOM) as the core of the algorithms. The procedures devised do not use any a priori knowledge about voxel class assignment, and results in fully-unsupervised methods for MRI segmentation, making it possible to automatically discover different tissue classes. Our algorithm has been tested using the images from the Internet Brain Image Repository (IBSR) outperforming existing methods, providing values for the average overlap metric of 0.7 for the white and grey matter and 0.45 for the cerebrospinal fluid. Furthermore, it also provides good results for high-resolution MR images provided by the NuclearMedicine Service of the \"Virgen de las Nieves\" Hospital (Granada, Spain).","PeriodicalId":7288,"journal":{"name":"Adv. Artif. Neural Syst.","volume":"69 1","pages":"457590:1-457590:7"},"PeriodicalIF":0.0,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91192554","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The kidneys are very vital organs. Failing kidneys lose their ability to filter out waste products, resulting in kidney disease. To extend or save the lives of patients with impaired kidney function, kidney replacement is typically utilized, such as hemodialysis. This work uses an entropy function to identify key features related to hemodialysis. By identifying these key features, one can determine whether a patient requires hemodialysis. This work uses these key features as dimensions in cluster analysis. The key features can effectively determine whether a patient requires hemodialysis. The proposed data mining scheme finds association rules of each cluster. Hidden rules for causing any kidney disease can therefore be identified. The contributions and key points of this paper are as follows. (1) This paper finds some key features that can be used to predict the patient who may has high probability to perform hemodialysis. (2) The proposed scheme applies k-means clustering algorithm with the key features to category the patients. (3) A data mining technique is used to find the association rules from each cluster. (4) The mined rules can be used to determine whether a patient requires hemodialysis.
{"title":"Hemodialysis Key Features Mining and Patients Clustering Technologies","authors":"T. Lu, Chun-Ya Tseng","doi":"10.1155/2012/835903","DOIUrl":"https://doi.org/10.1155/2012/835903","url":null,"abstract":"The kidneys are very vital organs. Failing kidneys lose their ability to filter out waste products, resulting in kidney disease. To extend or save the lives of patients with impaired kidney function, kidney replacement is typically utilized, such as hemodialysis. This work uses an entropy function to identify key features related to hemodialysis. By identifying these key features, one can determine whether a patient requires hemodialysis. This work uses these key features as dimensions in cluster analysis. The key features can effectively determine whether a patient requires hemodialysis. The proposed data mining scheme finds association rules of each cluster. Hidden rules for causing any kidney disease can therefore be identified. The contributions and key points of this paper are as follows. (1) This paper finds some key features that can be used to predict the patient who may has high probability to perform hemodialysis. (2) The proposed scheme applies k-means clustering algorithm with the key features to category the patients. (3) A data mining technique is used to find the association rules from each cluster. (4) The mined rules can be used to determine whether a patient requires hemodialysis.","PeriodicalId":7288,"journal":{"name":"Adv. Artif. Neural Syst.","volume":"102 1","pages":"835903:1-835903:11"},"PeriodicalIF":0.0,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83014773","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Many living systems, from cells to brains to governments, are controlled by the activity of a small subset of their constituents. It has been argued that coherence is of evolutionary advantage and that this active subset of constituents results from competition between two processes, a Next process that brings about coherence over time, and a Now process that brings about coherence between the interior and the exterior of the system at a particular time. This competition has been termed competitive coherence and has been implemented in a toy-learning program in order to clarify the concept and to generate--and ultimately test-- new hypotheses covering subjects as diverse as complexity, emergence, DNA replication, global mutations, dreaming, bioputing (computing using either the parts of biological system or the entire biological system), and equilibrium and nonequilibrium structures. Here, we show that a program using competitive coherence, Coco, can learn to respond to a simple input sequence 1, 2, 3, 2, 3, with responses to inputs that differ according to the position of the input in the sequence and hence require competition between both Next and Now processes.
{"title":"Modelling Biological Systems with Competitive Coherence","authors":"V. Norris, M. Engel, M. Demarty","doi":"10.1155/2012/703878","DOIUrl":"https://doi.org/10.1155/2012/703878","url":null,"abstract":"Many living systems, from cells to brains to governments, are controlled by the activity of a small subset of their constituents. It has been argued that coherence is of evolutionary advantage and that this active subset of constituents results from competition between two processes, a Next process that brings about coherence over time, and a Now process that brings about coherence between the interior and the exterior of the system at a particular time. This competition has been termed competitive coherence and has been implemented in a toy-learning program in order to clarify the concept and to generate--and ultimately test-- new hypotheses covering subjects as diverse as complexity, emergence, DNA replication, global mutations, dreaming, bioputing (computing using either the parts of biological system or the entire biological system), and equilibrium and nonequilibrium structures. Here, we show that a program using competitive coherence, Coco, can learn to respond to a simple input sequence 1, 2, 3, 2, 3, with responses to inputs that differ according to the position of the input in the sequence and hence require competition between both Next and Now processes.","PeriodicalId":7288,"journal":{"name":"Adv. Artif. Neural Syst.","volume":"32 1","pages":"703878:1-703878:20"},"PeriodicalIF":0.0,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81762802","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Accident management became a popular research issue in the early 1990s. Computerized decision support was studied from many points of view. Early fault detection and information visualization are important key issues in accident management also today. In this paper we make a brief review on this research history mostly from the last two decades including the severe accident management. The author's studies are reflected to the state of the art. The self-organizing map method is combined with other more or less traditional methods. Neural methods used together with knowledge-based methods constitute a methodological base for the presented decision support prototypes. Two application examples with modern decision support visualizations are introduced more in detail. A case example of detecting a pressure drift on the boiling water reactor by multivariate methods including innovative visualizations is studied in detail. Promising results in early fault detection are achieved. The operators are provided by added information value to be able to detect anomalies in an early stage already. We provide the plant staff with a methodological tool set, which can be combined in various ways depending on the special needs in each case.
{"title":"Combining Neural Methods and Knowledge-Based Methods in Accident Management","authors":"M. Sirola, Jaakko Talonen","doi":"10.1155/2012/534683","DOIUrl":"https://doi.org/10.1155/2012/534683","url":null,"abstract":"Accident management became a popular research issue in the early 1990s. Computerized decision support was studied from many points of view. Early fault detection and information visualization are important key issues in accident management also today. In this paper we make a brief review on this research history mostly from the last two decades including the severe accident management. The author's studies are reflected to the state of the art. The self-organizing map method is combined with other more or less traditional methods. Neural methods used together with knowledge-based methods constitute a methodological base for the presented decision support prototypes. Two application examples with modern decision support visualizations are introduced more in detail. A case example of detecting a pressure drift on the boiling water reactor by multivariate methods including innovative visualizations is studied in detail. Promising results in early fault detection are achieved. The operators are provided by added information value to be able to detect anomalies in an early stage already. We provide the plant staff with a methodological tool set, which can be combined in various ways depending on the special needs in each case.","PeriodicalId":7288,"journal":{"name":"Adv. Artif. Neural Syst.","volume":"49 1","pages":"534683:1-534683:6"},"PeriodicalIF":0.0,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73599008","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Frank Steinbrücker, A. Meyer-Bäse, T. Schlossbauer, D. Cremers
Motion-induced artifacts represent a major problem in detection and diagnosis of breast cancer in dynamic contrast-enhanced magnetic resonance imaging. The goal of this paper is to evaluate the performance of a new nonrigid motion correction algorithm based on the optical flow method. For each of the small lesions, we extracted morphological and dynamical features describing both global and local shape, and kinetics behavior. In this paper, we compare the performance of each extracted feature set under consideration of several 2D or 3D motion compensation parameters for the differential diagnosis of enhancing lesions in breast MRI. Based on several simulation results, we determined the optimal motion compensation parameters. Our results have shown that motion compensation can improve the classification results. The results suggest that the computerized analysis system based on the non-rigid motion compensation technique and spatiotemporal features has the potential to increase the diagnostic accuracy of MRI mammography for small lesions and can be used as a basis for computer-aided diagnosis of breast cancer with MR mammography.
{"title":"Evaluation of a Nonrigid Motion Compensation Technique Based on Spatiotemporal Features for Small Lesion Detection in Breast MRI","authors":"Frank Steinbrücker, A. Meyer-Bäse, T. Schlossbauer, D. Cremers","doi":"10.1155/2012/808602","DOIUrl":"https://doi.org/10.1155/2012/808602","url":null,"abstract":"Motion-induced artifacts represent a major problem in detection and diagnosis of breast cancer in dynamic contrast-enhanced magnetic resonance imaging. The goal of this paper is to evaluate the performance of a new nonrigid motion correction algorithm based on the optical flow method. For each of the small lesions, we extracted morphological and dynamical features describing both global and local shape, and kinetics behavior. In this paper, we compare the performance of each extracted feature set under consideration of several 2D or 3D motion compensation parameters for the differential diagnosis of enhancing lesions in breast MRI. Based on several simulation results, we determined the optimal motion compensation parameters. Our results have shown that motion compensation can improve the classification results. The results suggest that the computerized analysis system based on the non-rigid motion compensation technique and spatiotemporal features has the potential to increase the diagnostic accuracy of MRI mammography for small lesions and can be used as a basis for computer-aided diagnosis of breast cancer with MR mammography.","PeriodicalId":7288,"journal":{"name":"Adv. Artif. Neural Syst.","volume":"120 1","pages":"808602:1-808602:10"},"PeriodicalIF":0.0,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79422989","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Frank Steinbrücker, A. Meyer-Bäse, C. Plant, T. Schlossbauer, U. Meyer-Bäse
Automated detection and diagnosis of small lesions in breast MRI represents a challenge for the traditional computer-aided diagnosis (CAD) systems. The goal of the present research was to compare and determine the optimal feature sets describing the morphology and the enhancement kinetic features for a set of small lesions and to determine their diagnostic performance. For each of the small lesions, we extracted morphological and dynamical features describing both global and local shape, and kinetics behavior. In this paper, we compare the performance of each extracted feature set for the differential diagnosis of enhancing lesions in breast MRI. Based on several simulation results, we determined the optimal feature number and tested different classification techniques. The results suggest that the computerized analysis system based on spatiotemporal features has the potential to increase the diagnostic accuracy of MRI mammography for small lesions and can be used as a basis for computer-aided diagnosis of breast cancer with MR mammography.
{"title":"Selection of Spatiotemporal Features in Breast MRI to Differentiate between Malignant and Benign Small Lesions Using Computer-Aided Diagnosis","authors":"Frank Steinbrücker, A. Meyer-Bäse, C. Plant, T. Schlossbauer, U. Meyer-Bäse","doi":"10.1155/2012/919281","DOIUrl":"https://doi.org/10.1155/2012/919281","url":null,"abstract":"Automated detection and diagnosis of small lesions in breast MRI represents a challenge for the traditional computer-aided diagnosis (CAD) systems. The goal of the present research was to compare and determine the optimal feature sets describing the morphology and the enhancement kinetic features for a set of small lesions and to determine their diagnostic performance. For each of the small lesions, we extracted morphological and dynamical features describing both global and local shape, and kinetics behavior. In this paper, we compare the performance of each extracted feature set for the differential diagnosis of enhancing lesions in breast MRI. Based on several simulation results, we determined the optimal feature number and tested different classification techniques. The results suggest that the computerized analysis system based on spatiotemporal features has the potential to increase the diagnostic accuracy of MRI mammography for small lesions and can be used as a basis for computer-aided diagnosis of breast cancer with MR mammography.","PeriodicalId":7288,"journal":{"name":"Adv. Artif. Neural Syst.","volume":"46 1","pages":"919281:1-919281:8"},"PeriodicalIF":0.0,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88350151","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xu Zhang, Greg Foderaro, C. Henriquez, A. VanDongen, S. Ferrari
This paper presents a deterministic and adaptive spike model derived from radial basis functions and a leaky integrate-and-fire sampler developed for training spiking neural networks without direct weight manipulation. Several algorithms have been proposed for training spiking neural networks through biologically-plausible learning mechanisms, such as spike-timing dependent synaptic plasticity and Hebbian plasticity. These algorithms typically rely on the ability to update the synaptic strengths, or weights, directly, through a weight update rule in which the weight increment can be decided and implemented based on the training equations. However, in several potential applications of adaptive spiking neural networks, including neuroprosthetic devices and CMOS/memristor nanoscale neuromorphic chips, the weights cannot be manipulated directly and, instead, tend to change over time by virtue of the pre- and postsynaptic neural activity. This paper presents an indirect learning method that induces changes in the synaptic weights by modulating spike-timing-dependent plasticity by means of controlled input spike trains. In place of the weights, the algorithmmanipulates the input spike trains used to stimulate the input neurons by determining a sequence of spike timings that minimize a desired objective function and, indirectly, induce the desired synaptic plasticity in the network.
{"title":"A Radial Basis Function Spike Model for Indirect Learning via Integrate-and-Fire Sampling and Reconstruction Techniques","authors":"Xu Zhang, Greg Foderaro, C. Henriquez, A. VanDongen, S. Ferrari","doi":"10.1155/2012/713581","DOIUrl":"https://doi.org/10.1155/2012/713581","url":null,"abstract":"This paper presents a deterministic and adaptive spike model derived from radial basis functions and a leaky integrate-and-fire sampler developed for training spiking neural networks without direct weight manipulation. Several algorithms have been proposed for training spiking neural networks through biologically-plausible learning mechanisms, such as spike-timing dependent synaptic plasticity and Hebbian plasticity. These algorithms typically rely on the ability to update the synaptic strengths, or weights, directly, through a weight update rule in which the weight increment can be decided and implemented based on the training equations. However, in several potential applications of adaptive spiking neural networks, including neuroprosthetic devices and CMOS/memristor nanoscale neuromorphic chips, the weights cannot be manipulated directly and, instead, tend to change over time by virtue of the pre- and postsynaptic neural activity. This paper presents an indirect learning method that induces changes in the synaptic weights by modulating spike-timing-dependent plasticity by means of controlled input spike trains. In place of the weights, the algorithmmanipulates the input spike trains used to stimulate the input neurons by determining a sequence of spike timings that minimize a desired objective function and, indirectly, induce the desired synaptic plasticity in the network.","PeriodicalId":7288,"journal":{"name":"Adv. Artif. Neural Syst.","volume":"22 1","pages":"713581:1-713581:16"},"PeriodicalIF":0.0,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75367330","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
For the Hopfield Neural Network problem we consider unbounded monotone nondecreasing activation functions. We prove convergence to zero in an exponential manner provided that we start with sufficiently small initial data.
{"title":"Hopfield Neural Networks with Unbounded Monotone Activation Functions","authors":"N. Tatar","doi":"10.1155/2012/571358","DOIUrl":"https://doi.org/10.1155/2012/571358","url":null,"abstract":"For the Hopfield Neural Network problem we consider unbounded monotone nondecreasing activation functions. We prove convergence to zero in an exponential manner provided that we start with sufficiently small initial data.","PeriodicalId":7288,"journal":{"name":"Adv. Artif. Neural Syst.","volume":"31 1","pages":"571358:1-571358:5"},"PeriodicalIF":0.0,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86951363","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Artificial neural network (ANN) modeling methods are becoming more widely used as both a research and application paradigm across a much wider variety of business, medical, engineering, and social science disciplines. The combination or triangulation of ANN methods with more traditional methods can facilitate the development of high-quality research models and also improve output performance for real world applications. Prior methodological triangulation that utilizes ANNs is reviewed and a new triangulation of ANNs with structural equation modeling and cluster analysis for predicting an individual's computer self-efficacy (CSE) is shown to empirically analyze the effect of methodological triangulation, at least for this specific information systems research case. A new construct, engagement, is identified as a necessary component of CSE models and the subsequent triangulated ANN models are able to achieve an 84% CSE group prediction accuracy.
{"title":"Methodological Triangulation Using Neural Networks for Business Research","authors":"S. Walczak","doi":"10.1155/2012/517234","DOIUrl":"https://doi.org/10.1155/2012/517234","url":null,"abstract":"Artificial neural network (ANN) modeling methods are becoming more widely used as both a research and application paradigm across a much wider variety of business, medical, engineering, and social science disciplines. The combination or triangulation of ANN methods with more traditional methods can facilitate the development of high-quality research models and also improve output performance for real world applications. Prior methodological triangulation that utilizes ANNs is reviewed and a new triangulation of ANNs with structural equation modeling and cluster analysis for predicting an individual's computer self-efficacy (CSE) is shown to empirically analyze the effect of methodological triangulation, at least for this specific information systems research case. A new construct, engagement, is identified as a necessary component of CSE models and the subsequent triangulated ANN models are able to achieve an 84% CSE group prediction accuracy.","PeriodicalId":7288,"journal":{"name":"Adv. Artif. Neural Syst.","volume":"2 1","pages":"517234:1-517234:12"},"PeriodicalIF":0.0,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79799654","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：