检索结果-内蒙古大学图书馆

7th ACM India Computing Conference, COMPUTE 2014

作者： Goyal, Poonam Kumari, Sonal Kumar, Dhruv Balasubramaniam, Sundar Goyal, Navneet Advanced Data Analytics and Parallel Technologies Laboratory Department of Computer Science and Information Systems BITS-Pilani Pilani India

ISBN: (纸本)9781605588148

parallelizing algorithms to leverage multiple cores in a processor or multiple nodes in a cluster setup is the only way forward to handle ever-increasing volumes of data. OPTICS is a well-known density based clustering algorithm to identify arbitrary shaped clusters. Since, hierarchical cluster ordering of OPTICS is sensitive to the order in which data is processed, typically a priority queue is used to maintain the order. This sequential access order makes it difficult to parallelize OPTICS. Moreover, the execution time of OPTICS increases with increase in density of data. We propose a parallel version of OPTICS for shared memory multi-core systems using a master-slave pattern for parallelization. The master runs concurrently with the slaves and distributes data to the slaves. Each slave performs neighborhood queries for a subset of data. Our approach ensures that cluster ordering matches with that of the classical OPTICS. Our solution runs in a mostly data parallel mode yielding scalable performance. We also argue that our approach is well suited for dense datasets in particular. Copyright 2014 ACM.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

A Survey and Experimental Review on data Distribution Strategies for parallel Spatial Clustering Algorithms

引用

Journal of Computer Science & Technology 2024年第3期39卷 610-636页

作者： Jagat Sesh Challa Navneet Goyal Amogh Sharma Nikhil Sreekumar Sundar Balasubramaniam Poonam Goyal Advanced Data Analytics and Parallel Technologies Laboratory Birla Institute of Technology and Science Pilani 333031India Uber New York 11101U.S.A. Computer Science and Engineering Department University of MinnesotaMinneapolis 55455U.S.A.

The advent of Big data has led to the rapid growth in the usage of parallel clustering algorithms that work over distributed computing frameworks such as MPI,MapReduce,and *** important step for any parallel clustering algorithm is the distribution of data amongst the cluster *** step governs the methodology and performance of the entire *** typically use random,or a spatial/geometric distribution strategy like kd-tree based partitioning and grid-based partitioning,as per the requirements of the ***,these strategies are generic and are not tailor-made for any specific parallel clustering *** this paper,we give a very comprehensive literature survey of MPI-based parallel clustering algorithms with special reference to the specific data distribution strategies they *** also propose three new data distribution strategies namely Parameterized Dimensional Split for parallel density-based clustering algorithms like DBSCAN and OPTICS,Cell-Based Dimensional Split for dGridSLINK,which is a grid-based hierarchical clustering algorithm that exhibits efficiency for disjoint spatial distribution,and Projection-Based Split,which is a generic distribution *** of these preserve spatial locality,achieve disjoint partitioning,and ensure good data load *** experimental analysis shows the benefits of using the proposed data distribution strategies for algorithms they are designed for,based on which we give appropriate recommendations for their usage.

关键词： parallel data mining data distribution parallel clustering spatial locality preservation

来源：评论

学校读者我要写书评

暂无评论

Android Web Security Solution using Cross-device Federated Learning 14

Android Web Security Solution using Cross-device Federated L...

引用

14th International Conference on COMmunication Systems and NETworkS, COMSNETS 2022

作者： Singh, A K Goyal, Navneet BITS Pilani Advanced Data Analytics Parallel Technologies Lab Dept. of CSIS Pilani Campus India

ISBN: (纸本)9781665421041

Over the last one decade or so, Machine Learning has changed the global technology landscape with applications in almost all disciplines and verticals. Mobile and Web Security is an important research area in which researchers have been trying to apply Machine Learning, but data privacy concerns and high data communication costs to a central Machine Learning server have limited its use. Federated Learning is emerging as a promising solution which addresses privacy concerns and drastically reduces communication costs. In Federated Learning, data from individual devices is not communicated to a central server and model learning happens in a distributed manner. In this paper, we propose a Federated Learning solution for security of Android based devices. Mobile and Web Security solutions have evolved from signature-based detections to building Machine Learning models which are trained over large centralized malware repositories. We have used Federated Learning to learn security patterns from users' browsing data, which resides on individual devices and will never leave the devices. Federated Learning preserves users' privacy as it shares with the central server only the model that it learns from users' browsing data, and not the data itself. This way each mobile platform trains its own web security model from its data, and shares it to the centralized server. The centralized server aggregates these trained models received from numerous mobile devices and compiles an aggregated global model, which in turn is sent to mobile devices for inference. Mobile security solutions based on this concept create a sustained self-evolving security ecosystem, in which millions of mobile platforms share their learned models to form a robust distributed security paradigm. The results obtained using Federated Learning are found to be comparable with the results of centralized Machine Learning. © 2022 IEEE.

关键词： Mobile security

来源：评论

学校读者我要写书评

暂无评论

A concurrent k-NN search algorithm for R-tree 15

A concurrent k-NN search algorithm for R-tree

引用

8th ACM COMPUTE INDIA Conference, Compute 2015

作者： Challa, Jagat Sesh Goyal, Poonam Nikhil, S. Balasubramaniam, Sundar Goyal, Navneet Advanced Data Analytics and Parallel Technologies Laboratory Department of Computer Science and Information Systems Birla Institute of Technology and Science - Pilani Pilani Campus Pilani India

ISBN: (纸本)9781450336505

K-nearest neighbor (k-NN) search is one of the commonly used query in database systems. It has its application in various domains like data mining, decision support systems, information retrieval, multimedia and spatial databases, etc. When k-NN search is performed over large data sets, spatial data indexing structures such as R-trees are commonly used to improve query efficiency. The best-first k-NN (BF-kNN) algorithm is the fastest known k-NN over R-trees. We present CBF-k NN, a concurrent BF-kNN for R-trees, which is the first concurrent version of k-NN we know of for R-trees. CBF-k NN uses one of the most efficient concurrent priority queues known as mound. CBF-k NN overcomes the concurrency limitations of priority queues by using a tree-parallel mode of execution. CBF-kNN has an estimated speedup of 0(p/k) for p threads. Experimental results on various real datasets show that the speedup in practice is close to this estimate. © 2015 ACM.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

A Rapid Prototyping Approach for High Performance Density-Based Clustering

A Rapid Prototyping Approach for High Performance Density-Ba...

引用

International Conference on data Science and advanced analytics (DSAA)

作者： Saiyedul Islam Sundar Balasubramaniam Poonam Goyal Ankit Sultana Lakshit Bhutani Saurabh Raje Navneet Goyal Advanced Data Analytics & Parallel Technologies Laboratory Birla Institute of Technology and Science Pilani India

Big data has significantly increased the dependence of data analytics community on High Performance Computing (HPC) systems. However, efficiently programming an HPC system is still a tedious task requiring specialized skills in parallelization and the use of platform-specific languages as well as mechanisms. We present a framework for quickly prototyping new/existing density-based clustering algorithms while obtaining low running times and high speedups via automatic parallelization. The user is required only to specify the sequential algorithm in a Domain Specific Language (DSL) for clustering at a very high level of abstraction. The parallelizing compiler for the DSL does the rest to leverage distributed systems - in particular, typical scale-out clusters made of commodity hardware. Our approach is based on recurring, parallelizable programming patterns known as Kernels, which are identified and parallelized by the compiler. We demonstrate the ease of programming and scalable performance for DBSCAN, SNN, and RECOME algorithms. We also establish that the proposed approach can achieve performance comparable to state-of-the-art manually parallelized implementations while requiring minimal programming effort that is several orders of magnitude smaller than those required on other parallel platforms like MPI/Spark.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Scalable parallel Algorithms for Shared Nearest Neighbor Clustering

Scalable Parallel Algorithms for Shared Nearest Neighbor Clu...

引用

International Conference on High Performance Computing

作者： Sonal Kumari Saurabh Maurya Poonam Goyal Sundar S Balasubramaniam Navneet Goyal Department of Computer Science & Information Systems Advanced Data Analytics & Parallel Technologies Laboratory INDIA

ISBN: (纸本)9781509054121

Clustering is a popular data mining technique which discovers structure in unlabeled data by grouping objects together on the basis of a similarity criterion. Traditional similarity measures lose their meaning as the number of dimensions increases and as a consequence, distance or density based clustering algorithms become less meaningful. Shared Nearest Neighbor (SNN) is a solution to clustering high-dimensional data with the ability to find clusters of varying density. SNN assigns objects to a cluster, which share a large number of their nearest neighbors. However, SNN is compute and memory intensive for data of large size and/or dimensionality. Nearest neighbor queries are responsible for a major proportion of computations in SNN, resulting in lower efficiency for higher value of number of nearest neighbors (k). The main motivation of this work is to improve the efficiency of SNN and to parallelize it so that it can be used for clustering large high-dimensional datasets and for large values of k. Existing SNN algorithms become inefficient in these situations. In this paper, we present a new sequential SNN algorithm, R-SNN, which uses R-tree for executing neighborhood queries efficiently and exploiting spatial locality to minimize memory usage. R-SNN is benchmarked against the best available implementation of SNN and is found up to 77 times faster when tested on various real datasets. R-SNN is parallelized for distributed memory, shared memory, and hybrid systems. Significant speedup and scalability achieved can be attributed to parallelization and good load balancing strategies and also to exploitation of spatial locality. Experimental results demonstrate the same for datasets of varying dimensionality and size. The maximum speedup achieved for shared, distributed, and hybrid models are 427.19 using 48 threads, 394.24 using 32 processes, and 1380.69 on 32 nodes (with each node spawning 4 threads), respectively. Super-linear speedup for some datasets is attributed

关键词： Clustering algorithms Algorithm design and analysis Time complexity Spatial databases parallel algorithms Memory management Density measurement

来源：评论

学校读者我要写书评

暂无评论

Rapid Prototyping of Hierarchical Agglomerative Clustering Algorithms for Distributed Systems

Rapid Prototyping of Hierarchical Agglomerative Clustering A...

引用

IEEE International Conference on Big data

作者： Saiyedul Islam Navneet Goyal Sundar Balasubramaniam Poonam Goyal Achal Agarwal Kirti Singh Rathore Nischay Singh Advanced Data Analytics & Parallel Technologies Laboratory Birla Institute of Technology & Science Pilani Pilani Campus India

ISBN: (数字)9781728108582

ISBN: (纸本)9781728108599

Hierarchical Agglomerative Clustering (HAC) algorithms are used in many applications where clusters have a hierarchical relationship between them. Their parallelization is challenging due to the dependence of every agglomeration step on all previous agglomerations. Although a few parallel algorithms have been proposed for SLINK HAC algorithm, only limited work has been done to parallelize other HAC algorithms. In this paper, we present a high-level abstraction, which provides a uniform way to specify any HAC algorithm, and a framework for automatic parallelization of the same for distributed memory systems. The abstraction is supported by constructs in a high level, domain specific language, and a compiler translates algorithms expressed in this language to efficient parallel code targeting distributed systems. Our experiments on multiple HAC algorithms proves that the runtime performance achieved is comparable with state-of-the-art manual parallel implementations on Spark and MPI while requiring only a fraction of the programming effort. At runtime, master-slave execution is used, and load is balanced among the slaves in an algorithm-agnostic way, which is a significant contrast to custom load-balancing techniques seen in the literature on parallel HAC algorithms.

关键词： Clustering algorithms Programming Merging Heuristic algorithms DSL Measurement Manuals

来源：评论

学校读者我要写书评

暂无评论

A parallel Framework for Grid-Based Bottom-Up Subspace Clustering

A Parallel Framework for Grid-Based Bottom-Up Subspace Clust...

引用

International Conference on data Science and advanced analytics (DSAA)

作者： Poonam Goyal Sonal Kumari Shubham Singh Vivek Kishore Sundar S. Balasubramaniam Navneet Goyal Department of Computer Science & Information Systems Advanced Data Analytics & Parallel Technologies Laboratory Pilani Campus INDIA

ISBN: (纸本)9781509052073

Clustering is a popular data mining and machine learning technique which discovers interesting patterns from unlabeled data by grouping similar objects together. Clustering high-dimensional data is a challenging task as points in high dimensional space are nearly equidistant from each other, rendering commonly used similarity measures ineffective. Subspace clustering has emerged as a possible solution to the problem of clustering high-dimensional data. In subspace clustering, we try to find clusters in different subspaces within a dataset. Many subspace clustering algorithms have been proposed in the last two decades to find clusters in multiple overlapping subspaces of high-dimensional data. Subspace clustering algorithms iteratively find the best subset of dimensions for a cluster from 2d-1 possible combinations in d-dimensional data. Subspace clustering is extremely compute intensive because of exhaustive search of subspaces, especially in the bottom-up subspace clustering algorithms. To address this issue, an efficient parallel framework for grid-based bottom-up subspace clustering algorithms is developed, considering popular algorithms belonging to this category. The framework is implemented for shared memory, distributed memory, and hybrid systems and is tested for three grid-based bottom-up subspace clustering algorithms: CLIQUE, MAFIA, and ENCLUS. All parallel implementations exhibit impressive speedup and scalability on real datasets.

关键词： Conferences

来源：评论

学校读者我要写书评

暂无评论

A fast, Scalable SLINK Algorithm for Commodity Cluster Computing Exploiting Spatial Locality

A fast, Scalable SLINK Algorithm for Commodity Cluster Compu...

引用

IEEE International Conference on High Performance Computing and Communications

作者： Poonam Goyal Sonal Kumari Sumit Sharma Dhruv Kumar Vivek Kishore Sundar Balasubramaniam Navneet Goyal Advanced Data Analytics & Parallel Technologies Laboratory Department of Computer Science & Information Systems BITS-Pilani Pilani Campus INDIA

ISBN: (纸本)9781509042982

Single linkage (SLINK) hierarchical clustering algorithm is a preferred clustering algorithm over traditional partitioning-based clustering as it does not require the number of clusters as input. But, due to its high time complexity and inherent data dependencies, it does not scale well for large datasets. To the best of our knowledge, all existing parallel SLINK algorithms are based on the traditional SLINK algorithm and thus require large number of computing resources. In this paper, we present a novel optimization of SLINK algorithm, GridSLINK, which is an order of magnitude faster than the existing state-of-the-art implementation. The optimization in GridSLINK comes from reduction in number of distance calculations required by SLINK. This reduction is achieved by exploiting spatial locality of data points and using an adaptive gridding technique. GridSLINK is parallelized for distributed memory systems. Scalable performance is achieved for increasing number of compute nodes. The proposed parallel algorithm, dGridSLINK, is benchmarked against the best existing parallel algorithm in literature and found to outperform the latter for all the real datasets considered. dGridSLINK can cluster millions of data points in few seconds/minutes using a small number of processing elements, without compromising the quality of clustering.

关键词： parallel computing multi-core multi-node clustering SLINK adaptive gridding

来源：评论

学校读者我要写书评

暂无评论

DD-Rtree: A dynamic distributed data structure for efficient data distribution among cluster nodes for spatial data mining algorithms

DD-Rtree: A dynamic distributed data structure for efficient...

引用

IEEE International Conference on Big data

作者： Jagat Sesh Challa Poonam Goyal S. Nikhil Aditya Mangla Sundar S. Balasubramaniam Navneet Goyal Department of Computer Science & Information Systems Birla Institute of Technology & Science Pilani Pilani Campus India Advanced Data Analytics & Parallel Technologies Laboratory Department of Computer Science & Information Systems Birla Institute of Technology & Science Pilani Pilani Campus India

ISBN: (纸本)9781467390064

parallelizing data mining algorithms has become a necessity as we try to mine ever increasing volumes of data. Spatial data mining algorithms like Dbscan, Optics, Slink, etc. have been parallelized to exploit a cluster infrastructure. The efficiency achieved by existing algorithms can be attributed to spatial locality preservation using spatial indexing structures like k-d-tree, quad-tree, grid files, etc. for distributing data among cluster nodes. However, these indexing structures are static in nature, i.e., they need to scan the entire dataset to determine the partitioning coordinates. This results in high data distribution cost when the data size is large. In this paper, we propose a dynamic distributed data structure, DD-Rtree, which preserves spatial locality while distributing data across compute nodes in a shared nothing environment. Moreover, DD-Rtree is dynamic, i.e., it can be constructed incrementally making it useful for handling big data. We compare the quality of data distribution achieved by DD-Rtree with one of the recent distributed indexing structure, SD-Rtree. We also compare the efficiency of queries supported by these indexing structures along with the overall efficiency of DBSCAN algorithm. Our experimental results show that DD-Rtree achieves better data distribution and thereby resulting in improved overall efficiency.

关键词： data structures Clustering algorithms data mining Indexing Distributed databases Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：