Abstract

Product placement in retail has a significant impact on the sales revenue of retailers. Hence, research efforts are being made to improve retailer revenue using high-utility pattern mining based product placement approaches. However, none of these existing approaches has explored generalized high-utility itemset mining for determining product placement in retail. The knowledge of generalized high-utility itemsets extracted from user purchase transactional database in conjunction with a product taxonomy can provide new insights about customer purchase behaviour. This work proposes the generalized utility itemset (GUI) index for retrieving generalized high-utility (revenue) itemsets. We also present a framework, which leverages the GUI index towards retail product placement to improve revenue. Our performance study using real datasets shows the effectiveness of our proposed scheme w.r.t. two existing …

Abstract

Utility mining has been emerging as an important area in data mining. While existing works on utility mining for retail businesses have primarily focused on the problem of finding high-utility itemsets from transactional databases, they implicitly assume that each item occupies only one slot. Here, the slot size of a given item is the number of (integer) slots occupied by that item on the retail store shelves. However, in many real-world scenarios, the number of slots consumed by different items typically varies. Hence, this paper considers that a given item may physically occupy any fixed (integer) number of slots. Thus, we address the problem of efficiently determining the top-utility itemsets when a given number of slots is specified as input. The key contributions of our work are three fold. First, we present an efficient framework to determine the top-utility itemsets for different user-specified number of slots that need to be …

Abstract

Periodic-frequent pattern mining is a challenging problem of great importance in many applications. Most previous works focused on finding these patterns in binary temporal databases and did not take into account the quantities of items within the data. This paper proposes a novel model of fuzzy periodic-frequent pattern (FPFP) that may exist in a quantitative temporal database (QTD). Finding FPFPs in QTD is a non-trivial and challenging task due to its huge search space. A novel pruning technique, called improved maximum scalar cardinality, has been introduced to effectively reduce the search space and the computational cost of finding the desired itemsets. This technique facilitates the mining of FPFPs in real-world very large databases practicable. An efficient algorithm has also been presented to find all FPFPs in a QTD. Experimental results demonstrate that the proposed algorithm is efficient. We also …

Abstract

The problem of bound entanglement detection is a challenging aspect of quantum information theory for higher dimensional systems. Here, we propose an indecomposable positive map for two-qutrit systems, which is shown to generate a class of positive partial transposed (PPT) states. A corresponding witness operator is constructed and shown to be weakly optimal and locally implementable. Further, we perform a structural physical approximation of the indecomposable map to make it a completely positive one, and find a new PPT entangled state which is not detectable by certain other well-known entanglement detection criteria.

Abstract

We propose an improved framework for document representation using word embeddings. The existing models represent the document as a position vector in the same word embedding space. As a result, they are unable to capture the multiple aspects as well as the broad context in the document. Also, due to their low representational power, existing approaches perform poorly at document classification. Furthermore, the document vectors obtained using such methods have uninterpretable features. In this paper, we propose an improved document representation framework which captures multiple aspects of the document with interpretable features. In this framework, a document is represented in a different feature space by representing each dimension with a potential feature word with relatively high discriminating power. A given document is modeled as the distances between the feature words and the …

Abstract

With progress in quantum technologies, the field of quantum networks has emerged as an important area of research. In the last few years, there has been substantial progress in understanding the correlations present in quantum networks. In this article, we study cloning as a prospective method to generate three party quantum networks which can be further used to create larger networks. We analyze various quantum network topologies that can be created using cloning transformations. This would be useful in the situations wherever the availability of entangled pairs is limited. In addition to that we focus on the problem of distinguishing networks created by cloning from those which are created by distributing independently generated entangled pairs. We find that there are several states which cannot be distinguished using the Finner inequalities in the standard way. For such states, we propose an extension to the existing Finner inequality for triangle networks by further increasing the number of observers from three to four or six depending on the network topology. This takes into account the additional correlations that exist in the case of cloned networks. In the last part of the article we have used tripartite mutual information to distinguish cloned networks from networks created by independent sources and have further used squashed entanglement as a measure to quantify the amount of dependence in the cloned networks

Abstract

We present a decentralized motion planning and collision avoidance algorithm for multi-robot payload transport systems (PTS). A PTS is a formation of loosely coupled non-holonomic robots that cooperatively transport a deformable payload. Each PTS is constrained to navigate safely in a dynamic environment by inter-formation, environmental, and intra-formation collision avoidance. Real-time collision avoidance for such systems is challenging due to the deformability of formations and high dimensional multi-robot non-convex workspace. We resolve the above challenges by embedding workspaces defined by a multi-robot collision avoidance algorithm and multi-scale repulsive potential fields as constraints within a decentralized convex optimization problem. Specifically, we present two main steps to plan the motion of each formation. First, we compute collision-free multi-scale convex workspaces over a planning

Abstract

Conformance checking of treatment plans in discharge summary data would facilitate the development of clinical decision support system, treatment plan quality assurance, and new treatment plan discovery. Conformance checking requires extraction of medical entities and relationships among them to form a computable representation of the treatment plan present in the discharge summary. We propose a workflow representation of patient’s discharge summary that is referred to as workflow instance. We employ a multi-layer perceptron neural network to extract relationships between medical entities to construct the workflow instance. The aim of this work is to check the conformance of the workflow instance against standard treatment plan. Standard treatment plans are extracted from the treatment guidelines provided on healthcare websites such as WebMD, Mayo Clinic, and Johns Hopkins. For each disease …

Abstract

Anatomical variabilities seen in longitudinal data or inter-subject data is usually described by the underlying deformation, captured by non-rigid registration of these images. Stationary Velocity Field (SVF) based non-rigid registration algorithms are widely used for registration. SVF based methods form a metric-free framework which captures a finite dimensional submanifold of deformations embedded in the infinite dimensional smooth manifold of diffeomorphisms. However, these methods cover only a limited degree of deformations. In this paper, we address this limitation and define an approximate metric space for the manifold of diffeomorphisms . We propose a method to break down the large deformation into finite compositions of small deformations. This results in a broken geodesic path on and its length now forms an approximate registration metric. We illustrate the method using a simple, intensity-based, log-demon implementation. Validation results of the proposed method show that it can capture large and complex deformations while producing qualitatively better results than the state-of-the-art methods. The results also demonstrate that the proposed registration metric is a good indicator of the degree of deformation.

Abstract

Disease diagnosis often requires segmentation of structures from a given image followed by shape analysis. Shape analysis entails quantifying the variability in a shape by constructing a template for a given population. We propose an orientation-invariant representation using varifolds for the shape elements in a given shape population and present a novel diffeomorphic Log-demons based template creation pipeline. The proposed method generates a good quality template at a significantly less computation time compared to state of the art method.