Abstract

With the increase in user-generated content on social media networks, hate speech and offensive language content are also increasing. From the perspective of computer science, automatic detection of such hate speech and offensive language content is an interesting problem to solve. The natural language community has taken a step to identify such content via automated hate speech and offensive content detection. The hate speech content is generated mostly on social media, and automatic hate speech and offensive language detection face many challenges due to non-standard spelling and grammar variations. Specifically, in a multilingual community, the hate content would be in code-mixed form, making the task further challenging. In this article, we propose a model for code-mixed hate speech detection. This model embeds the knowledge from both user-trained and multilingual pre-trained models. The proposed method also calculates the profanity word list and augments it. Experimental results on code-mixed hate speech and offensive language detection benchmarks show that our method outperforms the existing baselines.

Abstract

Conventional Automatic Speech Recognition (ASR) systems are susceptible to dialect variations within a language, thereby adversely affecting the ASR. Therefore, the current practice is to use dialect-specific ASRs. However, dialectspecific information or data is hard to obtain making it difficult to build dialect-specific ASRs. Furthermore, it is cumbersome to maintain multiple dialect-specific ASR systems for each language. We build a unified multi-dialect End-to-End ASR that removes the need for a dialect recognition block and the need to maintain multiple dialect-specific ASRs for three Telugu regional dialects: Telangana, Coastal Andhra, and Rayalaseema. We find that pooling the data and training a multi-dialect ASR benefits the low-resource dialect the most – an improvement of over 9.71% in relative Word Error Rate (WER). Subsequently, we experiment with multi-task ASRs where the primary task is to transcribe the audio and the secondary task is to predict the dialect. We do this by adding a Dialect ID to the output targets. Such a model outperforms naive multi-dialect ASRs by up to 8.24% in relative WER. Additionally, we test this model on a dialect recognition task and find that it outperforms strong baselines by 6.14% in accuracy. Index Terms: multi-dialect, speech recognition, sequence-tosequence, dialect recognition

Abstract

Parkinson’s disease (PD) is a speech disorder caused by the effect of neurological damage on motor control activity of speech production. Due to the noninvasive nature, detection of PD from the speech is remarkable. This study proposes the use of Long-Term Average Spectral (LTAS) feature to detect PD from speech using different filterbank techniques and classifiers on the PC-GITA dataset. The fact that PD can be perceived from long-temporal information has motivated us to explore the LTAS features for PD detection. Performance of LTAS features is compared to baseline features, namely statistical and openSMILE features (ComParE, GeMAPS, and eGeMAPS). The performance of these features is validated using five different classifiers. The LTAS features, which are obtained with auditory filterbanks (Constant Q Transform and Gammatone), showed better performance as compared to the statistical features (MFCC_Stat and LPCC_Stat) and openSMILE features (ComParE, GeMAPS, and eGeMAPS). The combination of the Gammatone-based LTAS feature with eGeMAPS further improved the detection accuracy of the PD detection system on the PC-GITA database.

Abstract

Coherence is an important aspect of text quality and is crucial for ensuring its readability. It is essential for outputs from text generation systems like summarization, question answering, machine translation, question generation, table-to-text, etc. An automated coherence scoring model is also helpful in essay scoring or providing writing feedback. A large body of previous work has leveraged entity-based methods, syntactic patterns, discourse relations, and traditional deep learning architectures for text coherence assessment. However, these approaches do not consider factual information present in the documents. The transitions of facts associated with entities across sentences could help capture the essence of textual coherence better. We hypothesize that coherence assessment is a cognitively complex task that requires deeper fact-aware models and can benefit from other related tasks. In this work, we propose a novel deep learning model that fuses document-level information with factual information to improve coherence modeling. We further enhance the model efficacy by training it simultaneously with Natural Language Inference task in multi-task learning setting, taking advantage of inductive transfer between the two tasks. Our experiments with popular benchmark datasets across multiple domains demonstrate that the proposed model achieves state-of-the-art results on a synthetic coherence evaluation task and two real-world tasks involving prediction of varying degrees of coherence.

Abstract

Body shaming, a criticism based on the body’s shape, size, or appearance, has become a dangerous act on social media. With a rise in the reporting of body shaming experiences on the web, automated monitoring of body shaming posts will help rescue individuals, especially adolescents, from the emotional anguish they experience. To the best of our knowledge, this is the first work on body shaming detection, and we contribute the dataset in which the posts are tagged as body shaming or non-body shaming. We use transformer-based language models to detect body shaming posts. Further, we leverage unlabeled data in a semi-supervised manner using the GAN-BERT model, as it was developed for tasks where labeled data is scarce and unlabeled data is abundant. The findings of the experiments reveal that the algorithm learns valuable knowledge from the unlabeled dataset and outperforms many deep learning and conventional machine learning baselines.

Abstract

Pattern mining from graph transactional data (GTD) is an active area of research with applications in the domains of bioinformatics, chemical informatics and social networks. Existing works address the problem of mining frequent subgraphs from GTD. However, the knowledge concerning the coverage aspect of a set of subgraphs is also valuable for improving the performance of several applications. In this regard, we introduce the notion of subgraph coverage patterns (SCPs). Given a GTD, a subgraph coverage pattern is a set of subgraphs subject to relative frequency, coverage and overlap constraints provided by the user. We propose the Subgraph ID-based Flat Transactional (SIFT) framework for the efficient extraction of SCPs from a given GTD. Our performance evaluation using three real datasets demonstrates that our proposed SIFT framework is indeed capable of efficiently extracting SCPs from GTD. Furthermore, we demonstrate the effectiveness of SIFT through a case study in computer-aided drug design.

Abstract

“Rare item problem” is a fundamental problem in pattern mining. It represents the inability of a pattern mining model to discover the knowledge about frequent and rare items in a database. In the literature, researchers advocated the usage of null-invariant measures as they disclose genuine correlations without being influenced by the object co-absence in the database. Since the existing null-invariant measures consider only an item’s frequency and disregard its temporal occurrence information, they are inadequate to address the rare item problem faced by the partial periodic pattern model. This paper proposes a novel null-invariant measure, called relative periodic-support, to find the patterns containing both frequent and rare items in non-uniform temporal databases. We also introduce an efficient pattern-growth algorithm to find all desired patterns in a database. Experimental results demonstrate that our algorithm is efficient.

Abstract

Exposure to ambient Particulate Matter (PM) of air pollution is a leading risk factor for morbidity and mortality. The most common approach for air quality monitoring is to rely on environmental monitoring stations, which are expensive to acquire as well as to maintain. Moreover, such stations are typically sparsely deployed, thereby resulting in limited spatial resolution for measurements. Recently, low-cost air quality sensors have emerged as an alternative for improving the granularity of monitoring. We are making an effort to explore the framework for air quality data collection by employing low-cost sensors. In this paper, we have reported our initial experiences and observations concerning PM data collection for four months starting from October 2021 in the city of Hyderabad in India.

Abstract

Air pollution is a major threat to human health in India. More than three-quarters of the people in India are exposed to pollution levels higher than the limits recommended by the National Ambient Air Quality Standards in India and significantly higher than those recommended by the World Health Organization. Despite the poor air quality, the monitoring of air pollution levels is limited even in large urban areas in India and virtually absent in small towns and rural areas. The lack of data results in a minimal understanding of spatial and temporal patterns of air pollutants at local and regional levels. This paper is the second in a planned series of papers presenting particulate air pollution trends monitored in small cities and towns in India. The findings presented here are important for framing state and regional level policies for addressing air pollution problems in urban areas, and achieve the sustainable development goals (SDGs) linked to public health, reduction in the adverse environmental impact of cities, and adaptation to climate change, as indicated by SDGs 3.9, 11.6 and 11.b.

Abstract

It is a well-established fact in the retail industry that the placement of products on the shelves of the retail store has a significant impact on the revenue of the retailer. Given that customers tend to purchase sets of items together (i.e., itemsets) instead of individual items, it becomes a necessity to strategically place itemsets on the shelves of the retail store for improving retailer revenue. Furthermore, in practice, customers belong to different market segments based on factors such as purchasing power, demographics and customer behaviour. Existing research efforts do not address the issue of market segmentation w.r.t. itemset placement in retail stores. Consequently, they fail to efficiently index, retrieve and place high-utility itemsets in the retail slots in a market segmentation aware manner. In this work, we introduce the problem of market segmentation aware itemset placement for retail stores. Moreover, we propose a market segmentation aware retail itemset placement framework, which takes high-utility itemsets as input. Our performance evaluation with two real datasets demonstrates that our proposed framework is indeed effective in improving retailer revenue w.r.t. existing schemes.