Abstract

Customer support is an essential part of any company to ensure customer satisfaction and business growth. The responsibility and scale get even higher for enterprise companies like Freshworks that build customer support platforms for its enterprise customers from multiple and previously unseen domains. A ticket may carry issues never seen before, therefore static, and predefined problem labels will not always work. These predefined problem labels are often created manually by admins. For a large customer account, roughly 10-35% of the problem labels could get discovered by this manual process and only 5-9% of the available open tickets could get linked to a problem label. So, there is a need for a system for a new incoming ticket. The system should either automatically detect an existing problem topic with its possible suggestions or systematically generate new problem topic(s) for its assignment. Our system is based on an incremental approach to mine ticket data streams and assigns them to hierarchical soft clusters with auto-generated problem/issue topics. Our system achieves an improvement in ticket assignments up to 97%. To compare with recent clustering advancements, we’ve also evaluated our approach on a public dataset [9] and achieved comparable results. Source code and results of the evaluation are available in detail at: https://github.com/vinidixit/hierarchical-labelled-clustering-evaluation.

Abstract

Deployment of Accident Relief Medical Vans (ARMV) used for accident relief and rescue operations is generally done heuristically. ARMV is an ambulance-train equipped with various tools like jacks, heavy cutting tools, generators, operation theatre, artificial breathing equipment etc. to ease the rescue process. Taking North Eastern Railway (NER) as a case study, Location Set Covering Problem (LSCP) model will be used to find the minimum number of ARMVs required for the given network and their locations so that all demand points can be ‘covered’ within a maximum of one hour @ 100 kmph for each of the nearest facility. This paper proposes a new mathematical model based on the Cluster Coverage Model (CCM) to provide a better coverage of ARMV’s demands. We have used Girvan-Newman (GN) algorithm, a weight-based graph for clustering of NER network where nodes are taken as depots with ARMV parking facilities & crew availability and distance between these nodes is taken as edge weight of the graph. Finally, we present a comparison of results between the proposed cluster coverage models with LSCP and suggest relocations of the existing ARMVs

Abstract

The sudden shift to online education due to the pandemic has led to widespread learning gaps in the student population, increasing the need for individualistic attention to student learning as we transition back to physical classrooms. One can take advantage of the advancements in technology to help in this process by developing tools that can assist teachers decrease the amount of administrative workload and improve their ability to track the learning and understanding of every student in the classroom. The current work proposes a framework for accurate, low-cost, and scalable computer visionbased attendance and attention tracking in physical classroom environment to tackle this problem

Abstract

Premenstrual syndrome (PMS) and premenstrual dysphoric disorder (PMDD) are medically unexplained disorders that occur with somatic or psychiatric symptoms presenting during the luteal phase of the menstrual cycle, ending within a few days after the onset of menstruation. Worldwide, the prevalence of PMS is remarkably high, and its causes are still unclear and are multifactorial. This chapter aims to understand better the etiopathogenesis, clinical features, diagnosis, contemporary, and integrative holistic approaches of PMS management. A thorough literature survey from various scientific databases such as Web of Science, ScienceDirect, PubMed, Google Scholar, Scopus, and other databases was retrieved for the

Abstract

Generating domain-specific content such as legal clauses based on minimal user-provided information can be of significant benefit in automating legal contract generation. In this paper, we propose a controllable graph-based mechanism that can generate legal clauses using only the topic or type of the legal clauses. Our pipeline consists of two stages involving a graph-based planner followed by a clause generator. The planner outlines the content of a legal clause as a sequence of keywords in the order of generic to more specific clause information based on the input topic using a controllable graph-based mechanism. The generation stage takes in a given plan and generates a clause. The pipeline consists of a graph-based planner followed by text generation. We illustrate the effectiveness of our proposed two-stage approach on a broad set of clause topics in contracts.

Abstract

Non-Fungible Tokens (NFTs) are a relatively unexplored class of assets. Designing strategies to forecast NFT trends is an intricate task due to its extremely volatile nature. The market is largely driven by public sentiment and "hype", which in turn has a high correlation with conversations taking place on social media platforms like Twitter. Prior work done for modelling stock market data does not take into account the extent of impact certain highly influential tweets and their authors can have on the market. Building on these limitations and the nature of the NFT market, we propose a novel reachaware temporal learning approach to make predictions for forecasting future trends in the NFT market. We perform experiments on a new dataset consisting of over 1.3 million tweets and 180 thousand NFT transactions spanning over 15 NFT collections curated by us. Our model (TA-NFT) outperforms other state-ofthe-art methods by an average of 36%. Through extensive quantitative and ablative analysis, we demonstrate the ability of our approach as a practical method for predicting NFT trends.

Abstract

Evaluation in machine learning is usually informed by past choices, for example which datasets or metrics to use. This standardization enables the comparison on equal footing using leaderboards, but the evaluation choices become sub-optimal as better alternatives arise. This problem is especially pertinent in natural language generation which requires everimproving suites of datasets, metrics, and human evaluation to make definitive claims. To make following best model evaluation practices easier, we introduce GEMv2. The new version of the Generation, Evaluation, and Metrics Benchmark introduces a modular infrastructure for dataset, model, and metric developers to benefit from each others work. GEMv2 supports 40 documented datasets in 51 languages. Models for all datasets can be evaluated online and our interactive data card creation and rendering tools make it easier to add new datasets to the living benchmark.

Abstract

Decay heat removal(DHR) system plays a crucial role in maintaining the reactor safety with the ultimate cooling arrangement in case all the other intended systems are unavailable. As a special case, the system shall also ensure that the reactor is not overcooled so that the coolant is not frozen. In this regard, a passive device is to be developed to meet the requirement of monitoring DHR system temperature. Toward this, a self-sustained instrument has been designed and tested with all the necessary compensation and calibration for the entire reactor life. This paper explains the design of such a sensor and its future scope.

Abstract

India Meteorological Department (IMD) is delivering agromet advisories, i.e., weather-based crop risk management advisories based on the medium-range weather forecast (five days) across India. Based on the weather prediction, once in five days, agromet advisory is provided for major crops and livestock by considering the district/block as a unit. In the literature, a framework was proposed to improve the process of advisory preparation by employing the notion of reuse. In that framework, an approach was explored to reuse the advisory prepared for the given weather situation to prepare advisory for similar weather situations in the future. For this, a notion of category-based weather condition (CWC) was proposed to model a given

Abstract

A limiting factor for readout fidelity for superconducting qubits is the relaxation of the qubit to the ground state before the time needed for the resonator to reach its final target state. A technique known as excited state promoted (ESP) readout was proposed to reduce this effect and further improve the readout contrast on superconducting hardware. In this work, we use readout data from IBM’s five-qubit quantum systems to measure the effectiveness of using deep neural networks, like feedforward neural networks, and various classification algorithms, like knearest neighbors, decision trees, and Gaussian naive Bayes, for single-qubit and multi-qubit discrimination. These methods were compared to standardly used linear and quadratic discriminant analysis algorithms based on their qubit-state-assignment fidelity performance, robustness to readout crosstalk, and training time. Index Terms—Quantum Computing, Qubit Readout, Machine Learning, Deep Learning