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.

Abstract

Given a coarse satellite image and a fine satellite image of a particular location taken at the same time, the high-resolution spatiotemporal image fusion technique involves understanding the spatial correlation between the pixels of both images and using it to generate a finer image for a given coarse (or test) image taken at a later time. This technique is extensively used for monitoring agricultural land cover, forest cover, etc. The two key issues in this technique are: (i) handling missing pixel data and (ii) improving the prediction accuracy of the fine image generated from the given test coarse image. This paper tackles these two issues by proposing an efficient method consisting of the following three basic steps: (i) imputation of missing pixels using neighborhood information, (ii) cross-scale matching to adjust both the Point Spread Functions Effect (PSF) and geo-registration errors between the course and high-resolution images, and (iii) error-based modulation, which uses pixel-based multiplicative factors and residuals to fix the error caused due to modulation of temporal changes. The experimental results on the real-world satellite imagery datasets demonstrate that the proposed model outperforms the state-of-art by accurately producing the high-resolution satellite images closer to the ground truth.

Abstract

Billboard advertisement is one of the dominant modes of traditional outdoor advertisements. A billboard operator manages the ad slots of a set of billboards. Normally, a user traversal is exposed to multiple billboards. Given a set of billboards, there is an opportunity to improve the revenue of the billboard operator by satisfying the advertising demands of an increased number of clients and ensuring that a user gets exposed to different ads on the billboards during the traversal. In this paper, we propose a framework to improve the revenue of the billboard operator by employing transactional modeling in conjunction with pattern mining. Our main contributions are three-fold. First, we introduce the problem of billboard advertisement allocation for improving the billboard operator revenue. Second, we propose an efficient user trajectory-based transactional framework using coverage pattern mining for improving the revenue of the billboard operator. Third, we conduct a performance study with a real dataset to demonstrate the effectiveness of our proposed framework.

Abstract

No Results Found

Abstract

India Meteorological Department (IMD) has started block-level level agromet advisory (AA) service from the year 2015 and is currently operating in a few blocks of each state across India. In a block-level AA service, on every Tuesday and Friday, AA is being prepared for each block based on the block-level Medium Range weather Forecast (MRF). In this paper, we propose a framework to improve the preparation of block- level AA by modeling a weather situation as “Category-based Weather Condition (CWC)” and exploiting both “temporal reuse” and “spatial reuse” of AA based on the similarity among CWCs. The weather data analysis for 12 blocks of Telangana by considering the phenophase-specific CWCs of Rice crop showed that there is a scope to improve the efficiency of block-level AA bulletin preparation process by exploiting reuse

Abstract

Periodic pattern mining is an emerging technique for knowledge discovery. Most previous approaches have aimed to find only those patterns that exhibit full (or perfect) periodic behavior in databases. Consequently, the existing approaches miss interesting patterns that exhibit partial periodic behavior in a database. With this motivation, this paper proposes a novel model for finding partial periodic patterns that may exist in temporal databases. An efficient pattern-growth algorithm, called Partial Periodic Pattern-growth (3P-growth), is also presented, which can effectively find all desired patterns within a database. Substantial experiments on both real-world and synthetic databases showed that our algorithm is not only efficient in terms of memory and runtime, but is also highly scalable. Finally, the effectiveness of our patterns is demonstrated using two case studies. In the first case study, our model was employed to identify the highly polluted areas in Japan. In the second case study, our model was employed to identify the road segments on which people regularly face traffic congestion.

Abstract

Alongside revenue maximization, retailers seek to offer a diverse range of items to facilitate sustainable revenue generation in the long run. Moreover, customers typically buy sets of items, i.e., itemsets, as opposed to individual items. Therefore, strategic placement of diversified and high-revenue itemsets is a priority for the retailer. Research efforts made towards the extraction and placement of high-revenue itemsets in retail stores do not consider the notion of diversification. Further, candidate itemsets generated using existing utility mining schemes usually explode; which can cause memory and retrieval- time issues. This work makes three key contributions. First, we propose an efficient framework for retrieval of high-revenue itemsets with a varying size and a varying degree of diversification. A higher degree of diversification is indicative of fewer repetitive items in the top-revenue itemsets. Second, we propose the kUI (k Utility Itemset) index for quick and efficient retrieval of diverse top-λ high-revenue itemsets. We also propose the HUDIP (High-Utility and Diversified Itemset Placement) scheme, which exploits our proposed kUI index for placement of high-revenue and diversified itemsets. Third, our extensive performance study with both real and synthetic datasets demonstrates the effectiveness of our proposed HUDIP scheme in efficiently determining high-revenue and diversified itemsets.

Abstract

Billboard advertisement is among the dominant modes of outdoor advertisements. The billboard operator has an opportunity to improve its revenue by satisfying the advertising demands of an increased number of clients by means of exploiting the user trajectory data. Hence, we introduce the problem of billboard advertisement allocation for improving the billboard operator revenue, and propose an efficient user trajectory-based transactional framework using coverage pattern mining. Our experiments validate the effectiveness of our framework.

Abstract

Placement of items on the shelf space of retail stores signifcantly impacts the revenue of the retailer. Given the prevalence and popularity of medium-to-large-size retail stores, several research efforts have been made towards facilitating item/itemset placement in retail stores for improving retailer revenue. However, they do not consider the issue of urgency of sale of individual items. Hence, they cannot efficiently index, retrieve and place high-revenue itemsets in retail store slots in an urgency-aware manner. Our key contributions are two-fold. First, we introduce the notion of urgency for retail itemset placement. Second, we propose the urgency-aware URI index for efficiently retrieving high-revenue and urgent itemsets of different sizes. We discuss the URIP itemset placement scheme, which exploits URI for improving retailer revenue. We also conduct a performance evaluation with two real datasets to demonstrate that URIP is indeed effective in improving retailer revenue w.r.t. existing schemes.

Abstract

Retailer revenue is significantly impacted by item placement in retail stores. Notably, placement of items in the premium slots (i.e., slots with increased visibility/accessibility) improves the probability of sale w.r.t. item placement in non-premium slots. Moreover, customers often tend to buy sets of items (i.e., itemsets) instead of individual purchases. In this paper, we address the problem of maximizing retailer revenue by determining the placement of itemsets in different types of slots with varied premiumness . Our key contributions are as follows. First, we introduce the notion of premiumness of retail slots and discuss the issue of itemset placement in slots with varied premiumness. Second, we propose two efficient schemes, namely P remiumness and R evenue-based I temset P lacement (PRIP) and P remiumness and A verage R evenue-based I temset P lacement (PARIP), for placing itemsets with varying revenue in slots with varied premiumness. Third, we perform a detailed performance analysis using both real and synthetic datasets to showcase the effectiveness of our proposed schemes. We also perform a comprehensive mathematical analysis of our proposed schemes w.r.t. the complexity analysis.