Sanjay Chawla
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Sanjay Chawla has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
Bavani Arunasalam
School of Information Technologies, University of Sydney, New South Wales, Australia
1 shared publication- Bavani Arunasalam
University of Sydney, NSW, Australia
1 shared publication David Hand
University of Sydney
1 shared publication- Florian Verhein
University of Sydney
1 shared publication - Gary L. Miller
CMU CMU
1 shared publication Gaurav Pandey
Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, USA
1 shared publication
Latest Publications
- Open Access
Scalable Constrained Clustering: A Generalized Spectral Method
We present a simple spectral approach to the well-studied constrained clustering problem. It captures constrained clustering as a generalized eigenvalue problem with graph Laplacians. The algorithm works in nearly-linear time and provides concrete guarantees for the quality of the clusters, at least for the case of 2-way partitioning. In practice this translates to a very fast implementation that consistently outperforms existing spectral approaches both in speed and quality.
Open AccessScalable Constrained Clustering: A Generalized Spectral Method
We present a simple spectral approach to the well-studied constrained clustering problem. It captures constrained clustering as a generalized eigenvalue problem with graph Laplacians. The algorithm works in nearly-linear time and provides concrete guarantees for the quality of the clusters, at least for the case of 2-way partitioning. In practice this translates to a very fast implementation that consistently outperforms existing spectral approaches both in speed and quality.
- Open Access
SparseDTW: A Novel Approach to Speed up Dynamic Time Warping
We present a new space-efficient approach, (SparseDTW), to compute the Dynamic Time Warping (DTW) distance between two time series that always yields the optimal result. This is in contrast to other known approaches which typically sacrifice optimality to attain space efficiency. The main idea behind our approach is to dynamically exploit the existence of similarity and/or correlation between the time series. The more the similarity between the time series the less space required to compute the DTW between them. To the best of our knowledge, all other techniques to speedup DTW, impose apriori constraints and do not exploit similarity characteristics that may be present in the data. We conduct experiments and demonstrate that SparseDTW outperforms previous approaches.
Open AccessSparseDTW: A Novel Approach to Speed up Dynamic Time Warping
We present a new space-efficient approach, (SparseDTW), to compute the Dynamic Time Warping (DTW) distance between two time series that always yields the optimal result. This is in contrast to other known approaches which typically sacrifice optimality to attain space efficiency. The main idea behind our approach is to dynamically exploit the existence of similarity and/or correlation between the time series. The more the similarity between the time series the less space required to compute the DTW between them. To the best of our knowledge, all other techniques to speedup DTW, impose apriori constraints and do not exploit similarity characteristics that may be present in the data. We conduct experiments and demonstrate that SparseDTW outperforms previous approaches.
- 29 January 2010
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 20 (2) , 189-190
Outlier detection special issue
- 29 January 2010
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 20 (2) , 189-190
Outlier detection special issue
- 26 February 2009
- Published by Wiley in Statistical Analysis and Data Mining: An ASA Data Science Journal
- Vol. 1 (4) , 260-279
Association Rules Network: Definition and Applications
The role of data mining is to search “the space of candidate hypotheses” to offer solutions, whereas the role of statistics is to validate the hypotheses offered by the data‐mining process. In this paper we propose Association Rules Networks (ARNs) as a structure for synthesizing, pruning, and analyzing a collection of association rules to construct candidate hypotheses. From a knowledge discovery perspective, ARNs allow for a goal‐centric, context‐driven analysis of the output of association rules algorithms. From a mathematical perspective, ARNs are instances of backward‐directed hypergraphs. Using two extensive case studies, we show how ARNs and statistical theory can be combined to generate and test hypotheses. Copyright © 2009 Wiley Periodicals, Inc. Statistical Analysis and Data Mining 1: 260‐279, 2009
- 26 February 2009
- Published by Wiley in Statistical Analysis and Data Mining: An ASA Data Science Journal
- Vol. 1 (4) , 260-279
Association Rules Network: Definition and Applications
The role of data mining is to search “the space of candidate hypotheses” to offer solutions, whereas the role of statistics is to validate the hypotheses offered by the data‐mining process. In this paper we propose Association Rules Networks (ARNs) as a structure for synthesizing, pruning, and analyzing a collection of association rules to construct candidate hypotheses. From a knowledge discovery perspective, ARNs allow for a goal‐centric, context‐driven analysis of the output of association rules algorithms. From a mathematical perspective, ARNs are instances of backward‐directed hypergraphs. Using two extensive case studies, we show how ARNs and statistical theory can be combined to generate and test hypotheses. Copyright © 2009 Wiley Periodicals, Inc. Statistical Analysis and Data Mining 1: 260‐279, 2009
- 14 August 2007
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 16 (1) , 5-38
Mining spatio-temporal patterns in object mobility databases
- 14 August 2007
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 16 (1) , 5-38
Mining spatio-temporal patterns in object mobility databases