A New Marketing Channel Management Strategy Based on Frequent Subtree Mining
نویسندگان
چکیده
For most manufacturers, success or failure is determined by how effectively and efficiently their products are sold through their marketing channel members, so the management of marketing channels plays an important role in market competition. Most existing work studies the problem of marketing channel management in a qualitative way. Recently, with the increase of amount of sales data, how to enhance the marketing channel quantitatively is significant. As the marketing channel can be viewed as a tree, in this paper, a new marketing channel management strategy based on frequent subtree mining is proposed. The proposed method is illustrated under the real-world sales data in ERDOS group. Firstly, the tree transaction is formed monthly. For each monthly transaction, only those channel members that pass the basic sales plan will be included. Secondly, we use the TreeMiner algorithm to discover embedded frequent subtrees. Finally, different management strategies are used for different kinds of discovered patterns. We show that our method can correspond to the seven decision areas in traditional marketing channel management. INTRODUCTION For most manufacturers, success or failure is determined by how effectively and efficiently their products are sold through their marketing channel members (e.g., agents, wholesalers, distributors, and retailers). Given this situation, considerable marketing channel research has focused on organizational responsibility for managing channel how interrelationships among a firm and its channel members can be managed better (Achrol and Stern 1988; Anderson et al 1997). Recently, our capabilities of both generating and collecting data have been increasing rapidly. The widespread use of bar codes for most commercial products, and the advances in data collection tools have provided us with huge amounts of data. This explosive growth in data and databases has generated an urgent need for new techniques and tools that can intelligently and automatically transform the processed data into useful information and knowledge. In order to relieve such a data rich but information poor plight, during the late 1980s, a new discipline named data mining emerged (Han and Kamber 2006), which devotes itself to extracting knowledge from huge volumes of data, with the help of the ubiquitous modern computing device, i.e., the computer. Most existing work studies the problem of marketing channel management in a qualitative way (Coughlan et al 2005; Pelton et al 2001). Recently, with the increase of amount of sales data, how to enhance the marketing channel quantitatively is significant. As the marketing channel can be viewed as a tree, in this paper, a new marketing channel management strategy based on frequent subtree mining is proposed. The proposed method is illustrated under the real-world sales data in ERDOS group. Firstly, the tree transaction is formed monthly. For each monthly transaction, only those channel members that pass the basic sales plan will be included. Secondly, we use the TreeMiner algorithm to discover embedded frequent subtrees. Finally, different management strategies are used for different kinds of discovered patterns. To the best of our knowledge, it is the first time to exploit the problem of marketing channel management by using frequent subtree mining. So our work is explorative, many details should be enhanced step by step in practice. New Marketing Channel Management Strategy Based on Frequent Subtree Mining Wang & Gao Communications of the IIMA 5
منابع مشابه
PCITMiner- Prefix-based Closed Induced Tree Miner for finding closed induced frequent subtrees
Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of domains. Some of the domains include bio informatics, XML processing, computational linguistics, and web usage mining. Despite the advances in frequent subtree mining, mining for the entire frequent subtrees is infeasible due to the combinatorial explosion of the freq...
متن کاملFrequent Subtree Mining - An Overview
Mining frequent subtrees from databases of labeled trees is a new research field that has many practical applications in areas such as computer networks, Web mining, bioinformatics, XML document mining, etc. These applications share a requirement for the more expressive power of labeled trees to capture the complex relations among data entities. Although frequent subtree mining is a more diffic...
متن کاملEvoMiner: Frequent Subtree Mining in Phylogenetic Databases Technical Report #11-08, Dept. of Computer Science, Iowa State University
The problem of mining collections of trees to identify common patterns, called frequent subtrees (FSTs), arises often when trying to make sense of the results of phylogenetic analysis. FST mining generalizes the well-known maximum agreement subtree problem. Here we present EvoMiner, a new algorithm for mining frequent subtrees in collections of phylogenetic trees. EvoMiner is an Apriori-like le...
متن کاملA New Model for Discovering XML Association Rules from XML Documents
The inherent flexibilities of XML in both structure and semantics makes mining from XML data a complex task with more challenges compared to traditional association rule mining in relational databases. In this paper, we propose a new model for the effective extraction of generalized association rules form a XML document collection. We directly use frequent subtree mining techniques in the disco...
متن کاملDevelop AFramework for Selection of Intermediary in Marketing Channel
This study seeks to examine how a company can select the best intermediary for its Marketing channels with minimum of criteria and time. A theoretical framework is proposed based on the most important tasks of intermediary and the criteria to measure them. There are four basic tasks and thirty criteria in three independent levels. Subsequently, an exploratory case study in Iranian Food industry...
متن کامل