Abstract

No Results Found

Abstract

Current algorithms for Maximal Frequent Subgraph (MFS) mining do not scale to large databases with more than 300k graphs. Frequency computation is commonly done using numerous subgraph isomorphism operations, which are computationally expensive. This paper explores a partition-based secondary memory algorithm, PMCS, that can make MFS mining for large databases viable. PMCS intelligently avoids redundant computations to perform frequency computation operations optimally. Its intermediate results are also small enough to fit in the main memory. Our results demonstrate that PMCS scales to databases of up to 1000k graphs with an average of 25-30 edges per graph.

Abstract

In a given 2D space, we can have points with different levels of importance. One would prefer viewing those points from a closer/farther position per their level of importance. A point in 2D from where the user can view two given points per his/her preference of distance is termed a scenic point. We develop the concept of scenic paths in a 2D space for two points that have weights associated with them. Subsequently, we propose algorithms to generate scenic routes a traveler can take, which cater to certain principles which define the scenic routes. Following are the contributions of this paper: (1) mathematical formulation of a scenic point, (2) introduction of scenic routes formed by such scenic points in two-class point configurations in 2D spaces, and (3) design of scenic route generation algorithms that fulfill certain defined requirements.

Abstract

Consider a 2D coordinate space with a set of red and a set of blue points. We define a scenic point as a point that is equidistant to a red point and a blue point. The set of contiguous scenic points form a scenic path. The perpendicular bisectors to the line joining a red point and a blue point forms a scenic path between the red point and the blue point. A scenic route is a traversal made from scenic paths. In this paper, we address this novel problem by (i) designing algorithms for scenic route generation, (ii) studying the algorithms different properties and (iii) analyzing the routes generated by these algorithms. Scenic routes have applications in geo-spatial visualizations and visual analytics

Abstract

The Securities and Exchange Board of India is the regulatory body for securities and commodity market in India. A growing number of SEBI documents ranging from government regulations to legal case files are now available in the digital form. Advances in natural language processing and machine learning provide opportunities for extracting semantic insights from these documents. We present here a system that performs semantic processing of SEBI documents using state-of-the-art language models to produce enriched regulations containing timelines of amendments and cross references to legal case files.

Abstract

High dimensional data is often challenging to cluster due to the curse of dimensionality leading to challenges in identifying clusters. The key challenge in high dimensional clustering is to develop a solution that identifies clusters which are as complete as they can be, while not merging well-separated clusters. We propose core points which represent local compact regions. The strongly connected component from the k-nearest neighbor graph of core points provides for a group of points that are strongly mutually connected. These mutually connected regions represent the core structure of the clusters. Our empirical analysis and experimental results present the rationale behind our solution and validate the goodness of the clusters against the state of the art high dimensional clustering algorithms.The novelty of our solution is to use the concept of reverse nearest neighbors to generate natural clusters in high dimensions.

Abstract

Observational evidence in clinical practice is critical in healthcare and policy making. Researchers spend a lot of time searching for relevant published articles to write a systematic review of a topic. In this paper, we present our participation as the team of IIIT Hyderabad at Task2 Technologically Assisted Reviews in Empirical Medicine as an effort to automate this task and deliver relevant information in medical literature. We base our approach on query expansion according to relevance feedback. Query expansion is a standard technique in information retrieval tasks with growing use in medical literature [1, 2]. Articles returned from pubmed query performed during a systematic review are first indexed using lucene’s inverted index. The query is porcessed for term boosting, fuzzy search and used for scoring documents according to TF-IDF similarity. Relevance feedback is used to update the query and become more pragmatic.