Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Shri Kant

dblp:74/1455 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
2since 2021 · last 2025
0000-0001-8304-441XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data mining · 87% Information retrieval · 13%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining
clustering
0.112007
Computation of Initial Modes for K-modes Clustering Algorithm Using Evidence Accumulation · IJCAI 2007
Data mining › clustering › categorical data clustering
k-modes clustering
0.112007
Computation of Initial Modes for K-modes Clustering Algorithm Using Evidence Accumulation · IJCAI 2007
Information retrieval
evidence combination
0.012007
Computation of Initial Modes for K-modes Clustering Algorithm Using Evidence Accumulation · IJCAI 2007

Methods — techniques the papers use, named apart from their topics

evidence accumulation · 0.1
YearPublicationVenuePosition
2025 Boolean semiring key-exchange with BLAKE3 security (BKEX-B3)
abstract
Quantum computing has become a major threat to most classical cryptosystems, especially RSA and ECC cryptosystems. Thus, a new field, Post-Quantum Cryptography (PQC), has come to light, aiming to create protocols that cannot be susceptible to quantum attacks. This work presents a new Boolean Semiring Key Exchange Protocol combined with BLAKE3 cryptographic hash function (BKEX-B3). The protocol leverages the flexibility of BLAKE3’s eXtendable Output Function (XOF) and the nonlinearity of Boolean algebra to produce a flexible, quantum-resistant solution capable of dynamically adapting security levels to advancement in quantum algorithms. An examination of the protocol’s performance reveals that it outperforms modern algorithms, especially in terms of memory efficiency and runtime, such as Kyber512, HQC-128, BIKE-L1, sntrup761, FrodoKEM-640-SHAKE, and NewHope. Its scalability and efficient resource management make it a highly appropriate solution that is adaptable and secure for the post-quantum era in environments with limited resources, such as the Internet of Things.
Alvary Kefas Kwala, Alpna Mishra, Shri Kant
Discov. Comput.3
2025 An efficient sentiment analysis technique based on fine-tuned EdBERT for virtual learning environments
Gaurav Srivastav, Shri Kant, Durgesh Srivastava, Neha Sharma 0005, Yu-Chen Hu
Multim. Tools Appl.2
2008 A novel approach of cryptanalysis using SOM
abstract
Machine learning techniques like Self Organizing Maps has been explored for the first time for efficient key clustering in cryptanalysis. In the first phase, transformations have been employed on the encrypted messages to find the dominance in the features and n, in the second phase, Independent Component Analysis -ICA to find important features among the transformed features and finally SOM has been employed for clustering.
B. Chandra 0001, P. Paul Varghese, Pramod K. Saxena, Shri Kant
SMC4
2007 Computation of Initial Modes for K-modes Clustering Algorithm Using Evidence Accumulation
Shehroz S. Khan, Shri Kant
IJCAI2
2006 Analyzing a class of pseudo-random bit generator through inductive machine learning paradigm
Shri Kant, Shehroz S. Khan
Intell. Data Anal.1
2000 An effective source recognition algorithm: extraction of significant binary words
Shri Kant, Neelam Verma
Pattern Recognit. Lett.1
1994 An automatic and stable clustering algorithm
Shri Kant, T. L. Rao, P. N. Sundaram
Pattern Recognit. Lett.1