2011 3rd International Conference on Electronics Computer Technology 2011
DOI: 10.1109/icectech.2011.5941564
|View full text |Cite
|
Sign up to set email alerts
|

Neural network learning improvement using K-means clustering algorithm to improve the performance of web traffic mining

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
1
1
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 8 publications
0
2
0
Order By: Relevance
“…If grouping or clustering partitions a dataset into p sub-datasets, the expected GPC complexity per thread is O((n/p) 3 ), which lowers the overall complexity by p 3 times with p parallel threads. G-KM-MLP, in the same way, reduces BP training complexity from O(n 2 ) [18] to O((n/p) 2 ) per thread. Experiments use computers of 2.7 GHz Intel Core i5, 4GB 1333MHz DDR3 memory, and 4 cores.…”
Section: Speedup Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…If grouping or clustering partitions a dataset into p sub-datasets, the expected GPC complexity per thread is O((n/p) 3 ), which lowers the overall complexity by p 3 times with p parallel threads. G-KM-MLP, in the same way, reduces BP training complexity from O(n 2 ) [18] to O((n/p) 2 ) per thread. Experiments use computers of 2.7 GHz Intel Core i5, 4GB 1333MHz DDR3 memory, and 4 cores.…”
Section: Speedup Analysismentioning
confidence: 99%
“…Neural Networks. Multi-layer perceptron (MLP) can handle complex classification problem [18] [19]. However the cons of MLP are clear: No prior idea of the optimal size of hidden layer.…”
Section: Data Mining Techniquesmentioning
confidence: 99%