Joyanta Basak

Joyanta Basak

Ph.D. student, Computer Science & Engineering, University of Connecticut

Publications

Using Cluster Quality Metrics for Record Linkage Evaluation

14th International Conference on Computational Advances in Bio and Medical Sciences (ICCABS 2026), 2026

Cluster-quality metrics for evaluating record-linkage results when ground-truth matches are unavailable.

Recommended citation: J. Basak, N. Shah, A. Mathur, J. A. L. Hutnick, K. Park, D. Weinberg, S. Sahni, S. Rajasekaran. (2026). "Using Cluster Quality Metrics for Record Linkage Evaluation." ICCABS 2026. Forthcoming in Springer proceedings.

Fast Algorithms for Computing Jaro Similarity

Journal of Computational Biology, 2026

Journal version extending our linear-time Jaro similarity work with faster algorithms for computing Jaro similarity, a string-comparison measure central to record linkage.

Recommended citation: J. Basak, N. Shah, K. B. Haase, A. Mathur, K. Park, R. C. Steorts, D. H. Weinberg, S. Sahni, S. Rajasekaran. (2026). "Fast Algorithms for Computing Jaro Similarity." Journal of Computational Biology. https://doi.org/10.1177/15578666261421965

Double Metaphone Blocking: An Innovative Blocking Approach to Record Linkage

International Symposium on Bioinformatics Research and Applications (ISBRA), LNCS, 2025

A phonetic blocking approach for record linkage based on the Double Metaphone encoding.

Recommended citation: N. Shah, J. Basak, S. Sahni, A. Mathur, K. Park, D. H. Weinberg, S. Rajasekaran. (2025). "Double Metaphone Blocking: An Innovative Blocking Approach to Record Linkage." International Symposium on Bioinformatics Research and Applications (ISBRA), LNCS. https://doi.org/10.1007/978-981-95-0695-8_12

Problem Specific Communications in Distributed Quantum Computing

IEEE International Conference on Quantum Communications, Networking, and Computing (QCNC), 2025

Examines problem-specific communication strategies for distributed quantum computing.

Recommended citation: J. Basak, B. Wang, S. Rajasekaran. (2025). "Problem Specific Communications in Distributed Quantum Computing." IEEE International Conference on Quantum Communications, Networking, and Computing (QCNC). https://doi.org/10.1109/QCNC64685.2025.00069

The Soundex Blocking: A Novel Blocking Approach for Record Linkage

IEEE International Conference on Big Data (BigData), 2024

A Soundex-based phonetic blocking method that reduces the comparisons needed in large-scale record linkage.

Recommended citation: N. Shah, A. T. Soliman, J. Basak, S. Sahni, K. B. Haase, A. Mathur, K. Park, D. H. Weinberg, J. White, S. Rajasekaran. (2024). "The Soundex Blocking: A Novel Blocking Approach for Record Linkage." IEEE International Conference on Big Data (BigData). https://doi.org/10.1109/BigData62323.2024.10825041

SuperBlocking: An Efficient Blocking Technique for Record Linkage

IEEE International Conference on Big Data (BigData), 2023

Introduces SuperBlocking, which reduces unnecessary record comparisons while keeping likely matches. Includes new record-linkage algorithms and parallel versions with near-linear speedups.

Recommended citation: J. Basak, S. Sahni, S. Rajasekaran. (2023). "SuperBlocking: An Efficient Blocking Technique for Record Linkage." IEEE International Conference on Big Data (BigData). https://doi.org/10.1109/BigData59044.2023.10386738

Novel Blocking Techniques and Distance Metrics for Record Linkage

International Conference on Information Integration and Web Intelligence (iiWAS), LNCS, 2023

New blocking techniques and distance metrics for record linkage.

Recommended citation: N. Deo, J. Basak, A. T. Soliman, D. H. Weinberg, R. C. Steorts, S. Rajasekaran. (2023). "Novel Blocking Techniques and Distance Metrics for Record Linkage." International Conference on Information Integration and Web Intelligence (iiWAS), LNCS. https://doi.org/10.1007/978-3-031-48316-5_40

On Computing the Jaro Similarity Between Two Strings

International Symposium on Bioinformatics Research and Applications (ISBRA), LNCS, 2023

Shows that standard Jaro similarity algorithms take quadratic time in the worst case, and gives a linear-time algorithm that computes the same measure.

Recommended citation: J. Basak, A. T. Soliman, N. Deo, K. B. Haase, A. Mathur, K. Park, R. C. Steorts, D. H. Weinberg, S. Sahni, S. Rajasekaran. (2023). "On Computing the Jaro Similarity Between Two Strings." International Symposium on Bioinformatics Research and Applications (ISBRA), LNCS. https://doi.org/10.1007/978-981-99-7074-2_3