#### Filter Results:

- Full text PDF available (0)

#### Publication Year

2011

2017

- This year (1)
- Last 5 years (8)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Sonal Kumari, Suman K. Mitra
- 2011 Third National Conference on Computer Vision…
- 2011

Action is any meaningful movement of the human and it is used to convey information or to interact naturally without any mechanical devices. Human action recognition is motivated by some of the applications such as video retrieval, Human robot interaction, to interact with deaf and dumb people etc. In any Action Recognition System, some pre-processing steps… (More)

- Poonam Goyal, Sonal Kumari, +4 authors Jagat Sesh Challa
- ICDCN
- 2015

In this paper, we propose an algorithm, DOPTICS, a parallelized version of a popular density based cluster-ordering algorithm OPTICS. Parallelizing OPTICS is challenging because of its strong sequential data access behavior. To achieve high parallelism, a data parallel approach that exploits the underlying indexing structure is proposed. We implement the… (More)

- Poonam Goyal, Sonal Kumari, Dhruv Kumar, Sundar Balasubramaniam, Navneet Goyal
- COMPUTE
- 2014

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… (More)

- Sonal Kumari, Saurabh Maurya, Poonam Goyal, Sundar Balasubramaniam, Navneet Goyal
- 2016 IEEE 23rd International Conference on High…
- 2016

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… (More)

- Poonam Goyal, Sonal Kumari, Shubham Singh, Vivek Kishore, Sundar Balasubramaniam, Navneet Goyal
- 2016 IEEE International Conference on Data…
- 2016

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… (More)

- Poonam Goyal, Sonal Kumari, Sumit Sharma, Vivek Kishore, Navneet Goyal, Sundar Balasubramaniam
- 2016 IEEE International Conference on Cluster…
- 2016

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. In this paper, we parallelize an efficient… (More)

DBSCAN is one of the most popular density-based clustering algorithm capable of identifying arbitrary shaped clusters and noise. It is computationally expensive for large data sets. In this paper, we present a grid-based DBSCAN algorithm, GridDBSCAN, which is significantly faster than the state-of-the-art sequential DBSCAN. The efficiency of GridDBSCAN is… (More)

- Sonal Kumari, Anil Maheshwari, Poonam Goyal, Navneet Goyal
- COMPUTE
- 2015

Handling and processing of larger volume of data requires efficient data mining algorithms. k-means is a very popular clustering algorithm for data mining, but its performance suffers because of initial seeding problem. The computation time of k-means algorithm is directly proportional to the number of data-points, number of dimensions, and number of… (More)

- Poonam Goyal, Sonal Kumari, +4 authors Navneet Goyal
- 2016 IEEE 18th International Conference on High…
- 2016

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… (More)

- ‹
- 1
- ›