NDLI: A provable algorithmic approach to product selection problems for market entry and sustainability

Please wait, while we are loading the content...

Maintaining a microbial genome & metagenome data analysis system in an academic setting

Offline cleaning of RFID trajectory data

SAGA: array storage as a DB with support for structural aggregations

Data perturbation for outlier detection ensembles

(k, d)-core anonymity: structural anonymization of massive networks

SensorBench: benchmarking approaches to processing wireless sensor network data

PStore: an efficient storage framework for managing scientific data

Geometric graph matching and similarity: a probabilistic approach

A case study in optimizing continuous queries using the magic update technique

DistillFlow: removing redundancy in scientific workflows

Efficient classification of billions of points into complex geographic regions using hierarchical triangular mesh

Skew-resistant parallel in-memory spatial join

Extending the SQL array concept to support scientific analytics

A subspace filter supporting the discovery of small clusters in very noisy datasets

Matching dominance: capture the semantics of dominance for multi-dimensional uncertain objects

Managing evolving shapes in sensor networks

Inverse predictions on continuous models in scientific databases

Schema matching over relations, attributes, and data values

Node classification in uncertain graphs

MR-microT: a MapReduce-based MicroRNA target prediction method

Mining statistically sound co-location patterns at multiple distances

SLACID - sparse linear algebra in a column-oriented in-memory database system

DivIDE: efficient diversification for interactive data exploration

A provable algorithmic approach to product selection problems for market entry and sustainability

Proactive adaptations in sensor network query processing

Helping scientists reconnect their datasets

Point cloud databases

Integrating fault-tolerance and elasticity in a distributed data stream processing system

Integrating non-spatial preferences into spatial location queries

Efficient data management and statistics with zero-copy integration

Local context selection for outlier ranking in graphs with multiple numeric node attributes

Distributed data placement to minimize communication costs via graph partitioning

Boosting the basic counting on distributed streams

Toward efficient and reliable genome analysis using main-memory database systems

Simulation workflow design tailor-made for scientists

Efficient processing of exploratory top-k joins

A system for efficient and simultaneous processing of moving K nearest neighbor and spatial keyword queries

A study of partitioning and parallel UDF execution with the SAP HANA database

Subspace anytime stream clustering

Efficient temporal shortest path queries on evolving social graphs

Data movement in hybrid analytic systems: a case for automation

Protection of sensitive trajectory datasets through spatial and temporal exchange

New approaches to storing and manipulating multi-dimensional sparse arrays

Exploring subspace clustering for recommendations

Data patterns to alleviate the design of scientific workflows exemplified by a bone simulation

Communication-efficient preference top-k monitoring queries via subscriptions

On efficiently generating realistic social media timeline structures

A provable algorithmic approach to product selection problems for market entry and sustainability

Content Provider	ACM Digital Library
Author	Xu, Silei Xie, Hong Lui, John C. S. Lin, Yishi
Abstract	Given the globalized economy, how to process the heterogeneous web data so to extract customers' purchase behavior is crucial to manufacturers who want to enter or sustain in a competitive market. To maximize the sales, manufacturers not only need to decide what products to produce so to meet diverse customers' requirements, but at the same time, compete with competitors' products. In this paper, we present a general framework for the following product selection problems: (1) k-BSP problem, which is for a manufacturer to enter a competitive market, and (2) k-BBP problem, which is for a manufacturer to sustain in a competitive market. We propose several product adoption models to describe the complex purchase behavior of customers, and formally show that these problems are NP-hard in general. To tackle these problems, we propose computationally efficient greedy-based approximation algorithms. Based on the submodularity analysis, we prove that our algorithms can guarantee a (1--1/e)-approximation ratio as compared to the optimal solutions. We perform large scale data analysis to show the efficiency and accuracy of our framework. In our experiments, we observe 1,300 to 250,000 times speedup as compared to the exhaustive algorithms, and our solutions can achieve on average 96% of solution quality as compared to the optimal solutions. Finally, we apply our algorithms on web dataset to show the impact of customers' different purchase behavior on the results of product selection.
Starting Page	1
Ending Page	12
Page Count	12
File Format	PDF
ISBN	9781450327220
DOI	10.1145/2618243.2618250
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2014-06-30
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Market entry Product selection Market sustainability Submodular set function Approximation algorithm
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A Provable Algorithmic Approach to Product Selection Problems for Market Entry and Sustainability

A Provable Algorithmic Approach to Product Selection Problems for Market Entry and Sustainability

Product selection problem: improve market share by learning consumer behavior

Product Selection Problem: Improve Market Share by Learning Consumer Behavior

Approximation algorithms for prize collecting forest problems with submodular penalty functions.

Submodular Function Minimization under Covering Constraints

Maximizing a Monotone Submodular Function Subject to a Matroid Constraint

Submodular meets Spectral: Greedy Algorithms for Sparse Approximation and

Simultaneous approximation of multi-criteria submodular function maximization

A provable algorithmic approach to product selection problems for market entry and sustainability

Similar Documents

A Provable Algorithmic Approach to Product Selection Problems for Market Entry and Sustainability

A Provable Algorithmic Approach to Product Selection Problems for Market Entry and Sustainability

Product selection problem: improve market share by learning consumer behavior

Product Selection Problem: Improve Market Share by Learning Consumer Behavior

Approximation algorithms for prize collecting forest problems with submodular penalty functions.

Submodular Function Minimization under Covering Constraints

Maximizing a Monotone Submodular Function Subject to a Matroid Constraint

Submodular meets Spectral: Greedy Algorithms for Sparse Approximation and

Simultaneous approximation of multi-criteria submodular function maximization

A provable algorithmic approach to product selection problems for market entry and sustainability