Journal articles on the topic 'Restricted Boltzmann Machine (RBM)'
To see the other types of publications on this topic, follow the link: Restricted Boltzmann Machine (RBM).
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Restricted Boltzmann Machine (RBM).'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
Côté, Marc-Alexandre, and Hugo Larochelle. "An Infinite Restricted Boltzmann Machine." Neural Computation 28, no. 7 (July 2016): 1265–88. http://dx.doi.org/10.1162/neco_a_00848.
Full textAbstract:
We present a mathematical construction for the restricted Boltzmann machine (RBM) that does not require specifying the number of hidden units. In fact, the hidden layer size is adaptive and can grow during training. This is obtained by first extending the RBM to be sensitive to the ordering of its hidden units. Then, with a carefully chosen definition of the energy function, we show that the limit of infinitely many hidden units is well defined. As with RBM, approximate maximum likelihood training can be performed, resulting in an algorithm that naturally and adaptively adds trained hidden units during learning. We empirically study the behavior of this infinite RBM, showing that its performance is competitive to that of the RBM, while not requiring the tuning of a hidden layer size.
2
Li, Yu, Yuan Zhang, and Yue Ji. "Privacy-Preserving Restricted Boltzmann Machine." Computational and Mathematical Methods in Medicine 2014 (2014): 1–7. http://dx.doi.org/10.1155/2014/138498.
Full textAbstract:
With the arrival of the big data era, it is predicted that distributed data mining will lead to an information technology revolution. To motivate different institutes to collaborate with each other, the crucial issue is to eliminate their concerns regarding data privacy. In this paper, we propose a privacy-preserving method for training a restricted boltzmann machine (RBM). The RBM can be got without revealing their private data to each other when using our privacy-preserving method. We provide a correctness and efficiency analysis of our algorithms. The comparative experiment shows that the accuracy is very close to the original RBM model.
3
Zhang, Jingshuai, Yuanxin Ouyang, Weizhu Xie, Wenge Rong, and Zhang Xiong. "Context-aware restricted Boltzmann machine meets collaborative filtering." Online Information Review 44, no. 2 (November 13, 2018): 455–76. http://dx.doi.org/10.1108/oir-02-2017-0069.
Full textAbstract:
Purpose The purpose of this paper is to propose an approach to incorporate contextual information into collaborative filtering (CF) based on the restricted Boltzmann machine (RBM) and deep belief networks (DBNs). Traditionally, neither the RBM nor its derivative model has been applied to modeling contextual information. In this work, the authors analyze the RBM and explore how to utilize a user’s occupation information to enhance recommendation accuracy. Design/methodology/approach The proposed approach is based on the RBM. The authors employ user occupation information as a context to design a context-aware RBM and stack the context-aware RBM to construct DBNs for recommendations. Findings The experiments on the MovieLens data sets show that the user occupation-aware RBM outperforms other CF models, and combinations of different context-aware models by mutual information can obtain better accuracy. Moreover, the context-aware DBNs model is superior to baseline methods, indicating that deep networks have more qualifications for extracting preference features. Originality/value To improve recommendation accuracy through modeling contextual information, the authors propose context-aware CF approaches based on the RBM. Additionally, the authors attempt to introduce hybrid weights based on information entropy to combine context-aware models. Furthermore, the authors stack the RBM to construct a context-aware multilayer network model. The results of the experiments not only convey that the context-aware RBM has potential in terms of contextual information but also demonstrate that the combination method, the hybrid recommendation and the multilayer neural network extension have significant benefits for the recommendation quality.
4
Wei, Jiangshu, Jiancheng Lv, and Zhang Yi. "A New Sparse Restricted Boltzmann Machine." International Journal of Pattern Recognition and Artificial Intelligence 33, no. 10 (September 2019): 1951004. http://dx.doi.org/10.1142/s0218001419510042.
Full textAbstract:
Although existing sparse restricted Boltzmann machine (SRBM) can make some hidden units activated, the major disadvantage is that the sparseness of data distribution is usually overlooked and the reconstruction error becomes very large after the hidden unit variables become sparse. Different from the SRBMs which only incorporate a sparse constraint term in the energy function formula from the original restricted Boltzmann machine (RBM), an energy function constraint SRBM (ESRBM) is proposed in this paper. The proposed ESRBM takes into account the sparseness of the data distribution so that the learned features can better reflect the intrinsic features of data. Simulations show that compared with SRBM, ESRBM has smaller reconstruction error and lower computational complexity, and that for supervised learning classification, ESRBM obtains higher accuracy rates than SRBM, classification RBM, and Softmax classifier.
5
Aoki, Ken-Ichi, and Tamao Kobayashi. "Restricted Boltzmann machines for the long range Ising models." Modern Physics Letters B 30, no. 34 (December 8, 2016): 1650401. http://dx.doi.org/10.1142/s0217984916504017.
Full textAbstract:
We set up restricted Boltzmann machines (RBM) to reproduce the long range Ising (LRI) models of the Ohmic type in one dimension. The RBM parameters are tuned by using the standard machine learning procedure with an additional method of configuration with probability (CwP). The quality of resultant RBM is evaluated through the susceptibility with respect to the magnetic external field. We compare the results with those by block decimation renormalization group (BDRG) method, and our RBM clear the test with satisfactory precision.
6
Dewi, Christine, Rung-Ching Chen, Hendry, and Hsiu-Te Hung. "Experiment Improvement of Restricted Boltzmann Machine Methods for Image Classification." Vietnam Journal of Computer Science 08, no. 03 (January 19, 2021): 417–32. http://dx.doi.org/10.1142/s2196888821500184.
Full textAbstract:
Restricted Boltzmann machine (RBM) plays an important role in current deep learning techniques, as most of the existing deep networks are based on or related to generative models and image classification. Many applications for RBMs have been developed for a large variety of learning problems. Recent developments have demonstrated the capacity of RBM to be powerful generative models, able to extract useful features from input data or construct deep artificial neural networks. In this work, we propose a learning algorithm to find the optimal model complexity for the RBM by improving the hidden layer (50–750 layers). Then, we compare and analyze the classification performance in depth of regular RBM use RBM () function, classification RBM use stackRBM() function, and Deep Belief Network (DBN) use DBN() function with the different hidden layer. As a result, Stacking RBM and DBN could improve our classification performance compared to regular RBM.
7
Wang, Qianglong, Xiaoguang Gao, Kaifang Wan, Fei Li, and Zijian Hu. "A Novel Restricted Boltzmann Machine Training Algorithm with Fast Gibbs Sampling Policy." Mathematical Problems in Engineering 2020 (March 20, 2020): 1–19. http://dx.doi.org/10.1155/2020/4206457.
Full textAbstract:
The restricted Boltzmann machine (RBM) is one of the widely used basic models in the field of deep learning. Although many indexes are available for evaluating the advantages of RBM training algorithms, the classification accuracy is the most convincing index that can most effectively reflect its advantages. RBM training algorithms are sampling algorithms essentially based on Gibbs sampling. Studies focused on algorithmic improvements have mainly faced challenges in improving the classification accuracy of the RBM training algorithms. To address the above problem, in this paper, we propose a fast Gibbs sampling (FGS) algorithm to learn the RBM by adding accelerated weights and adjustment coefficient. An important link based on Gibbs sampling theory was established between the update of the network weights and mixing rate of Gibbs sampling chain. The proposed FGS method was used to accelerate the mixing rate of Gibbs sampling chain by adding accelerated weights and adjustment coefficients. To further validate the FGS method, numerous experiments were performed to facilitate comparisons with the classical RBM algorithm. The experiments involved learning the RBM based on standard data. The results showed that the proposed FGS method outperformed the CD, PCD, PT5, PT10, and DGS algorithms, particularly with respect to the handwriting database. The findings of our study suggest the potential applications of FGS to real-world problems and demonstrate that the proposed method can build an improved RBM for classification.
8
Hoyle, David C. "Replica analysis of the lattice-gas restricted Boltzmann machine partition function." Journal of Statistical Mechanics: Theory and Experiment 2023, no. 1 (January 1, 2023): 013301. http://dx.doi.org/10.1088/1742-5468/acaf83.
Full textAbstract:
Abstract We study the expectation value of the logarithm of the partition function of large binary-to-binary lattice-gas restricted Boltzmann machines (RBMs) within a replica-symmetric ansatz, averaging over the disorder represented by the parameters of the RBM Hamiltonian. Averaging over the Hamiltonian parameters is done with a diagonal covariance matrix. Due to the diagonal form of the parameter covariance matrix not being preserved under the isomorphism between the Ising and lattice-gas forms of the RBM, we find differences in the behaviour of the quenched log partition function of the lattice-gas RBM compared to that of the Ising RBM form usually studied. We obtain explicit expressions for the expectation and variance of the lattice-gas RBM log partition function per node in the thermodynamic limit. We also obtain explicit expressions for the leading order finite size correction to the expected log partition function per node, and the threshold for the stability of the replica-symmetric approximation. We show that the stability threshold of the replica-symmetric approximation is equivalent, in the thermodynamic limit, to the stability threshold of a recent message-passing algorithm used to construct a mean-field Bethe approximation to the RBM free energy. Given the replica-symmetry assumption breaks down as the level of disorder in the spin-spin couplings increases, we obtain asymptotic expansions, in terms of the variance controlling this disorder, for the replica-symmetric log partition function and the replica-symmetric stability threshold. We confirm the various results derived using simulation.
9
Rully Widiastutik, Lukman Zaman P. C. S. W, and Joan Santoso. "Peringkasan Teks Ekstraktif pada Dokumen Tunggal Menggunakan Metode Restricted Boltzmann Machine." Journal of Intelligent System and Computation 1, no. 2 (December 5, 2019): 58–64. http://dx.doi.org/10.52985/insyst.v1i2.84.
Full textAbstract:
Penelitian yang dilakukan yaitu menghasilkan peringkasan teks ekstratif secara otomatis yang dapat membantu menghasilkan dokumen yang lebih pendek dari dokumen aslinya dengan cara mengambil kalimat penting dari dokumen sehingga pembaca dapat memahami isi dokumen dengan cepat tanpa membaca secara keseluruhan. Dataset yang digunakan sebanyak 30 dokumen tunggal teks berita berbahasa Indonesia yang diperoleh dari www.kompas.com pada kategori tekno. Dalam penelitian ini, digunakan sepuluh fitur yaitu posisi kalimat, panjang kalimat, data numerik, bobot kalimat, kesamaan antara kalimat dan centroid, bi-gram, tri-gram, kata benda yang tepat, kemiripan antar kalimat, huruf besar. Nilai fitur setiap kalimat dihitung. Nilai fitur yang dihasilkan ditingkatkan dengan menggunakan metode Restricted Boltzmann Machine (RBM) agar ringkasan yang dihasilkan lebih akurat. Untuk proses pengujian dalam penelitian ini menggunakan ROUGE-1. Hasil yang diperoleh dalam penelitian yaitu dengan menggunakan learning rate 0.06 menghasilkan recall, precision dan f-measure tertinggi yakni 0.744, 0.611 dan 0.669. Selain itu, semakin besar nilai compression rate yang digunakan maka hasil recall, precision dan f-measure yang dihasilkan akan semakin tinggi. Hasil peringkasan teks dengan menggunakan RBM memiliki nilai recall lebih tinggi 2.1%, precision lebih tinggi 1.6% dan f-measure lebih tinggi 1.8% daripada hasil peringkasan teks tanpa RBM. Hal ini menunjukkan bahwa peringkasan teks dengan menggunakan RBM hasilnya lebih baik daripada peringkasan teks tanpa RBM.
10
Bao, Lin, Xiaoyan Sun, Yang Chen, Guangyi Man, and Hui Shao. "Restricted Boltzmann Machine-Assisted Estimation of Distribution Algorithm for Complex Problems." Complexity 2018 (November 1, 2018): 1–13. http://dx.doi.org/10.1155/2018/2609014.
Full textAbstract:
A novel algorithm, called restricted Boltzmann machine-assisted estimation of distribution algorithm, is proposed for solving computationally expensive optimization problems with discrete variables. First, the individuals are evaluated using expensive fitness functions of the complex problems, and some dominant solutions are selected to construct the surrogate model. The restricted Boltzmann machine (RBM) is built and trained with the dominant solutions to implicitly extract the distributed representative information of the decision variables in the promising subset. The visible layer’s probability of the RBM is designed as the sampling probability model of the estimation of distribution algorithm (EDA) and is updated dynamically along with the update of the dominant subsets. Second, according to the energy function of the RBM, a fitness surrogate is developed to approximate the expensive individual fitness evaluations and participates in the evolutionary process to reduce the computational cost. Finally, model management is developed to train and update the RBM model with newly dominant solutions. A comparison of the proposed algorithm with several state-of-the-art surrogate-assisted evolutionary algorithms demonstrates that the proposed algorithm effectively and efficiently solves complex optimization problems with smaller computational cost.
11
Gu, Jing, and Kai Zhang. "Thermodynamics of the Ising Model Encoded in Restricted Boltzmann Machines." Entropy 24, no. 12 (November 22, 2022): 1701. http://dx.doi.org/10.3390/e24121701.
Full textAbstract:
The restricted Boltzmann machine (RBM) is a two-layer energy-based model that uses its hidden–visible connections to learn the underlying distribution of visible units, whose interactions are often complicated by high-order correlations. Previous studies on the Ising model of small system sizes have shown that RBMs are able to accurately learn the Boltzmann distribution and reconstruct thermal quantities at temperatures away from the critical point Tc. How the RBM encodes the Boltzmann distribution and captures the phase transition are, however, not well explained. In this work, we perform RBM learning of the 2d and 3d Ising model and carefully examine how the RBM extracts useful probabilistic and physical information from Ising configurations. We find several indicators derived from the weight matrix that could characterize the Ising phase transition. We verify that the hidden encoding of a visible state tends to have an equal number of positive and negative units, whose sequence is randomly assigned during training and can be inferred by analyzing the weight matrix. We also explore the physical meaning of the visible energy and loss function (pseudo-likelihood) of the RBM and show that they could be harnessed to predict the critical point or estimate physical quantities such as entropy.
12
Song, Haifeng, Guangsheng Chen, and Weiwei Yang. "An Image Classification Algorithm and its Parallel Implementation Based on ANL-RBM." Journal of Information Technology Research 11, no. 3 (July 2018): 29–46. http://dx.doi.org/10.4018/jitr.2018070103.
Full textAbstract:
This article describes how when using Restricted Boltzmann Machine (RBM) algorithm to design the image classification network. The node number in each hidden layer, and the layer number of the entire network are designed by experiments, it increases the complexity for the RBM design. In order to solve the problem, this article proposes an image classification algorithm based on ANL-RBM (Adaptive Nodes and Layers Restricted Boltzmann Machine). The algorithm can automatically calculate the node number in each hidden layer and the layer number of the entire network. It can reduce the complexity for the RBM design. In the meantime, this article has designed the parallel model of the algorithm in the Hadoop platform. The experimental results showed that the image classification algorithm based on an ANL-RBM has a higher execution efficiency, better speedup, better scalability and it is suitable for massive amounts of image data processing.
13
Liu, Junhui, Yajuan Jia, Yaya Wang, and Petr Dolezel. "Development of Driver-Behavior Model Based onWOA-RBM Deep Learning Network." Journal of Advanced Transportation 2020 (September 29, 2020): 1–11. http://dx.doi.org/10.1155/2020/8859891.
Full textAbstract:
Human drivers’ behavior, which is very difficult to model, is a very complicated stochastic system. To characterize a high-accuracy driver behavior model under different roadway geometries, the paper proposes a new algorithm of driver behavior model based on the whale optimization algorithm-restricted Boltzmann machine (WOA-RBM) method. This method establishes an objective optimization function first, which contains the training of RBM deep learning network based on the real driver behavior data. Second, the optimal training parameters of the restricted Boltzmann machine (RBM) can be obtained through the whale optimization algorithm. Finally, the well-trained model can be used to represent the human drivers’ operation effectively. The MATLAB simulation results showed that the driver model can achieve an accuracy of 90%.
14
Prima, Indiko, and Defri Ahmad. "ANALISIS CONDITIONAL RESTRICTED BOLTZMAN MACHINE UNTUK MEMPREDIKSI HARGA SAHAM BANK SYARIAH INDONESIA." Jurnal Lebesgue : Jurnal Ilmiah Pendidikan Matematika, Matematika dan Statistika 4, no. 1 (April 30, 2023): 409–16. http://dx.doi.org/10.46306/lb.v4i1.266.
Full textAbstract:
This study aims to predict the movement of Bank Syariah Indonesia shares (BRIS.JK) prices using the Conditional Restricted Boltzmann Machine (CRBM) method. Prediction is needed in conducting share transactions, because the increase or decrease in share price movements is very difficult to predict. The CRBM method is a machine learning algorithm used to model the probability distribution of data associated with variables and inputs. CRBM is a type of Restricted Boltzman Machine (RBM) that consists of two layers, namely the input layer and the hidden layer. CRBM is a type of Boltzmann machine model equipped with a conditioned unit that is used to perform analysis and learning on data that has conditional properties. In this research, the first step is to divide several research scenarios. Then conduct CRBM tests to get prediction results. The data used is daily close data. Based on the research that has been done, it is obtained that the best prediction accuracy is in July - August with MAPE below 5%.
15
He, Xiao-hui, Dong Wang, Yan-feng Li, and Chun-hua Zhou. "A Novel Bearing Fault Diagnosis Method Based on Gaussian Restricted Boltzmann Machine." Mathematical Problems in Engineering 2016 (2016): 1–8. http://dx.doi.org/10.1155/2016/2957083.
Full textAbstract:
To realize the fault diagnosis of bearing effectively, this paper presents a novel bearing fault diagnosis method based on Gaussian restricted Boltzmann machine (Gaussian RBM). Vibration signals are firstly resampled to the same equivalent speed. Subsequently, the envelope spectrums of the resampled data are used directly as the feature vectors to represent the fault types of bearing. Finally, in order to deal with the high-dimensional feature vectors based on envelope spectrum, a classifier model based on Gaussian RBM is applied. Gaussian RBM has the ability to provide a closed-form representation of the distribution underlying the training data, and it is very convenient for modeling high-dimensional real-valued data. Experiments on 10 different data sets verify the performance of the proposed method. The superiority of Gaussian RBM classifier is also confirmed by comparing with other classifiers, such as extreme learning machine, support vector machine, and deep belief network. The robustness of the proposed method is also studied in this paper. It can be concluded that the proposed method can realize the bearing fault diagnosis accurately and effectively.
16
Assis, Carlos A. S., Eduardo J. Machado, Adriano C. M. Pereira, and Eduardo G. Carrano. "Hybrid deep learning approach for financial time series classification." Revista Brasileira de Computação Aplicada 10, no. 2 (July 17, 2018): 54–63. http://dx.doi.org/10.5335/rbca.v10i2.7904.
Full textAbstract:
This paper proposes a combined approach of two machine learning techniques for financial time series classification. Boltzmann Restricted Machines (RBM) were used as the latent features extractor and Support Vector Machines (SVM) as the classifier. Tests were performed with real data of five assets from Brazilian Stock Market. The results of the combined RBM + SVM techniques showed better performance when compared to the isolated SVM, which suggests that the proposed approach can be suitable for the considered application.
17
Wahid, Fazli, Sania Azhar, Sikandar Ali, Muhammad Sultan Zia, Faisal Abdulaziz Almisned, and Abdu Gumaei. "Pneumonia Detection in Chest X-Ray Images Using Enhanced Restricted Boltzmann Machine." Journal of Healthcare Engineering 2022 (August 12, 2022): 1–17. http://dx.doi.org/10.1155/2022/1678000.
Full textAbstract:
The process of pneumonia detection has been the focus of researchers as it has proved itself to be one of the most dangerous and life-threatening disorders. In recent years, many machine learning and deep learning algorithms have been applied in an attempt to automate this process but none of them has been successful significantly to achieve the highest possible accuracy. In a similar attempt, we propose an enhanced approach of a deep learning model called restricted Boltzmann machine (RBM) which is named enhanced RBM (ERBM). One of the major drawbacks associated with the standard format of RBM is its random weight initialization which leads to improper feature learning of the model during the training phase, resulting in poor performance of the machine. This problem has been tried to eliminate in this work by finding the differences between the means of a specific feature vector and the means of all features given as inputs to the machine. By performing this process, the reconstruction of the actual features is increased which ultimately reduces the error generated during the training phase of the model. The developed model has been applied to three different datasets of pneumonia diseases and the results have been compared with other state of the art techniques using different performance evaluation parameters. The proposed model gave highest accuracy of 98.56% followed by standard RBM, SVM, KNN, and decision tree which gave accuracies of 97.53%, 92.62%, 91.64%, and 88.77%, respectively, for dataset named dataset 2. Similarly, for the dataset 1, the highest accuracy of 96.66 has been observed for the eRBM followed by srRBM, KNN, decision tree, and SVM which gave accuracies of 90.22%, 89.34%, 87.65%, and 86.55%, respectively. In the same way, the accuracies observed for the dataset 3 by eRBM, standard RBM, KNN, decision tree, and SVM are 92.45%, 90.98%, 87.54%, 85.49%, and 84.54%, respectively. Similar observations can also be seen for other performance parameters showing the efficiency of the proposed model. As revealed in the results obtained, a significant improvement has been observed in the working of the RBM by introducing a new method of weight initialization during the training phase. The results show that the improved model outperforms other models in terms of different performance evaluation parameters, namely, accuracy, sensitivity, specificity, F1-score, and ROC curve.
18
Jiang, Yun, Junyu Zhuo, Juan Zhang, and Xiao Xiao. "The optimization of parallel convolutional RBM based on Spark." International Journal of Wavelets, Multiresolution and Information Processing 17, no. 02 (March 2019): 1940011. http://dx.doi.org/10.1142/s0219691319400113.
Full textAbstract:
With the extensive attention and research of the scholars in deep learning, the convolutional restricted Boltzmann machine (CRBM) model based on restricted Boltzmann machine (RBM) is widely used in image recognition, speech recognition, etc. However, time consuming training still seems to be an unneglectable issue. To solve this problem, this paper mainly uses optimized parallel CRBM based on Spark, and proposes a parallel comparison divergence algorithm based on Spark and uses it to train the CRBM model to improve the training speed. The experiments show that the method is faster than traditional sequential algorithm. We train the CRBM with the method and apply it to breast X-ray image classification. The experiments show that it can improve the precision and the speed of training compared with traditional algorithm.
19
Wu, Jue, Lei Yang, Fujun Yang, Peihong Zhang, and Keqiang Bai. "Hybrid recommendation algorithm based on real-valued RBM and CNN." Mathematical Biosciences and Engineering 19, no. 10 (2022): 10673–86. http://dx.doi.org/10.3934/mbe.2022499.
Full textAbstract:
<abstract> <p>With the unprecedented development of big data, it is becoming hard to get the valuable information hence, the recommendation system is becoming more and more popular. When the limited Boltzmann machine is used for collaborative filtering, only the scoring matrix is considered, and the influence of the item content, the user characteristics and the user evaluation content on the predicted score is not considered. To solve this problem, the modified hybrid recommendation algorithm based on Gaussian restricted Boltzmann machine is proposed in the paper. The user text information and the item text information are input to the embedding layer to change the text information into numerical vector. The convolutional neural network is used to get the latent feature vector of the text information. The latent vector is connected to rating vector to get the item and the user vector. The user vector and the item vector are fused together to get the user-item matrix which is input to the visual layer of Gaussian restricted Boltzmann Machine to predict the ratings. Some simulation experiments have been performed on the algorithm, and the results of the experiments proved that the algorithm is feasible.</p> </abstract>
20
Larochelle, Hugo, Yoshua Bengio, and Joseph Turian. "Tractable Multivariate Binary Density Estimation and the Restricted Boltzmann Forest." Neural Computation 22, no. 9 (September 2010): 2285–307. http://dx.doi.org/10.1162/neco_a_00014.
Full textAbstract:
We investigate the problem of estimating the density function of multivariate binary data. In particular, we focus on models for which computing the estimated probability of any data point is tractable. In such a setting, previous work has mostly concentrated on mixture modeling approaches. We argue that for the problem of tractable density estimation, the restricted Boltzmann machine (RBM) provides a competitive framework for multivariate binary density modeling. With this in mind, we also generalize the RBM framework and present the restricted Boltzmann forest (RBForest), which replaces the binary variables in the hidden layer of RBMs with groups of tree-structured binary variables. This extension allows us to obtain models that have more modeling capacity but remain tractable. In experiments on several data sets, we demonstrate the competitiveness of this approach and study some of its properties.
21
Yao, Yunkai. "Quantum computation of Restricted Boltzmann Machines by Monte Carlo Methods." Highlights in Science, Engineering and Technology 9 (September 30, 2022): 227–32. http://dx.doi.org/10.54097/hset.v9i.1780.
Full textAbstract:
In recent years, the diversification of problems that require computers to solve has attracted attention to the construction of meta-heuristics that can be applied to a wide range of problems, and to specialized computers that implement these meta-heuristics in their devices. The representative meta-heuristics are Simulated Annealing (SA) and its extension to quantum computation, Quantum Annealing (QA), and its path-integral Monte Carlo method for classical simulation Crosson and Harrow showed that for certain problems where QA outperformed SA, SQA achieved performance close to that of QA, and SQA sometimes outperformed SA by an exponential time factor. On the other hand, it remains unclear whether SQA can work efficiently on a wide range of other problems. In this study, we experimentally compared SA and SQA on instances of the restricted Boltzmann machine RBM, known as a fundamental building block in deep learning, and 3SAT, a fundamental combinatorial optimization problem. The results show that SQA gives slightly better solutions than SA as the problem size increases for RBM in terms of both accuracy and computation time in our setting, but the opposite trend is observed for 3SAT, indicating that there is no significant difference between the two methods. From the viewpoint of artificial intelligence research, it is necessary to further examine whether deep learning can be made more efficient by applying QA and SQA to RBM.
22
Pratama, Yohanssen, Riyanthi Angrainy Sianturi, Dedi Chandra, Kristopel Lumbantoruan, and Indah Trivena Tampubolon. "Restricted Boltzmann Machine and Matrix Factorization-Alternating Square Algorithm for Development Tourist Recommendation System." Journal of Physics: Conference Series 2394, no. 1 (December 1, 2022): 012004. http://dx.doi.org/10.1088/1742-6596/2394/1/012004.
Full textAbstract:
Abstract The rapid development of technology affects the growth of tourist attraction information in Indonesia. Therefore, an accurate recommendation system is needed in recommending tourist attractions. In this final project, we use the Collaborative Filtering method, namely the Restricted Boltzmann Machine (RBM) algorithm and the Matrix Factorization-Alternating Least Squares (MF-ALS) algorithm in recommending tourist attractions. Attraction recommendations will be generated from the type of tourist attraction available on the website and the rating that has been given by previous users who have visited the tourist attraction. We use a root mean square error (RMSE) to find the accuracy. From the results of the research and implementation of the two algorithms, it can be concluded that the RBM algorithm is more accurate than the MF-ALS algorithm. The RBM algorithm has an RMSE value of 41%, while the MF-ALS algorithm 81%.
23
Rastgoo, Razieh, Kourosh Kiani, and Sergio Escalera. "Multi-Modal Deep Hand Sign Language Recognition in Still Images Using Restricted Boltzmann Machine." Entropy 20, no. 11 (October 23, 2018): 809. http://dx.doi.org/10.3390/e20110809.
Full textAbstract:
In this paper, a deep learning approach, Restricted Boltzmann Machine (RBM), is used to perform automatic hand sign language recognition from visual data. We evaluate how RBM, as a deep generative model, is capable of generating the distribution of the input data for an enhanced recognition of unseen data. Two modalities, RGB and Depth, are considered in the model input in three forms: original image, cropped image, and noisy cropped image. Five crops of the input image are used and the hand of these cropped images are detected using Convolutional Neural Network (CNN). After that, three types of the detected hand images are generated for each modality and input to RBMs. The outputs of the RBMs for two modalities are fused in another RBM in order to recognize the output sign label of the input image. The proposed multi-modal model is trained on all and part of the American alphabet and digits of four publicly available datasets. We also evaluate the robustness of the proposal against noise. Experimental results show that the proposed multi-modal model, using crops and the RBM fusing methodology, achieves state-of-the-art results on Massey University Gesture Dataset 2012, American Sign Language (ASL). and Fingerspelling Dataset from the University of Surrey’s Center for Vision, Speech and Signal Processing, NYU, and ASL Fingerspelling A datasets.
24
Khan, Umair, Pooyan Safari, and Javier Hernando. "Restricted Boltzmann Machine Vectors for Speaker Clustering and Tracking Tasks in TV Broadcast Shows." Applied Sciences 9, no. 13 (July 9, 2019): 2761. http://dx.doi.org/10.3390/app9132761.
Full textAbstract:
Restricted Boltzmann Machines (RBMs) have shown success in both the front-end and backend of speaker verification systems. In this paper, we propose applying RBMs to the front-end for the tasks of speaker clustering and speaker tracking in TV broadcast shows. RBMs are trained to transform utterances into a vector based representation. Because of the lack of data for a test speaker, we propose RBM adaptation to a global model. First, the global model—which is referred to as universal RBM—is trained with all the available background data. Then an adapted RBM model is trained with the data of each test speaker. The visible to hidden weight matrices of the adapted models are concatenated along with the bias vectors and are whitened to generate the vector representation of speakers. These vectors, referred to as RBM vectors, were shown to preserve speaker-specific information and are used in the tasks of speaker clustering and speaker tracking. The evaluation was performed on the audio recordings of Catalan TV Broadcast shows. The experimental results show that our proposed speaker clustering system gained up to 12% relative improvement, in terms of Equal Impurity (EI), over the baseline system. On the other hand, in the task of speaker tracking, our system has a relative improvement of 11% and 7% compared to the baseline system using cosine and Probabilistic Linear Discriminant Analysis (PLDA) scoring, respectively.
25
Nastiti, Vinna Rahmayanti Setyaning, Zamah Sari, and Bella Chintia Eka Merita. "The Implementation of Restricted Boltzmann Machine in Choosing a Specialization for Informatics Students." Jurnal Online Informatika 8, no. 1 (June 28, 2023): 36–43. http://dx.doi.org/10.15575/join.v8i1.917.
Full textAbstract:
Choosing a specialization was not an easy task for some students, especially for those who lacked confidence in their skill and ability. Specialization in tertiary education became the benchmark and key to success for students’ future careers. This study was conducted to provide the learning outcomes record, which showed the specialization classification for the Informatics students by using the data from the students of 2013-2015 who had graduated. The total data was 319 students. The classification method used for this study was the Restricted Boltzmann Machine (RBM). However, the data showed imbalanced class distribution because the number of each field differed greatly. Therefore, SMOTE was added to classify the imbalanced class. The accuracy obtained from the combination of RBM and SMOTE was 70% with a 0.4 mean squared error.
26
Le Roux, Nicolas, and Yoshua Bengio. "Representational Power of Restricted Boltzmann Machines and Deep Belief Networks." Neural Computation 20, no. 6 (June 2008): 1631–49. http://dx.doi.org/10.1162/neco.2008.04-07-510.
Full textAbstract:
Deep belief networks (DBN) are generative neural network models with many layers of hidden explanatory factors, recently introduced by Hinton, Osindero, and Teh (2006) along with a greedy layer-wise unsupervised learning algorithm. The building block of a DBN is a probabilistic model called a restricted Boltzmann machine (RBM), used to represent one layer of the model. Restricted Boltzmann machines are interesting because inference is easy in them and because they have been successfully used as building blocks for training deeper models. We first prove that adding hidden units yields strictly improved modeling power, while a second theorem shows that RBMs are universal approximators of discrete distributions. We then study the question of whether DBNs with more layers are strictly more powerful in terms of representational power. This suggests a new and less greedy criterion for training RBMs within DBNs.
27
Savitha, Ramasamy, ArulMurugan Ambikapathi, and Kanagasabai Rajaraman. "Online RBM: Growing Restricted Boltzmann Machine on the fly for unsupervised representation." Applied Soft Computing 92 (July 2020): 106278. http://dx.doi.org/10.1016/j.asoc.2020.106278.
Full text
28
Cheng, Song, Jing Chen, and Lei Wang. "Information Perspective to Probabilistic Modeling: Boltzmann Machines versus Born Machines." Entropy 20, no. 8 (August 7, 2018): 583. http://dx.doi.org/10.3390/e20080583.
Full textAbstract:
We compare and contrast the statistical physics and quantum physics inspired approaches for unsupervised generative modeling of classical data. The two approaches represent probabilities of observed data using energy-based models and quantum states, respectively. Classical and quantum information patterns of the target datasets therefore provide principled guidelines for structural design and learning in these two approaches. Taking the Restricted Boltzmann Machines (RBM) as an example, we analyze the information theoretical bounds of the two approaches. We also estimate the classical mutual information of the standard MNIST datasets and the quantum Rényi entropy of corresponding Matrix Product States (MPS) representations. Both information measures are much smaller compared to their theoretical upper bound and exhibit similar patterns, which imply a common inductive bias of low information complexity. By comparing the performance of RBM with various architectures on the standard MNIST datasets, we found that the RBM with local sparse connection exhibit high learning efficiency, which supports the application of tensor network states in machine learning problems.
29
Dixit, Vivek, Yaroslav Koshka, Tamer Aldwairi, and M. A. Novotny. "Comparison of quantum and classical methods for labels and patterns in Restricted Boltzmann Machines." Journal of Physics: Conference Series 2122, no. 1 (November 1, 2021): 012007. http://dx.doi.org/10.1088/1742-6596/2122/1/012007.
Full textAbstract:
Abstract Classification and data reconstruction using a restricted Boltzmann machine (RBM) is presented. RBM is an energy-based model which assigns low energy values to the configurations of interest. It is a generative model, once trained it can be used to produce samples from the target distribution. The D-Wave 2000Q is a quantum computer which has been used to exploit its quantum effect for machine learning. Bars-and-stripes (BAS) and cybersecurity (ISCX) datasets were used to train RBMs. The weights and biases of trained RBMs were used to map onto the D-Wave. Classification as well as image reconstruction were performed. Classification accuracy of both datasets indicates comparable performance using D-Wave’s adiabatic annealing and classical Gibb’s sampling.
30
Bulso, Nicola, and Yasser Roudi. "Restricted Boltzmann Machines as Models of Interacting Variables." Neural Computation 33, no. 10 (September 16, 2021): 2646–81. http://dx.doi.org/10.1162/neco_a_01420.
Full textAbstract:
Abstract We study the type of distributions that restricted Boltzmann machines (RBMs) with different activation functions can express by investigating the effect of the activation function of the hidden nodes on the marginal distribution they impose on observed binary nodes. We report an exact expression for these marginals in the form of a model of interacting binary variables with the explicit form of the interactions depending on the hidden node activation function. We study the properties of these interactions in detail and evaluate how the accuracy with which the RBM approximates distributions over binary variables depends on the hidden node activation function and the number of hidden nodes. When the inferred RBM parameters are weak, an intuitive pattern is found for the expression of the interaction terms, which reduces substantially the differences across activation functions. We show that the weak parameter approximation is a good approximation for different RBMs trained on the MNIST data set. Interestingly, in these cases, the mapping reveals that the inferred models are essentially low order interaction models.
31
Crawford, Daniel, Anna Levit, Navid Ghadermarzy, Jaspreet S. Oberoi, and Pooya Ronagh. "Reinforcement learning using quantum Boltzmann machines." Quantum Information and Computation 18, no. 1&2 (February 2018): 51–74. http://dx.doi.org/10.26421/qic18.1-2-3.
Full textAbstract:
We investigate whether quantum annealers with select chip layouts can outperform classical computers in reinforcement learning tasks. We associate a transverse field Ising spin Hamiltonian with a layout of qubits similar to that of a deep Boltzmann machine (DBM) and use simulated quantum annealing (SQA) to numerically simulate quantum sampling from this system. We design a reinforcement learning algorithm in which the set of visible nodes representing the states and actions of an optimal policy are the first and last layers of the deep network. In absence of a transverse field, our simulations show that DBMs are trained more effectively than restricted Boltzmann machines (RBM) with the same number of nodes. We then develop a framework for training the network as a quantum Boltzmann machine (QBM) in the presence of a significant transverse field for reinforcement learning. This method also outperforms the reinforcement learning method that uses RBMs.
32
Qu, Jia, Zihao Song, Xiaolong Cheng, Zhibin Jiang, and Jie Zhou. "Neighborhood-based inference and restricted Boltzmann machine for small molecule-miRNA associations prediction." PeerJ 11 (August 24, 2023): e15889. http://dx.doi.org/10.7717/peerj.15889.
Full textAbstract:
Background A growing number of experiments have shown that microRNAs (miRNAs) can be used as target of small molecules (SMs) to regulate gene expression for treating diseases. Therefore, identifying SM-related miRNAs is helpful for the treatment of diseases in the domain of medical investigation. Methods This article presents a new computational model, called NIRBMSMMA (neighborhood-based inference (NI) and restricted Boltzmann machine (RBM)), which we developed to identify potential small molecule-miRNA associations (NIRBMSMMA). First, grounded on known SM-miRNAs associations, SM similarity and miRNA similarity, NI was used to predict score of an unknown SM-miRNA pair by reckoning the sum of known associations between neighbors of the SM (miRNA) and the miRNA (SM). Second, utilizing a two-layered generative stochastic artificial neural network, RBM was used to predict SM-miRNA association by learning potential probability distribution from known SM-miRNA associations. At last, an ensemble learning model was conducted to combine NI and RBM for identifying potential SM-miRNA associations. Results Furthermore, we conducted global leave one out cross validation (LOOCV), miRNA-fixed LOOCV, SM-fixed LOOCV and five-fold cross validation to assess performance of NIRBMSMMA based on three datasets. Results showed that NIRBMSMMA obtained areas under the curve (AUC) of 0.9912, 0.9875, 0.8376 and 0.9898 ± 0.0009 under global LOOCV, miRNA-fixed LOOCV, SM-fixed LOOCV and five-fold cross validation based on dataset 1, respectively. For dataset 2, the AUCs are 0.8645, 0.8720, 0.7066 and 0.8547 ± 0.0046 in turn. For dataset 3, the AUCs are 0.9884, 0.9802, 0.8239 and 0.9870 ± 0.0015 in turn. Also, we conducted case studies to further assess the predictive performance of NIRBMSMMA. These results illustrated the proposed model is a useful tool in predicting potential SM-miRNA associations.
33
Noormandipour, Mohammadreza, Sun Youran, and Babak Haghighat. "Restricted Boltzmann machine representation for the groundstate and excited states of Kitaev Honeycomb model." Machine Learning: Science and Technology 3, no. 1 (December 10, 2021): 015010. http://dx.doi.org/10.1088/2632-2153/ac3ddf.
Full textAbstract:
Abstract In this work, the capability of restricted Boltzmann machines (RBMs) to find solutions for the Kitaev honeycomb model with periodic boundary conditions is investigated. The measured groundstate energy of the system is compared and, for small lattice sizes (e.g. 3 × 3 with 18 spinors), shown to agree with the analytically derived value of the energy up to a deviation of 0.09 % . Moreover, the wave-functions we find have 99.89 % overlap with the exact ground state wave-functions. Furthermore, the possibility of realizing anyons in the RBM is discussed and an algorithm is given to build these anyonic excitations and braid them for possible future applications in quantum computation. Using the correspondence between topological field theories in (2 + 1)d and 2d conformal field theories, we propose an identification between our RBM states with the Moore-Read state and conformal blocks of the 2d Ising model.
34
Bader Alazzam, Malik, Fawaz Alassery, and Ahmed Almulihi. "Identification of Diabetic Retinopathy through Machine Learning." Mobile Information Systems 2021 (November 26, 2021): 1–8. http://dx.doi.org/10.1155/2021/1155116.
Full textAbstract:
A cross-sectional study of patients with suspected diabetic retinopathy (DR) who had an ophthalmological examination and a retinal scan is the focus of this research. Specialized retinal images were analyzed and classified using OPF and RBM models (restricted Boltzmann machines). Classification of retinographs was based on the presence or absence of disease-related retinopathy (DR). The RBM and OPF models extracted 500 and 1000 characteristics from the images for disease classification after the system training phase for the recognition of retinopathy and normality patterns. There were a total of fifteen different experiment series, each with a repetition rate of 30 cycles. The study included 73 diabetics (a total of 122 eyes), with 50.7% of them being men and 49.3% being women. The population was on the older side, at 59.7 years old on average. The RBM-1000 had the highest overall diagnostic accuracy (89.47) of any of the devices evaluated. The RBM-500 had a better autodetection system for DR signals in fundus images than the competition (100% sensitivity). In terms of specificity, RBM-1000 and OPF-1000 correctly identified all of the images that lacked DR signs. In particular, the RBM model of machine learning automatic disease detection performed well in terms of diagnostic accuracy, sensitivity, and application in diabetic retinopathy screening.
35
Tubiana, Jérôme, Simona Cocco, and Rémi Monasson. "Learning Compositional Representations of Interacting Systems with Restricted Boltzmann Machines: Comparative Study of Lattice Proteins." Neural Computation 31, no. 8 (August 2019): 1671–717. http://dx.doi.org/10.1162/neco_a_01210.
Full textAbstract:
A restricted Boltzmann machine (RBM) is an unsupervised machine learning bipartite graphical model that jointly learns a probability distribution over data and extracts their relevant statistical features. RBMs were recently proposed for characterizing the patterns of coevolution between amino acids in protein sequences and for designing new sequences. Here, we study how the nature of the features learned by RBM changes with its defining parameters, such as the dimensionality of the representations (size of the hidden layer) and the sparsity of the features. We show that for adequate values of these parameters, RBMs operate in a so-called compositional phase in which visible configurations sampled from the RBM are obtained by recombining these features. We then compare the performance of RBM with other standard representation learning algorithms, including principal or independent component analysis (PCA, ICA), autoencoders (AE), variational autoencoders (VAE), and their sparse variants. We show that RBMs, due to the stochastic mapping between data configurations and representations, better capture the underlying interactions in the system and are significantly more robust with respect to sample size than deterministic methods such as PCA or ICA. In addition, this stochastic mapping is not prescribed a priori as in VAE, but learned from data, which allows RBMs to show good performance even with shallow architectures. All numerical results are illustrated on synthetic lattice protein data that share similar statistical features with real protein sequences and for which ground-truth interactions are known.
36
Koshka, Yaroslav, Dilina Perera, Spencer Hall, and M. A. Novotny. "Determination of the Lowest-Energy States for the Model Distribution of Trained Restricted Boltzmann Machines Using a 1000 Qubit D-Wave 2X Quantum Computer." Neural Computation 29, no. 7 (July 2017): 1815–37. http://dx.doi.org/10.1162/neco_a_00974.
Full textAbstract:
The possibility of using a quantum computer D-Wave 2X with more than 1000 qubits to determine the global minimum of the energy landscape of trained restricted Boltzmann machines is investigated. In order to overcome the problem of limited interconnectivity in the D-Wave architecture, the proposed RBM embedding combines multiple qubits to represent a particular RBM unit. The results for the lowest-energy (the ground state) and some of the higher-energy states found by the D-Wave 2X were compared with those of the classical simulated annealing (SA) algorithm. In many cases, the D-Wave machine successfully found the same RBM lowest-energy state as that found by SA. In some examples, the D-Wave machine returned a state corresponding to one of the higher-energy local minima found by SA. The inherently nonperfect embedding of the RBM into the Chimera lattice explored in this work (i.e., multiple qubits combined into a single RBM unit were found not to be guaranteed to be all aligned) and the existence of small, persistent biases in the D-Wave hardware may cause a discrepancy between the D-Wave and the SA results. In some of the investigated cases, introduction of a small bias field into the energy function or optimization of the chain-strength parameter in the D-Wave embedding successfully addressed difficulties of the particular RBM embedding. With further development of the D-Wave hardware, the approach will be suitable for much larger numbers of RBM units.
37
Cheng, Xiaolong, Jia Qu, Shuangbao Song, and Zekang Bian. "Neighborhood-based inference and restricted Boltzmann machine for microbe and drug associations prediction." PeerJ 10 (August 15, 2022): e13848. http://dx.doi.org/10.7717/peerj.13848.
Full textAbstract:
Background Efficient identification of microbe-drug associations is critical for drug development and solving problem of antimicrobial resistance. Traditional wet-lab method requires a lot of money and labor in identifying potential microbe-drug associations. With development of machine learning and publication of large amounts of biological data, computational methods become feasible. Methods In this article, we proposed a computational model of neighborhood-based inference (NI) and restricted Boltzmann machine (RBM) to predict potential microbe-drug association (NIRBMMDA) by using integrated microbe similarity, integrated drug similarity and known microbe-drug associations. First, NI was used to obtain a score matrix of potential microbe-drug associations by using different thresholds to find similar neighbors for drug or microbe. Second, RBM was employed to obtain another score matrix of potential microbe-drug associations based on contrastive divergence algorithm and sigmoid function. Because generalization ability of individual method is poor, we used an ensemble learning to integrate two score matrices for predicting potential microbe-drug associations more accurately. In particular, NI can fully utilize similar (neighbor) information of drug or microbe and RBM can learn potential probability distribution hid in known microbe-drug associations. Moreover, ensemble learning was used to integrate individual predictor for obtaining a stronger predictor. Results In global leave-one-out cross validation (LOOCV), NIRBMMDA gained the area under the receiver operating characteristics curve (AUC) of 0.8666, 0.9413 and 0.9557 for datasets of DrugVirus, MDAD and aBiofilm, respectively. In local LOOCV, AUCs of 0.8512, 0.9204 and 0.9414 were obtained for NIRBMMDA based on datasets of DrugVirus, MDAD and aBiofilm, respectively. For five-fold cross validation, NIRBMMDA acquired AUC and standard deviation of 0.8569 ± −0.0027, 0.9248 ± −0.0014 and 0.9369 ± −0.0020 on the basis of datasets of DrugVirus, MDAD and aBiofilm, respectively. Moreover, case study for severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) showed that 13 out of the top 20 predicted drugs were verified by searching literature. The other two case studies indicated that 17 and 17 out of the top 20 predicted microbes for the drug of ciprofloxacin and minocycline were confirmed by identifying published literature, respectively.
38
Siddula, Sundeep, G. K. Prashanth, Praful Nandankar, Ram Subbiah, Saikh Mohammad Wabaidur, Essam A. Al-Ammar, M. H. Siddique, and Subash Thanappan. "Optimal Placement of Hybrid Wind-Solar System Using Deep Learning Model." International Journal of Photoenergy 2022 (May 25, 2022): 1–7. http://dx.doi.org/10.1155/2022/2881603.
Full textAbstract:
In this paper, we develop an optimal placement of solar-wind energy systems using restricted Boltzmann machine (RBM). The RBM considers various factors to scale the process of optimal placement and enables proper sizing and placement for attaining increased electricity production from both wind and solar systems. The multiobjective criterion from both solar and wind energy farms simulated on MATLAB simulator shows an increased number of accuracies with reduced mean average error and computation time during training and testing. The results show that the RBM achieves improved rate of finding the optimal placement with a lesser cost and computation time of lesser than 2 ms than other methods.
39
Guo, Xian, Zhang, Li, and Ren. "Hybrid IRBM-BPNN Approach for Error Parameter Estimation of SINS on Aircraft." Sensors 19, no. 17 (August 24, 2019): 3682. http://dx.doi.org/10.3390/s19173682.
Full textAbstract:
To realize the error parameter estimation of strap-down inertial navigation system (SINS) and improve the navigation accuracy for aircraft, a hybrid improved restricted Boltzmann machine BP neural network (IRBM-BPNN) approach, which combines restricted Boltzmann machine (RBM) and BP neural network (BPNN), is proposed to forecast the inertial measurement unit (IMU) instrument errors and initial alignment errors of SINS. Firstly, the error generation mechanism of SINS is analyzed, and initial alignment error model and IMU instrument error model are established. Secondly, an unsupervised RBM method is introduced to initialize BPNN to improve the forecast performance of the neural network. The RBM-BPNN model is constructed through the information fusion of SINS/GPS/CNS integrated navigation system by using the sum of position deviation, the sum of velocity deviation and the sum of attitude deviation as the inputs and by using the error parameters of SINS as the outputs. The RBM-BPNN structure is improved to enhance its forecast accuracy, and the pulse signal is increased as the input of the neural network. Finally, we conduct simulation experiments to forecast and compensate the error parameters of the proposed IRBM-BPNN method. Simulation results show that the artificial neural network method is feasible and effective in forecasting SINS error parameters, and the forecast accuracy of SINS error parameters can be effectively improved by combining RBM and BPNN methods and improving the neural network structure. The proposed IRBM-BPNN method has the optimal forecast accuracy of SINS error parameters and navigation accuracy of aircraft compared with the radial basis function neural network method and BPNN method.
40
Behera, Dayal Kumar, Madhabananda Das, Subhra Swetanisha, and Prabira Kumar Sethy. "Hybrid model for movie recommendation system using content K-nearest neighbors and restricted Boltzmann machine." Indonesian Journal of Electrical Engineering and Computer Science 23, no. 1 (July 1, 2021): 445. http://dx.doi.org/10.11591/ijeecs.v23.i1.pp445-452.
Full textAbstract:
<span>One of the most commonly used techniques in the recommendation framework is collaborative filtering (CF). It performs better with sufficient records of user rating but is not good in sparse data. Content-based filtering works well in the sparse dataset as it finds the similarity between movies by using attributes of the movies. RBM is an energy-based model serving as a backbone of deep learning and performs well in rating prediction. However, the rating prediction is not preferable by a single model. The hybrid model achieves better results by integrating the results of more than one model. This paper analyses the weighted hybrid CF system by integrating content K-nearest neighbors (KNN) with restricted Boltzmann machine (RBM). Movies are recommended to the active user in the proposed system by integrating the effects of both content-based and collaborative filtering. Model efficacy was tested with MovieLens benchmark datasets.</span>
41
Cho, KyungHyun, Tapani Raiko, and Alexander Ilin. "Enhanced Gradient for Training Restricted Boltzmann Machines." Neural Computation 25, no. 3 (March 2013): 805–31. http://dx.doi.org/10.1162/neco_a_00397.
Full textAbstract:
Restricted Boltzmann machines (RBMs) are often used as building blocks in greedy learning of deep networks. However, training this simple model can be laborious. Traditional learning algorithms often converge only with the right choice of metaparameters that specify, for example, learning rate scheduling and the scale of the initial weights. They are also sensitive to specific data representation. An equivalent RBM can be obtained by flipping some bits and changing the weights and biases accordingly, but traditional learning rules are not invariant to such transformations. Without careful tuning of these training settings, traditional algorithms can easily get stuck or even diverge. In this letter, we present an enhanced gradient that is derived to be invariant to bit-flipping transformations. We experimentally show that the enhanced gradient yields more stable training of RBMs both when used with a fixed learning rate and an adaptive one.
42
Wu, Yangjun, Xiansong Xu, Dario Poletti, Yi Fan, Chu Guo, and Honghui Shang. "A Real Neural Network State for Quantum Chemistry." Mathematics 11, no. 6 (March 15, 2023): 1417. http://dx.doi.org/10.3390/math11061417.
Full textAbstract:
The restricted Boltzmann machine (RBM) has recently been demonstrated as a useful tool to solve the quantum many-body problems. In this work we propose tanh-FCN, which is a single-layer fully connected neural network adapted from RBM, to study ab initio quantum chemistry problems. Our contribution is two-fold: (1) our neural network only uses real numbers to represent the real electronic wave function, while we obtain comparable precision to RBM for various prototypical molecules; (2) we show that the knowledge of the Hartree-Fock reference state can be used to systematically accelerate the convergence of the variational Monte Carlo algorithm as well as to increase the precision of the final energy.
43
Liu, Qinghua, Lu Sun, Alain Kornhauser, Jiahui Sun, and Nick Sangwa. "Road roughness acquisition and classification using improved restricted Boltzmann machine deep learning algorithm." Sensor Review 39, no. 6 (November 18, 2019): 733–42. http://dx.doi.org/10.1108/sr-05-2018-0132.
Full textAbstract:
Purpose To realize classification of different pavements, a road roughness acquisition system design and an improved restricted Boltzmann machine deep neural network algorithm based on Adaboost Backward Propagation algorithm for road roughness detection is presented in this paper. The developed measurement system, including hardware designs and algorithm for software, constitutes an independent system which is low-cost, convenient for installation and small. Design/methodology/approach The inputs of restricted Boltzmann machine deep neural network are the vehicle vertical acceleration power spectrum and the pitch acceleration power spectrum, which is calculated using ADAMS finite element software. Adaboost Backward Propagation algorithm is used in each restricted Boltzmann machine deep neural network classification model for fine-tuning given its performance of global searching. The algorithm is first applied to road spectrum detection and experiments indicate that the algorithm is suitable for detecting pavement roughness. Findings The detection rate of RBM deep neural network algorithm based on Adaboost Backward Propagation is up to 96 per cent, and the false positive rate is below 3.34 per cent. These indices are both better than the other supervised algorithms, which also performs better in extracting the intrinsic characteristics of data, and therefore improves the classification accuracy and classification quality. Additionally, the classification performance is optimized. The experimental results show that the algorithm can improve performance of restricted Boltzmann machine deep neural networks. The system can be used for detecting pavement roughness. Originality/value This paper presents an improved restricted Boltzmann machine deep neural network algorithm based on Adaboost Backward Propagation for identifying the road roughness. Through the restricted Boltzmann machine, it completes pre-training and initializing sample weights. The entire neural network is fine-tuned through the Adaboost Backward Propagation algorithm, verifying the validity of the algorithm on the MNIST data set. A quarter vehicle model is used as the foundation, and the vertical acceleration spectrum of the vehicle center of mass and pitch acceleration spectrum were obtained by simulation in ADAMS as the input samples. The experimental results show that the improved algorithm has better optimization ability, improves the detection rate and can detect the road roughness more effectively.
44
Xu, Aoqi, Man-Wen Tian, Behnam Firouzi, Khalid A. Alattas, Ardashir Mohammadzadeh, and Ebrahim Ghaderpour. "A New Deep Learning Restricted Boltzmann Machine for Energy Consumption Forecasting." Sustainability 14, no. 16 (August 15, 2022): 10081. http://dx.doi.org/10.3390/su141610081.
Full textAbstract:
A key issue in the desired operation and development of power networks is the knowledge of load growth and electricity demand in the coming years. Mid-term load forecasting (MTLF) has an important rule in planning and optimal use of power systems. However, MTLF is a complicated problem, and a lot of uncertain factors and variables disturb the load consumption pattern. This paper presents a practical approach for MTLF. A new deep learning restricted Boltzmann machine (RBM) is proposed for modelling and forecasting energy consumption. The contrastive divergence algorithm is presented for tuning the parameters. All parameters of RBMs, the number of input variables, the type of inputs, and also the layer and neuron numbers are optimized. A statistical approach is suggested to determine the effective input variables. In addition to the climate variables, such as temperature and humidity, the effects of other variables such as economic factors are also investigated. Finally, using simulated and real-world data examples, it is shown that for one year ahead, the mean absolute percentage error (MAPE) for the load peak is less than 5%. Moreover, for the 24-h pattern forecasting, the mean of MAPE for all days is less than 5%.
45
Ravikumaran, P., K. Vimala Devi, and K. Valarmathi. "An Improved Kidney Tumor Prediction Using Deep Convolutional Neural Network-Restricted Boltzmann Machine Technique in Medical Image Segmentation." Journal of Medical Imaging and Health Informatics 11, no. 12 (December 1, 2021): 3191–98. http://dx.doi.org/10.1166/jmihi.2021.3917.
Full textAbstract:
Automatic medical image segmentation has become increasingly important as contemporary medical imaging has become more widely available and used. Existing image segmentation solutions however lack the necessary functionality for simple medical image segmentation pipeline design. Pipelines that have already been deployed are frequently standalone software that has been optimised for a certain public data collection. As a result, the open-source python module deep-Convolutional neural network-Restricted Boltzmann Machine (deep CNNRBM) was introduced in this research work. The goal of Deep CNN-purpose RBMs is to have an easy-touse API that allows for the rapid creation of medical image segmentation transmission lines that include data augmentation, metrics, data I/O pre-processing, patch wise analysis, a library of pre-built deep neural networks, and fully automated assessment. Similarly, comprehensive pipeline customisation is possible because of strong configurability and many open interfaces. The dataset of Kidney tumor Segmentation challenge 2019 (KiTS19) acquired a strong predictor with respect to the standard 3D U-net model after cross-validation using deep CNNRBM. To that purpose, deep CNN-RBM, an expressive deep learning medical image segmentation architecture is introduced. The CNN sub-model captures frame-level spatial features automatically while the RBM submodel fuses spatial data over time to learn higher-level semantics in kidney tumor prediction. A neural network recognises medical picture segmentation, which is initiated using RBM to second-order collected data and then fine-tuned using back propagation to be more differential. According to the simulation outcome, the proposed deep CNN-RBM produced good classification results on the kidney tumour segmentation dataset.
46
Prasanna, Kamepalli S. L., and Nagendra Panini Challa. "Hybrid MRK-Means + + RBM Model: An Efficient Heart Disease Predicting System Using ModifiedRoughK-Means + + Algorithm and Restricted Boltzmann Machine." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 31, Supp01 (May 2023): 65–99. http://dx.doi.org/10.1142/s0218488523400056.
Full textAbstract:
The clinical diagnosis of heart disease in most situations is based on a difficult amalgamation of pathological and clinical information. Because of this complication, there is a significant level of curiosity among many diagnostic healthcare professionals and researchers who are keenly interested in the efficient, accurate, and early-stage forecasting of heart disease. Deep Learning Algorithms aid in the prediction of heart disease. The main focus of this paper is to develop a method for predicting heart disease through Modified Rough K means[Formula: see text] (MRK[Formula: see text]) clustering along with the Restricted Boltzmann Machine (RBM). This paper is categorized into two modules: (1) Propose a clustering component based on Modified Rough K-means[Formula: see text]; (2) disease prediction based on RBM. The input Cleveland dataset is clustered using the stochastic probabilistic rough k-means[Formula: see text] clustering technique in the module for clustering. The clustered data is acquired and used in the RBM, and this hybrid structure is then used in the heart disease forecasting module. Throughout the testing procedure, the most valid result is chosen from the clustered test data, and the RBM classifier that correlates to the nearest cluster in the test data is based on the smallest distance or similar parameters. Furthermore, the output value is used to predict heart disease. There are three different types of experiments that are performed: In the first experiment comprises modifying the rough K-means[Formula: see text] clustering algorithm, the second experiment evaluates the classification result, and the third experiment suggests hybrid model representation. When the Hybrid Modified Rough k-means[Formula: see text] - RBM model is compared with any single model, it provides the highest accuracy.
47
Wang, Xi-Li, and Fen Chen. "Shape Modeling Based on Convolutional Restricted Boltzmann Machines." MATEC Web of Conferences 173 (2018): 01022. http://dx.doi.org/10.1051/matecconf/201817301022.
Full textAbstract:
This paper proposes a kind of shape model based on convolutional restricted Boltzmann machines(CRBM), which can be used to assist the task of image target detection and classification. The CRBM is a generative model that can model shapes through the generative capabilities of the model. This paper presents the visual representation, construction process and training method of the model construction. This paper does experiments on the Weizmann Horse dataset. The results show that, compared with RBM, although the training time of this model is slightly longer, the test time of the model is similar, and it can better shape modeling, modeling of the details of the shape can be well expressed. The samples generated from CRBM look more realistic. The difference between the shape and the original shape generated by Euclidean distance measurement shows that the model has a strong ability to model shapes.
48
Wu, Xin-Jie, Ming-Da Xu, Chang-Di Li, Chong Ju, Qian Zhao, and Shi-Xing Liu. "Research on image reconstruction algorithms based on autoencoder neural network of Restricted Boltzmann Machine (RBM)." Flow Measurement and Instrumentation 80 (August 2021): 102009. http://dx.doi.org/10.1016/j.flowmeasinst.2021.102009.
Full text
49
Huang, Jizhong, and Yepeng Guan. "Dropout Deep Belief Network Based Chinese Ancient Ceramic Non-Destructive Identification." Sensors 21, no. 4 (February 12, 2021): 1318. http://dx.doi.org/10.3390/s21041318.
Full textAbstract:
A non-destructive identification method was developed here based on dropout deep belief network in multi-spectral data of ancient ceramic. A fractional differential algorithm was proposed to enhance the spectral details by making use of the difference between the first and second-order differential pre-process spectral data. An unsupervised multi-layer restricted Boltzmann machine (RBM) was employed to extract some high-level features during pre-training. Some weight and bias values trained by RBM were used to initialize a back propagation (BP) neural network. The RBM deep belief network was fine-tuned by the BP neural network to promote the initiative performance of network training, which helped to overcome local optimal limitation of the network due to the random initializing weight parameter. The dropout strategy has been put forward into the RBM network to solve the over-fitting of small sample spectral data. The experimental results show that the proposed method has excellent recognition performance of the ceramics by comparisons with some other ones.
50
Ramineni, Vyshnavi, and Goo-Rak Kwon. "Diagnosis of Alzheimer’s Disease using Wrapper Feature Selection Method." Korean Institute of Smart Media 12, no. 3 (April 30, 2023): 30–37. http://dx.doi.org/10.30693/smj.2023.12.3.30.
Full textAbstract:
Alzheimer’s disease (AD) symptoms are being treated by early diagnosis, where we can only slow the symptoms and research is still undergoing. In consideration, using T1-weighted images several classification models are proposed in Machine learning to identify AD. In this paper, we consider the improvised feature selection, to reduce the complexity by using wrapping techniques and Restricted Boltzmann Machine (RBM). This present work used the subcortical and cortical features of 278 subjects from the ADNI dataset to identify AD and sMRI. Multi-class classification is used for the experiment i.e., AD, EMCI, LMCI, HC. The proposed feature selection consists of Forward feature selection, Backward feature selection, and Combined PCA & RBM. Forward and backward feature selection methods use an iterative method starting being no features in the forward feature selection and backward feature selection with all features included in the technique. PCA is used to reduce the dimensions and RBM is used to select the best feature without interpreting the features. We have compared the three models with PCA to analysis. The following experiment shows that combined PCA &RBM, and backward feature selection give the best accuracy with respective classification model RF i.e., 88.65, 88.56% respectively.