24 articles for “mining operations”

Set a search alert

Research ArticleOpen accessIn the abstractCircumventing Picture Archiving and Communication Systems Server with Hadoop Framework in Health Care ServicesGopinath Ganapathy, S. SagayarajProblem statement: Features and challenges of the PACS server solutions are elaborated in the context of large scale computing. Approach: Hadoop is a pivotal piece of the data mining renaissance offers the ability to tackle large data sets in ways that weren’t previously feasible and clarifies certain functionalities such as MapReducer and Hadoop distributed file system. Results: The PACS server … …Journal of Social Sciences, Vol. 6, Issue 3 · 30 Sep 2010 · 8,088 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordAn Application of Session Based Clustering to Analyze Web Pages of User Interest from Web Log FilesC. P. Sumathi, R. Padmaja Valli, T. SanthanamProblem statement: With the continued growth and proliferation of e-commerce, Web services and Web-based information systems, the volumes of click-stream and user data collected by Web-based organizations in their daily operations have reached astronomical proportions. Analyzing such data can help these organizations optimize the functionality of web-based applications and provide more personalized content to visitors. This type of analysis involved … …Journal of Computer Science, Vol. 6, Issue 7 · 31 Jul 2010 · 6,877 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordAn Efficient Approach for Computing Silhouette CoefficientsMoh'd B. Al- Zoubi, Mohammad al RawiOne popular approach for finding the best number of clusters (K) in a data set is through computing the silhouette coefficients. The silhouette coefficients for different values of K, are first found and then the maximum value of these coefficients is chosen. However, computing the silhouette coefficient for different Ks is a very time consuming process. This is due to … …Journal of Computer Science, Vol. 4, Issue 3 · 31 Mar 2008 · 8,067 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordParallel Two-Dimensional Quicksort Algorithm (PTSA)Hamed Al Rjoub, Ahmad Odat, Abdullah AudatIn this research, a Parallel Two-Dimensional Sorting Algorithm (PTSA) is presented that has better performance than the classical Quicksort, to sort a data vector of size n = r (rows) × c(columns). PTSA algorithm divides the input vector into n/r sub-vectors, which represents tow-dimensional vector of Slave Processor Elements (VPE ), the maximum number of VPE for parallel sorting is … …Journal of Computer Science, Vol. 4, Issue 1 · 31 Jan 2008 · 6,859 accessesView PDF Cite