Search Results - (( parallel solution mining algorithm ) OR ( java applications usage algorithm ))
Search alternatives:
- applications usage »
- parallel solution »
- java applications »
- mining algorithm »
- solution mining »
- usage algorithm »
-
1
-
2
A spark-based parallel fuzzy C median algorithm for web log big data
Published 2022“…This paper proposes an efficient parallel Fuzzy C median solution based on Spark for large-scale web log data. …”
Get full text
Get full text
Get full text
Get full text
Article -
3
Measuring GPU-accelerated parallel SVM performance using large datasets for multi-class machine learning problem
Published 2023Conference Paper -
4
Optimizing OLAP heterogeneous computing based on Rabin-Karp algorithm
Published 2013“…In this paper, through experimental results and based on Rabin-Karp Algorithm; we propose an optimized heterogeneous solution that takes into account the benefits and the boundaries in order to achieve a better OLAP performance in terms of response time with three times gain. …”
Get full text
Get full text
Get full text
Proceeding Paper -
5
An Effective Fast Searching Algorithm for Internet Crawling Usage
Published 2016“…The search algorithm is a crucial part in any internet applications. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
6
Hybrid metaheuristics for QOS-aware service composition / Hadi Naghavipour
Published 2022“…An absolute majority of base algorithms for this problem were nature-inspired and population-based metaheuristics extended to complementary methods in hybrid solutions. …”
Get full text
Get full text
Get full text
Thesis -
7
Mining Sequential Patterns using I-PrefixSpan
Published 2008Get full text
Get full text
Citation Index Journal -
8
Mining Sequential Patterns Using I-PrefixSpan
Published 2007“…The experimental result shows that using Java 2, this method improves the speed of PrefixSpan up to almost two orders of magnitude as well as the memory usage to more than one order of magnitude.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
9
K Nearest Neighbor Joins And Mapreduce Process Enforcement For The Cluster Of Data Sets In Bigdata
Published 2018“…K Nearest Neighbor Joins (KNN join) are regarded as highly primitive and expensive operations in the data mining.The efficient use of KNN join has proven good results in finding the objects from two data sets prevailed in the huge databases.This has been achieved with the combination of K-Nearest Neighbor query and join operation to find the distinct objects from different data sets.MapReduce is a newly introduced program with the combination of Map Procedure method and Reduce Method widely used in BigData.MapReduce is enriched with parallel distributed algorithm to find the results on a cluster of data sets in BigData.In this paper,the combination of KNN join and MapReduce methods are utilized on the cluster of data sets in BigData for knowledge discovery.Exploring the pinpoint data from huge data sets stored in Big Data demands the distributed large scale data processing.The present research paper is focusing on generic steps for KNN joins exploration operations on MapReduce.The operations of KNN Join are targeted to perform the data partitioning and data pre-processing and necessary calculations.By utilizing the combination of KNN joins with MapReduce methods on BigData data sets will demonstrate a solution for complex computational analysis. …”
Get full text
Get full text
Get full text
Article
