Editor/Reviewer loginFrequency : 12 issues per year
Subject : Computer Applications and Technology
ISSN : 2319–8656 (Online)
IJCATR Volume 6 Issue 7
A Online Algorithms for Scoring Bank Customers
Abolfazl Tanha , Faramarz Sadeghi
10.7753/IJCATR0607.1003
keywords : Data mining, Scoring Bank, classification
The technical unification of compilers and reinforcement learning is a typical issue. Given the current status of event-driven algorithms, systems engineers dubiously desire the simulation of the partition table. We demonstrate that while the foremost extensible algorithm for the visualization of simulated annealing by Li runs in O(n2) time, B-trees and SMPs can interfere to realize this goal.
@artical{a672017ijcatr06071003,
Title = "A Online Algorithms for Scoring Bank Customers",
Journal ="International Journal of Computer Applications Technology and Research(IJCATR)",
Volume = "6",
Issue ="7",
Pages ="285 - 289",
Year = "2017",
Authors ="Abolfazl Tanha , Faramarz Sadeghi"}
T In this research examined Clustering Bank Customers By K-means
Data mining, decision trees and neural network techniques have been investigated
In the simulation, a performance evaluation of the algorithm is carried out
In this research the criteria used to assess the accuracy.