Patent Application
20170140403
The present invention relates to a technique for analyzing a purchasing preference type of customers for merchandise.
In recent years, attention is paid to a technique for analyzing a purchasing preference type of customers in a retail industry. Specifically, a purchasing trend of the customers is analyzed on the basis of a purchasing history of the customers (for example, an access history in the case of purchasing on the Web), and a merchandise matching the preference of individual customers is recommended, or an analysis result of the customer purchasing preference for each store is leveraged in store merchandising.
As a data analysis technique for extracting the merchandise matching the preference of each individual when recommending the merchandise, a collaborative filtering technique disclosed in the following Nonpatent Literature 1 has been widely used. The collaborative filtering is directed to a technique for extracting the merchandise that has been purchased by another customer similar in the purchasing trend to a subject customer but has not been purchased by the subject customer.
The following Patent Literature 1 discloses a technique in which information indicating the content of each merchandise is allocated to the merchandise as a merchandise product attribute, and the merchandise linked with the attribute likely to be purchased is recommended. The literature has proposed a technique in which, for the purpose of providing highly effective information compatible with a user, the merchandise attribute allocated to the merchandise is linked with a type of the customers who purchase the attribute to increase information on both of the customers and the merchandises. More specifically, the merchandise strongly linked with the type to which the individual belongs is extracted as the merchandise matching the preference of the individual, and type information on each customer is presented as a reason to purchase that merchandise.
The following Patent Literature 2 discloses a technique for analyzing purchase psychological factors such as purchasing motivations and intentions of consumers or customers for the purpose of helping to consider a merchandise planning or a service to be provided. In the literature, the customers' purchase psychological factors are quantitatively analyzed by the quantitative analysis of questionnaire although the purchasing history is not used. As a result, it is conceivable to help to grasp the purchasing trend of the customers, and extract a potential customer segment.
Patent Literature 1: Japanese Unexamined Patent Application Publication No. 2012-234503
Patent Literature 2: Japanese Unexamined Patent Application Publication No. 2008-299684
Nonpatent Literature 1: Amazon.com Recommendations: Item-to-Item Collaborative Filtering”, Greg Linden, Brent Smith, Jeremy York, Journal IEEE Internet Computing 7, 1, pp. 76-80, 2003.
For example, in order to implement such as store merchandising, new merchandise development, or a message created with appeal at the time of recommendation, there is a need to understand not only the merchandise likely to be purchased by the customer, but also why the customer purchases the merchandise, i.e. it is necessary to understand where customers' needs exist. Therefore, in order to provide the merchandise and service which are the customer's needs in the retail industry, the following two requirements are demanded.
(Requirement 1) A merchandise group corresponding to (likely to be merchandised by) the individual or the customer segment is extracted with high precision.
(Requirement 2) A psychological factor of the purchase (reason to purchase) which stays in the background of an extracted correspondence relationship of the customers and the merchandise group can be interpreted by a business person in charge.
In Patent Literature 1, the merchandise extraction demanded in Requirement 1 can be performed, but the merchandise reason demanded in Requirement 2 is difficult to presume. On the contrary, Patent Literature 2 can not only recommend the merchandise but also provide the recommendation reason corresponding to a type of each customer. The type of the customer includes: customer information allocated from information on sex and age other than the merchandise; and information indicative of a purchasing preference such as an upmarket. The psychological factor of the purchase such as the purchasing motivation and intention of the customer can be grasped from the type (purchasing preference type) related to the preference as described in the latter. With the use of the purchasing preference type, not only the effective information to promote the purchase depending on the individual in the merchandise recommendation can be provided, but also the purchasing preference type can be effectively leveraged even in a merchandising business such as needs grasp for new merchandises and an appropriate assortment in a store.
Before the preference type of each customer is estimated, it is necessary to extract the merchandise feature in advance, allocate the merchandise feature as the merchandise attribute, and define the purchasing preference type of the customer corresponding to the merchandise attribute. The purchasing preference type of each customer is estimated by analyzing the merchandising history of the customer according to the definition of the purchasing preference type. As a result, the purchasing reason staying in the background of the purchasing history can be estimated.
Up to now, the purchasing preference type has been designed through a trial-and-error process by allowing the business person in charge to repeat the try and error. However, because such a process depends on the experience and intuition of the business person in charge, a working man-hour is long, and no transparency is guaranteed. In addition, when the purchasing preference type of the consumer and a linkage between the purchasing preference type and the merchandise attribute are changed in association with a temporal change in a social climate and personal values, the business person in charge is required to redesign the purchasing preference type. Therefore, it is not desirable to design the purchasing preference type through the technique depending on the experience and the intuition of the business person in charge.
On the other hand, a task of designing the purchasing preference type can be regarded as a task of deviating the merchandise feature corresponding to the customer segment from the viewpoint of the psychological factor of the purchase in the marketing. Therefore, it is conceivable that the purchasing preference type can be designed through a quantitative marketing analysis technique not depending on the intuition and the experience disclosed in Patent Literature 2. However, such a technique causes a problem that a labor of the questionnaire per se is heavy. Also, because it is difficult to continuously implement the questionnaire, it is difficult to follow the temporal change.
As described above, in order to extract the merchandise group corresponding to the individual or customer segment with high precision without excessively impairing the interpretation of the psychological factor of the purchasing, it is effective to design abstractions related to the psychological factor of the purchasing such as the merchandise attribute and the purchasing preference type, and a correspondence relationship between those respective abstractions in advance. However, the conventional manual design and the conventional design using the questionnaires are limited, and a purchasing preference type design technique capable of continuously updating the design without depending on the experience and the intuition is demanded.
The present invention has been made in view of the above problems, and it is an object of the present invention to provide a technique of helping to quantitatively evaluate a purchasing preference of customers, and design the purchasing preference high in the degree of matching with an actual merchandise purchasing history.
The customer analysis system according to the present invention calculates the degree of matching indicative of how much a purchasing preference type of a customer matches a merchandise group in a correspondence relationship on the basis of a merchandise purchasing history of the customer, and evaluates the purchasing preference type on the basis of the calculation result.
The customer analysis system according to the present invention can design the purchasing preference type that matches the merchandise purchasing history of the customer with high precision.
A customer layer 110 is a layer having customer nodes 111 corresponding to the respective customers. A preference type layer 120 is one layer below the customer layer 110, which represents a purchasing preference type of each customer. Preference type nodes 121 are nodes in the preference type layer 120, and correspond to the respective purchasing preference types. Each purchasing preference type means a merchandise purchasing trend of the customer which can be estimated from the merchandises purchased by the customer. For example, the purchasing preference types include a “health trend type” that means a purchasing trend for preferably purchasing a health food, a “fond of sale type” that means a trend for being likely to purchase only discount merchandises, and a “fond of new merchandise type” that means a trend for frequently merchandising merchandises just released. Paths 151 are paths that represent a correspondence relationship between the customer nodes 111 and the preference type nodes 121. The preference types of the respective customers are associated with the customers by the paths 151. One customer may be linked to the multiple preference types such as “fond of new merchandise type” and “health trend type”, and a customer may be linked to none of the preference types.
A merchandise attribute layer 130 is a layer corresponding to the attributes of the merchandises, and has merchandise attribute nodes 131. The merchandise attribute means a feature of the merchandise which may cause the customer's purchase activity to be promoted or inhibited. For example, the feature includes “calorie off”, “low cost”, “discount”, and “new merchandise”. Paths 152 are paths between the preference type nodes 121 and the merchandise attribute nodes 131 and mean a correspondence relationship between the respective merchandise attributes and the preference types. For example, when there is a positive linkage between the merchandise attribute “calorie off” and the preference type “health trend type”, the customer belonging to the health trend type is likely to purchase the calorie-off merchandise. Likewise, a negative linkage can also be defined. For example, when the merchandise attribute “carcinogen” and the preference type “health trend type” are negatively linked to each other, such a linkage means that the customer belonging to the health trend type is unlikely to purchase the merchandise having a carcinogen. One merchandise attribute node 131 may be linked to the multiple preference type nodes 121, and the multiple merchandise attribute nodes 131 may be linked to one preference type node 121. For example, when the merchandise attributes “calorie off” and “dietary fiber” are positively linked to the health trend type, such a case is interpreted as “the health trend type is likely to purchase the merchandise associated with the calorie off or the dietary fiber (OR relationship)”, or “the health trend type is likely to purchase the merchandise associated with the calorie off and the dietary fiber (AND relationship)”. The difference of those interpretations will be described later.
A merchandise layer 140 is a layer corresponding to the merchandises and has merchandise nodes 141. Paths 153 are paths between the merchandise attribute nodes 131 and the merchandise nodes 141, and means a correspondence relationship between the merchandise nodes 141 and the merchandise attribute nodes 131. When the path 153 is provided to the merchandise, the merchandise has a property of the associated merchandise attribute node 131. One merchandise node 141 may be linked to the multiple merchandise attribute nodes 131, and the merchandise nodes 141 may be linked to none of the merchandise attribute nodes 131.
The customer nodes 111 and the merchandise nodes 141 are nodes in which there is an entity, and the preference type nodes 121 and the merchandise attribute nodes 131 are nodes representing an abstraction for interpreting a psychological factor of the purchase. The preference type layer 120 is a layer for describing the customer, and the merchandise attribute layer 130 are layers for describing the merchandises. The layer for describing the merchandise can be configured by multiple hierarchies. For example, the layer for describing the merchandise may be hierarchized into two layers as a merchandise attribute (coarse classification) and a merchandise attribute (fine classification). The preference type layer 120 may conceptually have a hierarchical structure on the assumption that a geriatric prevention type, a diet type, a skin care type, and so on are present below the health trend type, for example. However, the hierarchy is not set on the preference type graph used in evaluating the design of the preference type.
In the correspondence relationship between the layers for describing the merchandise, the layers are linked to each other by a positive path or no path is present. Even when the multiple paths are linked to the merchandise attribute nodes 131 from a lower layer, only any one of those paths is effective.
The correspondence relationships between the layer for describing the consumer and the layer for describing the merchandise include three types, i.e. a positive path, a negative path, and no linkage. Multiple paths may extend to a certain node from the lower layer. The relationship between the multiple paths toward a same node may be an AND relationship or an OR relationship. Whether the relationship is the AND relationship or the OR relationship is defined on the preference type graph.
It is assumed that a path on the preference type graph occurs only between the two layers, and does not go across the layer. When the correspondence relationship that the path goes across the layer is present in designing the preference type, a dummy node is added to the concept layer as a path between the two layers. For example, it is assumed that: there are two layers for describing the merchandise; a merchandise coarse classification node and a new-merchandise node are present in a first layer; a merchandise fine classification node is present in a second layer below the first layer. Because the new-merchandise node in the first layer is included in the merchandise coarse classification node, there is a possibility that there is no merchandise fine classification node linked to the new-merchandise node. In that case, the dummy node having the correspondence relationship with the new-merchandise node is created in the second layer, thereby being capable of linking a layer below the second layer to the new-merchandise node.
To design the purchasing preference type is to define the preference type nodes 121, the merchandise attribute nodes 131, and the merchandise nodes 141, and also to define the paths 151 to 153 between those nodes. The business person in charge designs the other nodes and paths on the assumption of the preference type nodes 121 provisionally designed, at the time of first designing those nodes.
The customer analysis system according to the present invention estimates a purchasing preference type that represents an actual merchandise purchasing history with high precision with the use of the merchandise purchasing history of the customer. For example, the customer analysis system extracts a group of the merchandise nodes 141 purchased by a certain customer and the associated purchasing preference type in the actual merchandise purchasing history on the basis of a graph structure designed by the business person in charge, thereby estimating the path 151 between the customer nodes 111 and the preference type node 121. The node used in estimating the purchasing preference type is associated with the merchandise purchasing history, and is not limited to the merchandise nodes 141. For example, the merchandise purchasing history uses a node indicative of a purchasing time instead of the merchandise nodes 141, and the purchasing preference type associated with the purchasing time may be defined such as “midnight purchasing type” as the purchasing preference type.
A node 201 is an example of the node deleted by the customer analysis system. When it is determined that the preference type designed by the business person in charge does not appropriately express the customer segment for purchasing the target merchandise group linked to the preference type, the preference type can be deleted. With the deletion of the node 201, the path linked to the node is also deleted. A node 202 is a preference type in which the number of paths from the merchandise attribute layer 130 is increased more than that before update. Paths 205 are paths added to the node 202. A node 204 is a merchandise attribute node newly added according to a change in the preference type graph. A path 203 is a path changed between the customer layer 110 and the preference type layer 120 according to a change in the preference type graph.
As illustrated in
The customer analysis device 300 receives initial design data 301 and update instruction data 303, and outputs update draft data 302. The initial design data 301 is data describing the preference type graph initially designed by the business person in charge and the preference type graph illustrated in
The initial design data 301 is data describing initial design values of each node and each path of a solid-line type graph illustrated in
The design data 310 is data describing the preference type graph in a format easily processed by the customer analysis device 300. Relationship matrix data 311 describes the respective nodes and the connection relationships between the respective nodes on the preference type graph. The details of the relationship matrix data 311 will be described with reference to
A preference type estimator 320 receives the design data 310 and purchasing history data 381 and outputs preference type specific relationship data 382. The purchasing history data 381 is data describing purchase histories of merchandises by each individual. The preference type specific relationship data 382 is data describing whether or not each customer belongs to each preference type node 121 and each node located below the preference type node 121.
The preference type estimator 320 estimates to which purchasing preference type each individual belongs, and describes the estimation result in the preference type specific relationship data 382. Specifically, the preference type estimator 320 calculates the number of purchases (or purchasing rate) of the merchandise linked to each merchandise attribute node 131 and each preference type node 121 from the merchandises purchased by the individual. If the calculated number of merchandises exceeds a reference value, the preference type estimator 320 associates the customer nodes 111 with the preference type nodes 121 using a positive path. If the calculated number of merchandises falls below the reference value, the preference type estimator 320 associates the customer nodes 111 with the preference type nodes 121 using a negative path. The reference value may be determined by the business person in charge in advance, or may be calculated taking an overall average or a standard deviation into consideration.
The result of estimating the customer nodes 111 belonging to each preference type node 121 by the preference type estimator 320 is used when an evaluator 330 calculates a customer matching degree list 342 to be described later. Further, a display 360 and an updater 370 are used to calculate estimated values of the number of customers and the number of merchandises belonging to each preference type when the preference type graph is changed. A method of estimating the number of customers and the number of merchandises after the preference type graph has been changed is the same as when the preference type is evaluated. The number of customers and the number of merchandises can be estimated on the basis of only the correspondence relationship between the target node and the preference type without taking a layer above the subject layer into consideration. For example, the analysis is not implemented on all of the layers described by the preference type specific relationship data 382, but only the preference type layer 120 and the merchandise attribute layer 130 may be estimated.
The evaluator 330 evaluates how much the correspondence relationship between the customer segment and the merchandise group derived from the preference type graph described by the initial design data 301 match the correspondence relationship estimated from the purchasing history data 381. The evaluator 330 outputs an update (path change/node division/node integration, or the like) draft of the preference type graph that more approaches the actual correspondence relationship estimated from the purchasing history data 381 on the basis of the evaluation result. The evaluator 330 receives the design data 310, the preference type specific relationship data 382, and the purchasing history data 381, and outputs an evaluation value 340, update version relationship matrix data 351, and update history data 352. When the preference type graph is to be further updated after outputting the update version relationship matrix data 351 and the update history data 352, the updater 370 may implement the processing with the use of only the final update result or may implement the processing every time the update version relationship matrix data 351 and the update history data 352 are updated.
The evaluator 330 includes a merchandise matching degree analysis unit 331, a customer matching degree analysis unit 332, a division analysis unit 333, an integration analysis unit 334, an update instruction matrix data 335, and an update unit 336.
The merchandise matching degree analysis unit 331 outputs a merchandise matching degree vector 341. The customer matching degree analysis unit 332 outputs the customer matching degree list 342. The division analysis unit 333 outputs a concurrent selling rate matrix 343. The specific calculation method will be described later. The integration analysis unit 334 receives the merchandise matching degree vector 341. The division analysis unit 333 receives the concurrent selling rate matrix 343. The merchandise matching degree analysis unit 331, the customer matching degree analysis unit 332, the division analysis unit 333, and the integration analysis unit 334 outputs the update instruction matrix data 335 as an update draft of the preference type graph on the basis of the evaluation value 340.
The update unit 336 receives the update instruction matrix data 335 outputted by the merchandise matching degree analysis unit 331, the customer matching degree analysis unit 332, the division analysis unit 333, and the integration analysis unit 334, and outputs the update version relationship matrix data 351 describing the update draft of the preference type graph and the update history data 352 describing the update history. When updating the preference type graph, the update unit 336 makes consideration so that a change in one portion of the graph avoids as much influence on the other portion of the graph as possible. The specific technique will be described later.
The display 360 instructs the evaluator 330 to analyze the preference type graph. Also, the display 360 presents the evaluation result caused by the evaluator 330 to the business person in charge. Further, the display 360 presents the evaluation result caused by the evaluator 330 to the business person in charge. Further, the display 360 receives an update instruction (update instruction data 303) from the business person in charge and instructs the evaluator 330 to update the preference type graph. The display 360 receives the update instruction related to the AND relationship and the OR relationship between the multiple paths on the preference type graph from the business person in charge, and outputs the update instruction as an update version AND pair list 353.
The display 360 interactively presents a function for designing the purchasing preference type. Specifically, the display 360 (a) presents an update draft of the preference type graph, (b) presents an improvement rate of a certainty of the preference type graph after updating or a certainty before and after the updating, and (c) presents the update history to the preference type graph after updating from the preference type graph before updating. As a result, the display 360 can help the update to the probable preference type graph. In addition, the display 360 presents a feature of a portion common to a change portion of the preference type graph before and after updating to the business person in charge, as a result of which the business person in charge helps to interpret the preference type after updating.
The updater 370 receives update parameter 350, updates the preference type graph, and overwrites and stores the update result in the preference type specific relationship data 382. In addition, the updater 370 extracts a feature change in the preference type between before and after updating, and outputs the extracted feature change as a post-update feature list 383. The details of the post-update feature list 383 will be described later.
In the connection relationship between the nodes in the same layer, a connection to the subject node is represented as the positive path, and no path to the nodes other than the subject node in the same layer is present. The connection relationship between the layers apart by two or more layers is represented as the connection relationship through a middle layer. A case where no path going through the middle layer is present is set as 0, and a case where a path going through the middle layer is present is set as 1. For example, the preference type node 2-1 and the merchandise node 4-2 are connected to each other through the positive paths in the merchandise attribute layer 130 and the preference type layer 120. A same node may be connected to both of the positive path and the negative path depending on the preference type graph. In such a case, multiple values are described in the cell. Hereinafter, a cell value representative of the connection relationship between the nodes may be called “relationship flag”.
Steps S501 to S504 can be performed, independently (that is, each data of the evaluation value 340 can be calculated, independently). Therefore, only a part of the evaluation value 340 may be calculated according to an instruction of the business person in charge, or a function of calculating an additional evaluation value may be added. For example, if the preference type is not divided, the concurrent selling rate matrix 343 may not be calculated. Alternatively, if only the preference type, a scale (the number of persons belonging to the preference type) of which is equal to or more than a predetermined value, is to be estimated, a function of outputting the update draft corresponding to the number of customers belonging to each preference type may be added, and preference type specific customer number data may be added to the evaluation value 340. The order and the number of those steps are not limited to those illustrated in
The evaluator 330 adds, deletes, and changes the path of the preference type on the basis of the merchandise matching degree, and updates the preference type graph in association with the addition, deletion, and change. The merchandise matching degree is a value indicative of how much the merchandise nodes 141 associated with the customer nodes 111 belonging to a certain preference type nodes 121 on the preference type graph matches the actual merchandise purchasing history in the purchasing history data 381. It is conceivable that the preference type graph with high level of the merchandise matching degree represents the correspondence relationship between the purchasing preference type of the customer described by the purchasing history data 381 and the merchandise with high precision. The details of the present step will be described with reference to
The evaluator 330 adds, deletes or changes the path of the preference type on the basis of the customer matching degree, and updates the preference type graph in association with the addition, deletion, or change. The customer matching degree is a value indicative of how much the connection relationship (for example, it is conceived that the customers belonging to the same node are connected to each other on the graph) of the customer nodes 111 on the preference type graph match the customer segment on the purchasing history data 381. The preference type graph high in the merchandise matching degree represents the customer segment suggested by the purchasing history data 381 with high precision. The details of the present step will be described with reference to
The evaluator 330 divides the preference type on the basis of the concurrent selling rate, and updates the preference type graph in association with the division. The concurrent selling rate represents, for example, a probability for a certain customer to purchase a merchandise B when purchasing a merchandise A. When the concurrent selling rate of the merchandise group belonging to a certain preference type node is low, it is conceivable that the preference type node is to be divided. The details of the present step will be described with reference to
The evaluator 330 integrates the preference types together on the basis of the degree of similarity between the preference types, and updates the preference type graph in association with the integration. The degree of similarity between the preference types can be obtained, for example, by calculating a correlation function between the merchandise nodes 141 belonging to each preference type node 121 on the basis of the purchasing history data 381. The details of the present step will be described with reference to
The evaluator 330 acquires the relationship matrix data 311 (S601). The evaluator 330 acquires a matrix (preference type×customer matrix) describing the customer belonging to each preference type from the preference type specific relationship data 382 (S602).
The merchandise matching degree analysis unit 331 calculates the merchandise matching degree vector 341. The details of the present step will be described with reference to
The evaluator 330 acquires a threshold of the merchandise matching degree from the display 360. A screen interface that designates the threshold of the merchandise matching degree will be described with reference to
The merchandise matching degree analysis unit 331 generates the update instruction matrix data 335 on the basis of the merchandise matching degree vector 341 and the merchandise matching degree threshold. The details of the present step will be described with reference to
The display 360 presents an addition, deletion, and change draft of the path to the preference type according to the description of the update instruction matrix data 335 (S606). The evaluator 330 acquires, from the display 360, an instruction for designating the preference type for considering the path update (S607). The update unit 336 creates an addition and deletion draft of each node and path in association with the update of the preference type instructed at Step S607 (S608). The details of Step S608 will be described with reference to
The update unit 336 extracts a feature of the node updated at Step S608. The present step is to extract information for helping the business person in charge to interpret the preference type graph after updating. For example, when the paths in the merchandise attribute layer 130 and one layer above the merchandise attribute layer 130 are added and deleted, the update unit 336 extracts the features related to the added merchandise group and the deleted merchandise group. For example, a method is conceivable in which when the update unit 336 deletes the merchandise node 141 linked to the merchandise attribute node 131, the update unit 336 compares the merchandise name and the merchandise description of the merchandise group linked even after updating with the merchandise name and the merchandise description of the merchandise group to be deleted by updating, and extracts a characteristic keyword in the deleted merchandise group.
The display 360 presents a node update draft and a node feature after updating (S610). The display 360 receives an instruction for updating the preference type graph from the business person in charge (S611). The update unit 336 generates the update version relationship matrix data 351 and the update history data 352 according to the instruction (S612).
The merchandise matching degree analysis unit 331 acquires the relationship matrix data 311. The merchandise matching degree analysis unit 331 acquires the number A of hierarchies and a number B of preference types in the preference type graph from the relationship matrix data 311.
The merchandise matching degree analysis unit 331 acquires a matrix (preference type×preference matrix) describing the customers belonging to each preference type from the preference type specific relationship data 382.
The merchandise matching degree analysis unit 331 acquires a merchandise purchasing value vector of each customer from the purchasing history data 381. The merchandise purchasing value vector is data obtained by quantifying the purchasing trend of the customer for each merchandise. For example, the merchandise that has been purchased can be represented by a vector having an element value of 1, the merchandise that has not been purchased can be represented by a vector having an element value of 0. In addition to the presence or absence of the purchasing, a vector having the number of purchases, a purchasing rate, or the like as the element value can be used.
The merchandise matching degree analysis unit 331 extracts the customer nodes 111 not belonging to the preference type nodes 121 including the merchandise nodes 141 for each merchandise node 141, calculates an average of the purchasing values of the extracted customer nodes 111 group, and sets the calculated average as a reference purchasing value of the merchandise node 141. The reference purchasing value is an index representing a purchasing trend of the customer node 111 not belonging to the preference type node 121 for the merchandise node 141. As the purchasing value, for example, 1/0 indicative of the presence or absence of the purchasing as at Step S703, or an appropriate index may be used if such an index is present.
The merchandise matching degree analysis unit 331 calculates an average of the purchasing values of the customer nodes 111 group belonging to the preference type b for each merchandise.
The merchandise matching degree analysis unit 331 calculates the merchandise matching degree vector for each preference type node 121 with reference to the purchasing reference value calculated at Step S704. A specific example of the merchandise matching degree vector will be described with reference to
The merchandise matching degree analysis unit 331 calculates the merchandise matching degree vector of a hierarchy a (one upper layer) from the merchandise matching degree vector related to a node of a hierarchy a+1 of the preference type graph. Specifically, the merchandise matching degree analysis unit 331 calculates an average vector of the merchandise matching degree vectors of the node of the hierarchy a+1 linked with each node of the hierarchy a as the merchandise matching degree vector of each vector of the hierarchy a.
The merchandise matching degree analysis unit 331 implements Step S707 in order from a lower layer on the preference type graph. As a result, the merchandise matching degree vector 341 for each preference type node 121 is obtained.
In the data example illustrated in
The merchandise matching degree analysis unit 331 acquires a relationship flag (a cell value indicative of the presence or absence of the path and the type of the path) for all of the nodes in a layer lower than the preference type layer 120 from the relationship matrix data 311. The merchandise matching degree analysis unit 331 acquires the number B of preference types and the number N of nodes from the relationship matrix data 311.
The merchandise matching degree analysis unit 331 acquires a merchandise matching degree threshold. The merchandise matching degree threshold is a threshold for determining to which of three element values of the merchandise matching degree vector a certain node belong (that is, any one of “likely to be purchased”, “average”, and “unlikely to be purchased”). The merchandise matching degree threshold may be set in advance, or may be designated by the business person in charge, for example, through the display 360.
The merchandise matching degree analysis unit 331 acquires the merchandise matching degree vector 341.
The merchandise matching degree analysis unit 331 acquires a relationship flag of the node n for the preference type b, and the merchandise matching degree vector corresponding to the relationship flag (S904). The merchandise matching degree analysis unit 331 compares the merchandise matching degree vector with the merchandise matching degree threshold, and calculates a matching degree flag as 1 if the merchandise matching degree vector exceeds the merchandise matching degree threshold, and 0 in the other cases (S905).
The merchandise matching degree analysis unit 331 compares the relationship flag with the matching degree flag, and extracts the unmatched item as an error. If the relationship flag between the preference type b and the node n is 1, the merchandise matching degree vector means “likely to be purchased”. Therefore, if the merchandise matching degree vector is (1, 0, 0), those flags match each other, and in the other cases, those flags do not match each other. If there are multiple relationship flags between the preference type b and the node n, the merchandise matching degree analysis unit 331 compares the respective relationship flags with the matching degree flag, and considers a case where any one of those relationship flags does not match the matching degree flag as an error.
The merchandise matching degree analysis unit 331 performs the above steps for all of the preference types and the nodes, and generates the update instruction matrix data 335 on the basis of the result. The update instruction matrix data 335 is a matrix describing the update instruction for each preference type, and the detail of the update instruction matrix data 335 will be described with reference to
The update instruction flag of any one of no update, a positive path deletion, and a positive path addition is described between the preference type layer 120 and the customer layer 110. According to the data example illustrated in
The update instruction flag between the nodes in the preference type layer 120 is any one of no change, and integration/duplicate of the preference type. In the example illustrated in
The update instruction flag in a layer lower than the preference type layer 120 is any one of no change, the deletion of the positive path, the deletion of the negative path, the addition of the positive path, and the addition of the negative path. Multiple instructions may be combined together. According to the data example illustrated in
The update unit 336 acquires a preference type D to be updated, the update instruction matrix data 335 corresponding to the preference type D, the relationship matrix data 311, and the number A of hierarchies on the relationship matrix data 311.
The update unit 336 acquires the update instruction flag for the node belonging to the preference type D and the customer layer 110, updates the path of the preference type graph or integrates/duplicates the preference type node 121 according to the acquired instruction.
The update unit 336 acquires the node that has the update instruction related to the preference type D and is related to the layer a from the update instruction matrix data 335, and acquires the number N of nodes (S1103). The update unit 336 acquires the update instruction flag of the node n (S1104).
When a path deletion instruction for the node n is present, the update unit 336 checks influence of the path deletion on the other preference type D with reference to the relationship flag between the node n and the other preference type D. When the correspondence relationship of the other preference type D is changed by the path deletion, the path is deleted as it is. When the connection relationship of the other preference type D is changed by the path deletion, after the other preference type D is prevented from being influenced by duplicating the node n, the instructed path is deleted.
When the path addition instruction for the node n is present, the update unit 336 adds the path continuous to the preference type D in order from the higher position. Specifically, it is first checked whether or not an instruction for adding the node continuous to the preference type D node or the preference type D is present in a layer a-1. If the instruction is present, the update unit 336 adds the path for the node. If no instruction is present, the update unit 336 generates the node and the path in the layer a-1 so that the path is continuous to the preference type D. After having added the node or the path in the layer a-1, the update unit 336 changes the update instruction flag for a lower position node belonging to the node n to “no change”. The update unit 336 adds the path in order from the higher position, and a change from the initial design data 301 is reduced by preventing the lower node belonging to the added path from being updated. In other words, the update unit 336 can generate the update draft high in the merchandise matching degree while having a graph structure as near as the preference type graph initially designed.
The update unit 336 deletes the nodes in which the upper path continuous to the preference type layer 120 is not present and the nodes in which the lower path continuous to the merchandise layer 140 is not present, in the update draft of the preference type graph created in the above steps. Further, the update unit 336 integrates the nodes shared by the lower merchandise group together. The update unit 336 outputs the update draft of the preference type graph created in the above steps.
A layer 3521 is an ID of the layer to which the updated node belongs before updating. An old node ID 3522 records (a) the deleted or divided node ID, (b) the integrated node ID group, and (c) the upper side node ID when the path between the nodes is added or deleted. A blank is provided in the case of adding the node. A processing type 3523 records the content of the update process or the update instruction flag. A new node ID 3524 describes the node ID after updating. A blank is provided in the case of deleting the node. An evaluation value 3525 describes the evaluation index used when calculating the update instruction matrix data 335. In the above description, an example in which the update instruction matrix data 335 is calculated on the basis of the merchandise matching degree was described. The other evaluation index will be described later.
Because the customer nodes 111 linked to the same preference type node 121 are linked to the same purchasing psychological factor, it is assumed that portions associated with the purchasing psychological factor have the similar purchasing trend. The customer matching degree is an index indicative of the degree of similarity of the purchasing trend of the customer nodes 111 group. Using the customer matching degree, it is possible to evaluate whether a group of merchandise nodes 141 linked with a preference type node 121 is purchased in a similar manner by a group of customer nodes 111 belonging to such preference type node 121.
The estimation of whether the purchasing trend is similar or not may not be appropriate depending on the concept of the designed preference type nodes 121. For example, in the case of designing the preference type “fond of tobacco”, the customers belonging to such preference type purchases the tobacco in common. However, because the tobacco brands preferred by individuals are dispersed, a case where the purchasing trends taking the brands into consideration are dispersed among the customers belonging to the preference type is conceivable. Under the circumstances, for example, (a) the threshold for determining the degree of similarity of the customer matching degree may be determined, and (b) whether to implement the evaluation according to the customer matching degree or not may be determined, according to the concept of the preference type, to thereby evaluate only the necessary preference type.
The evaluator 330 acquires the relationship matrix data 311, the preference type specific relationship data 382, the update version relationship matrix data 351, and the update history data 352 (S1301). The customer matching degree analysis unit 332 calculates the customer matching degree list 342 (S1302). The details of Step S1302 will be described with reference to
The evaluator 330 acquires the customer matching degree threshold from the display 360. A screen interface for designating the customer matching degree threshold will be described with reference to
The update unit 336 calculates the update instruction matrix data 335 on the basis of the customer matching degree list 342 and the customer matching degree threshold. The details of the present step will be described with reference to
The display 360 presents the addition, deletion, and change draft of the path for the preference type according to the description of the update instruction matrix data 335 (S1305). The evaluator 330 acquires an instruction for designating the preference type for consideration of the path update from the display 360 (S1306). The update unit 336 creates the addition and deletion draft of each node and path in association with updating of the preference type instructed at Step S1306 (S1307).
The update unit 336 extracts the feature of the node updated at Step S1307 in the same technique as that at Step S609 (S1308). The display 360 presents the node update draft and the node feature after updating (S1309). The display 360 receives an instruction for updating the preference type graph from the business person in charge (S1310). The update unit 336 generates the update version relationship matrix data 351 and the update history data 352 (S1311).
The customer matching degree analysis unit 332 acquires the update version relationship matrix data 351 and the update history data 352. Further, the customer matching degree analysis unit 332 acquires the latest-version relationship matrix data 311 and the latest-version preference type specific relationship data 382. For example, the customer matching degree analysis unit 332 acquires the correspondence relationship between the nodes before and after updating from the update history data 352, and allocates the preference type specific relationship data 382 to the node after updating, thereby being capable of acquiring the latest-version preference type specific relationship data 382. When the pre-update node is not present, or when the node making it difficult to estimate the matrix because a change from the pre-update is larger is present, those nodes may be omitted from the processing target in the present flowchart.
The customer matching degree analysis unit 332 acquires the merchandise purchasing value vector of each customer from the purchasing history data 381. The merchandise purchasing value vector is a vector having a value (purchasing value) representing whether to purchase each merchandise, by a numeric value such as 1/0 as the element value.
The customer matching degree analysis unit 332 acquires a portion describing whether or not the customer belonging to the preference type b has purchased the merchandise belonging to the preference type b from the merchandise purchasing value vectors acquired at Step S1402. The customer matching degree analysis unit 332 obtains an average vector of the acquired merchandise purchasing value vectors. The customer matching degree analysis unit 332 can determine whether the purchasing trend of each customer matches the purchasing trend of the other customer, on the basis of a distance between the average vector and the merchandise purchasing value vector of each customer. For example, the customer matching degree analysis unit 332 can determine that the purchasing trend of each customer matches the purchasing trend of the other customer if the distance falls within a predetermined range. The customer matching degree of the customer, the purchasing trend of which matches the purchasing trend of the other customer is set as 1, and the customer matching degree of the unmatched customer is set as 0. Alternatively, a reciprocal of the distance may be set as the customer matching degree.
The method of calculating the customer matching degree is not limited to the above method. For example, a technique is proposed in which the merchandise purchasing value vectors of the respective customers are clustered, the customer matching degrees of the customers classified into a representative class is set as 1, and the customer matching degree of the customers classified in a class smaller in scale than a predetermined threshold is set as 0.
The present step is to obtain the customer matching degree between the customer nodes 111 paying attention to only the customer layer 110. On the contrary, in the layers lower than the preference type layer 120, because there is a possibility that multiple paths extending to the customer nodes 111 are present, and that the customer nodes 111 are counted redundantly, the redundancy is eliminated through AND operation at Step S1405. However, the concept of the customer matching degree is the same as that of the following step. Similarly, in
The customer matching degree analysis unit 332 acquires the relationship flag between each node and the customer nodes 111 in the layer a, and the number N of nodes in the layer a.
The customer matching degree analysis unit 332 calculates the customer matching degree for the customer nodes 111 belonging to the node n in the layer a and also belonging to the preference type b. Specifically, the customer matching degree analysis unit 332 calculates an average vector of the merchandise purchasing value vectors of the customer nodes 111 belonging to the node n in the layer a and also belonging to the preference type b, and calculates the customer matching degree on the basis of a distance between the average vector and the merchandise purchasing value vector of each customer.
The technique of calculating the customer matching degree in the present step is not limited to the above technique. For example, the matching degree between the nodes may be calculated on the basis of an index related to a variation in the merchandise purchasing value vector group. In the flowchart illustrated in
The customer matching degree analysis unit 332 creates the customer matching degree list 342 on the basis of the calculation results in the above steps. The customer matching degree list 342 is data describing the customer matching degree of all nodes to be calculated in the above steps.
The update unit 336 acquires the update version relationship matrix data 351 and the customer matching degree list 342. The update unit 336 acquires the customer matching degree threshold from the display 360. For example, when the customer matching degree depends on population such that the method of calculating the customer matching degree is different for each layer, or a statistical dispersion index is employed as the customer matching degree, multiple customer matching degree thresholds may be prepared.
The update unit 336 compares the customer matching degree of each node linked with the preference type b with the customer matching degree threshold. The update unit 336 adds the nodes, the customer matching degree of which is less than the threshold, to an error node list. The update unit 336 allocates an update instruction flag for instructing the customer nodes 111 included in the error node list to delete the paths linked with the preference type b in the present step. In the layers lower than the preference type layer 120, the paths are deleted in favor of the lowermost layer in the following steps.
With the deletion of the paths of the node, the customer matching degree of which is less than the threshold, the customers, the purchasing trend of which is different from that of the other clients can be removed from the preference type. In addition, with the deletion of the paths in priority order from the lowermost layer, the preference type graph that matches the purchasing history data 381 with high precision while a change from the initial design data 301 is reduced can be realized.
When the preference type node d is included in the error node list, the update unit 336 acquires a third-layer node linked with the preference type node b, and lists up the nodes included in the error node list in the third-layer nodes as a search node list.
The update unit 336 allocates the update instruction flag for instructing the nodes in the search node list or the nodes belonging to the lower layer to delete the paths linked with the preference type b in favor of the lower nodes. Specifically, the update unit 336 first acquires an n-th node of the search node list. When the n-th node is in the lowermost layer, the update unit 336 allocates the update instruction flag for giving an instruction for deleting the paths linked to the preference type b. When the n-th node is not in the lowermost layer, the update unit 336 adds the nodes in the error node list linked with an n-th node from one lower layer to the search node list. The update unit 336 implements the same processing for N nodes in the search node list, to thereby delete the path linked with the preference type b in favor of the lowermost layer node in the search node list.
The update unit 336 creates the update instruction matrix data 335 on the basis of the above calculation results.
The division analysis unit 333 acquires the relationship matrix data 311, the preference type specific relationship data 382, the update version relationship matrix data 351, and the update history data 352 (S1601). The division analysis unit 333 calculates the concurrent selling rate matrix 343 (S1602). The details at Step S1602 will be described with reference to
The division analysis unit 333 creates a purchasing association degree graph related to the merchandise group linked with the preference type. The purchasing association degree graph is a graph that includes additional paths between the nodes not linked with each other on the preference type graph. With the use of the purchasing association degree graph, the division analysis unit 333 attempts to couple the merchandise groups likely to be associated in the actual purchasing trend although not associated on the preference type graph. The details of the present step will be described with reference to
The display 360 acquires a lower limit threshold of the merchandise concurrent selling rate and an upper limit/lower limit threshold of a division type affiliation rate. The lower limit threshold of the merchandise concurrent selling rate is a threshold used for determination in extracting the merchandise group linked with each preference type when a certain preference type is divided. The upper limit/lower limit threshold of the division type affiliation rate is a threshold used for determining the update draft for dividing the preference type while maintaining a structure of the preference type graph before updating as much as possible after the merchandise group has been extracted. A screen for acquiring those thresholds will be described with reference to
The division analysis unit 333 cuts an edge having the concurrent selling rate that is equal to or less than the lower limit threshold in the purchasing association degree graph generated at Step S1603, to thereby extract a preference type specific division candidate merchandise group. The preference type specific division candidate merchandise group is a merchandise group having a predetermined or more purchasing association degree in the purchasing association degree graph of a certain preference type, which is a merchandise group high in the purchasing association degree in a part of customer aggregation in the customer group belonging to the preference type. In other words, it is conceivable that with the setting of the preference type linked with the division candidate merchandise group, the preference type graph in which the matching degree between the merchandise group actually purchased by the customer group belonging to the preference type and the merchandise group linked by the preference type is higher can be set.
The division analysis unit 333 calculates the update instruction matrix data 335 on the basis of the preference type specific division candidate merchandise group extracted at Step S1605. The details of the present step will be described with reference to
The display 360 presents a division likelihood of the preference type according to the disclosure of the update instruction matrix data 335 (S1607). The evaluator 330 acquires an instruction for designating the preference type for consideration of the division from the display 360 (S1608). The update unit 336 extracts a structure draft of a preference type graph in which the instructed preference type is divided and a division rate of the preference type (S1609).
The update unit 336 extracts the feature of the node updated at Step S1609 in the same technique as that at Step S609. The display 360 presents the node update draft and the node feature after updating.
The display 360 receives an instruction for updating the preference type graph from the business person in charge (S1611). The update unit 336 creates the update version relationship matrix data 351 and the update history data 352 (S1612).
The division analysis unit 333 acquires a correspondence relationship between the preference type nodes 121 and the customer nodes 111 from the relationship matrix data 311. It is assumed that the number of acquired preference types is B.
The division analysis unit 333 acquires the merchandise purchasing value vector of each customer from the purchasing history data 381. The style of describing the merchandise purchasing value vector is the same as the one described above.
The division analysis unit 333 calculates the concurrent selling rate matrix for each preference type. More specifically, the division analysis unit 333 calculates a person number rate of persons who purchases both of two merchandises to the customers belonging to a certain preference type b, and outputs the calculated person number rate as the concurrent selling rate matrix of the preference type b. The concurrent selling rate used in the present step may be an index for evaluating the purchasing association degree between two merchandises, and the concurrent selling rate does not always need to be calculated on the basis of the number of persons who have purchased those two merchandises. For example, a probability with the condition in which both of a merchandise A and a merchandise B are purchased can be used as the concurrent selling rate. In that case, a purchasing probability P(B|A) of the merchandise B when a certain customer purchases the merchandise A, and a purchasing probability P(A|B) of the merchandise A when the customer purchases the merchandise B are calculated, respectively, and an average value of those probabilities of the customer group belonging to the preference type b is used as the concurrent selling rate of the preference type b. The concurrent selling rate is a value equal to or more than 0 and equal or less than 1.
The division analysis unit 333 implements Step S1703 for all of the preference types, and stores the implemented result in the concurrent selling rate matrix 343.
The division analysis unit 333 acquires the update version relationship matrix data 351 and the concurrent selling rate matrix 343. It is assumed that the number of preference types in the update version relationship matrix data 351 is B.
The division analysis unit 333 extracts the concurrent selling rate of the preference type b from the concurrent selling rate matrix 343 for the merchandise group linked with the preference type b on the preference type graph.
The division analysis unit 333 creates the purchasing association degree graph of the preference type b with the merchandise group extracted at Step S1802 as the node of the purchasing association degree graph and the concurrent selling rate as a default of the weight of the path between the nodes. When the concurrent selling rate matrix 343 is an asymmetrical graph, the respective weights are expressed with the use of paths having orientation.
The division analysis unit 333 updates the weight of the path so that the weight of each path is maximized with a travel cost between the multiple paths as a product of the weights of the paths. A path travel route between a node n1 and a node n2 is expressed as n1→n2, a path travel route going through a node n3 is expressed as n1→n3→n2, and the travel cost in the route of n1→n2 is expressed as W (n1→n2). The travel cost of an arbitrary path travel route is expressed as the following Expression 1 with the use of the product of the travel cost of the path route.
W(n1→n3→n2)=W(n1→n3)×W(n3→n2) (Ex. 1)
Further, the travel cost between the node n1 and the node n2, and the cost of the travel path of m1 to mM(M≦N) through which the travel from the node n1 to the node n2 goes are required to satisfy the following Expression 2. N is the number of all nodes in the purchasing association degree graph.
W(n1→n2)≧W(n1→m1→ . . . →mM→n2) (Ex. 2)
The division analysis unit 333 obtains a W(n1→n2) in all of the nodes satisfying (Ex. 1) and (Ex. 2) after departing from the path of a default. The default of W(n1→n2) is the concurrent selling rate of the merchandise n2 with respect to the merchandise n1, and the concurrent selling rate ranges from 0 to 1. Therefore, the travel cost when the node m is added to the travel path n1→n2 always satisfies the following Expression 3. The division analysis unit 333 updates the weight so that W(n1→n2) is maximized taking the above fact into consideration.
W(n1→n2)≧W(n1→n2→m) (Ex. 3)
The technique of calculating the weights of the purchasing association degree graph is not limited to the above technique. For example, the path may be updated taking only the routes of several merchandises into consideration. In addition, the weights are determined in advance when the weights of the purchasing association degree graph are calculated, and all of the weights falling below a threshold are regarded as 0 whereby only the paths, the weight of which is large to some extent may be considered. Further, the default of the purchasing association degree graph may be employed as it is.
The division analysis unit 333 implements the above steps for all of the preference types b, and records the weights between the nodes in the purchasing association degree graph of each preference type.
The update unit 336 acquires the update version relationship matrix data 351. The update unit 336 acquires upper limit/lower limit thresholds of the division type affiliation rate from the display 360. The update unit 336 acquires the preference type specific division candidate merchandise group. It is assumed that the number of hierarchies is A and the number of preference types is B in the update version relationship matrix data 351.
Among update drafts that satisfy the upper/lower limit thresholds of the division type affiliation rate, the update unit 336 creates an update draft for dividing the preference type only by adding and deleting paths in the upper layer as much as possible. Alternatively, the update unit 336 may determine the upper limit value of the number of update processing steps, and search the division draft best in that range. The effectiveness of the division draft can be evaluated by: comparing the division candidate merchandise group with merchandise groups that are linked with the subject preference type by adding and deleting a certain node or a path; and checking how small the number of merchandises not belonging to the division candidate merchandise group but belonging to the subject preference type is. Hereinafter, a description will be given on the assumption that a technique of adding or deleting the paths in order from the upper layer is employed.
The update unit 336 acquires the number M of division candidate merchandises of the preference type b. The update unit 336 duplicates (M-1) pieces of the preference type b, and allocates the respective division candidate merchandises to the preference type b and the duplicated (M-1) preference types.
The update unit 336 acquires the lower layer node positively linked with the preference type b, and sets the acquired lower layer node as a search node list. The update unit 336 creates M pieces of search node lists. In the present step, the nodes to be searched are set as all nodes, thereby being capable of considering a draft for adding a positive node capable of preferably dividing the division candidate merchandise group.
The update unit 336 acquires the nodes described in the search lead list m among the nodes in the layer a, and calculates the division type affiliation rate of each node. The division type is each preference type duplicated at Step S1902. The affiliation rate can be calculated by a rate at which each division candidate merchandise group belongs to each division preference type on the purchasing history data 381. The search node list m is a list of the search nodes related to the division candidate merchandise group m.
If the division type affiliation rate calculated at Step S1904 is equal to or more than an upper limit threshold, the update unit 336 gives an update instruction flag indicating that a relationship flag between the node and the preference type m is not updated, and deletes the lower layer node linked with the node from the search node list m. If the division type affiliation rate is equal to or lower than the lower limit threshold, the update unit 336 gives an update instruction flag indicating that the path between the node and the preference type m is deleted, and deletes the lower layer node linked with the node from the search node list m.
When a rate at which the division candidate merchandise group belongs to the division preference type is equal to or more than an upper limit threshold, the update unit 336 does not update the preference type graph for nodes in the layer lower than the node. In other words, the update unit 336 updates the preference type graph with priority from the upper layer. As a result, the preference type can be properly divided while reducing a difference between the preference type graphs before and after updating.
The update unit 336 creates the update instruction matrix data 335 on the basis of the calculation result of the above steps. For example, the update unit 336 adds a line describing the node ID belonging to the duplicated preference type node 121 on a line corresponding to each nodes in the preference type layer 120, and describes an update instruction flag designating a relationship flag of the node in the other layer of the new preference type nodes 121 to the added line.
The integration analysis unit 334 acquires the relationship matrix data 311, the merchandise matching degree vector 341, the update version relationship matrix data 351 (the number B of preference types), and the update history data 352 (S2001). The display 360 acquires a threshold of the purchasing trend matching degree (S2002). A screen for designating the threshold of the purchasing trend matching degree will be described with reference to
The integration analysis unit 334 compares the merchandise matching degree vectors related to the merchandises linked with a preference type b1 and preference type b1 with each other for the respective customer groups of the preference types b1 and b1, and calculates the purchasing trend matching degree. For example, the correlation coefficient between a merchandise matching degree vector of the preference type b1 and the merchandise matching degree vector of the preference type b1 can be set as the purchasing trend matching degree.
The integration analysis unit 334 compares the purchasing trend matching degree calculated at Step S2003 with a purchasing trend matching degree threshold acquired at Step S2002, and extracts an integration candidate node pair. The node pair in which the purchasing trend matching degree is equal to or more than the threshold can be set as an integration candidate.
The integration analysis unit 334 creates the update instruction matrix data 335 on the basis of the integration candidate node pair extracted at Step S2004 (S2005). The display 360 presents an integration draft of the preference type nodes 121 according to the description of the update instruction matrix data 335 (S2006). The display 360 acquires an integration instruction of the preference type (S2007). The update unit 336 updates the update version relationship matrix data 351 and the update history data 352 according to the instruction (S2008).
The updater 370 acquires the AND pair list 312, the relationship matrix data 311, the update version relationship matrix data 351 (the NUMBER A OF HIERARCHIES), and the update history data 352 (S2101). The updater 370 acquires the number N of nodes in the layer a from the update version relationship matrix data 351 (S2102). The updater 370 acquires the node ID before updating in the same layer corresponding to the node n from the update history data 352 (S2103).
When the pre-update node ID corresponding to the node n is not present, the updater 370 extracts the feature of the node n from the node in one lower layer linked with the node n, and stores the extracted feature as the feature of the node n.
When the node n and the corresponding pre-update node ID are present, the updater 370 compares the pre-update node ID with the relationship flag of the node n, to thereby acquire the post-update node ID, the added post-update node ID, and the deleted post-update ID, which are shared by the pre-update node ID, and stores the features of those post-update node IDs as the feature of the node n.
The updater 370 extracts the merchandise nodes 141 group belonging to the respective nodes before and after updating. The updater 370 calculates an increase rate of the number of merchandise nodes 141 belonging to the post-update node ID to the number of merchandise nodes 141 belonging to the pre-update node ID, and stores the calculated increase rate as the merchandise scale.
The updater 370 calculates the increase rate of the customer nodes 111 in association with the deletion and integration of the node in a range extractable in the preference type specific relationship data 382, and stores the calculated increase rate as an estimated customer scale.
The updater 370 creates the post-update feature list 383 on the basis of the results of the above steps. A specific example of the post-update feature list 383 will be described with reference to
At Step S2108 to create the post-update feature list 383, the preference type estimator 320 may calculate the number of estimated customers in the preference type graph after updating, or may calculate an estimated value of the number of customers in the preference type graph after updating on the basis of the number of customers in the preference type graph before updating. For example, when a path between a certain preference type nodes 121 and the merchandise attribute node 131 is deleted, it is probable that correspondence relationships between the customer nodes 111 belonging to only the merchandise attribute node 131 whose path is deleted in the customer nodes 111 belonging to the preference type nodes 121 and the preference type nodes 121 are also deleted. From this viewpoint, the number of customer nodes 111 to be deleted can be estimated.
A check box 2302 is a check box for selecting whether or not Step S501 for evaluating the preference type graph on the basis of the merchandise matching degree is to be implemented. A check box 2303 is a check box for selecting whether or not Step S502 for evaluating the preference type graph on the basis of the merchandise matching degree is to be implemented. The evaluator 330 implements the step (both the steps may be selected) selected by those check boxes. A threshold designation field 2304 is a field for designating a threshold. In
An evaluation result summary 2305 presents a summary of the evaluation results of the preference type graph in the Step selected by the above check boxes. A preference type 2307 represents the evaluated preference type nodes 121. The number of merchandises 2308 is the number of merchandises linked with the preference type 2307 before updating. An estimated customer number 2309 is the number of customers estimated to belong to the preference type 2307 before updating. An estimated purchasing rate 2310 is an evaluation index for the update draft of the preference type 2307, which is a rate of the merchandise nodes 141 determined to be likely to be purchased on the purchasing history data 381 to the merchandise nodes 141 linked to the preference type 2307 on the preference type graph. The estimated purchasing rate 2310 can be calculated from the merchandise matching degree vector 341 or the customer matching degree list 342. An update draft 2311 is a summary of the update draft of the preference type graph. A review recommendation flag 2306 suggests a review for the evaluation index of the preference type 2307 when the evaluation index is low. The information to be presented is not limited to the above information, but for example, as the number of merchandises 2308, only the number of merchandises linked with the positive path may be presented.
A path update draft 2312 presents an update draft for the preference type graph by the step selected by the above check boxes. In this example, the path update draft 2312 presents the update draft for the preference type “fond of sale” suggested to be reviewed by the review recommendation flag 2306. A preference type graph 2313 shows a graph of the preference type in which the nodes and the paths which are linked with the preference type before updating are indicated by solid lines, and the node and the path which are added after updating are indicated by dotted lines. A check box 2314 is an entry field for instructing the customer analysis device 300 to actually add the node proposed to be added. A check box 2315 is an entry field for instructing the customer analysis device 300 to actually delete the node proposed to be deleted. A merchandise feature 2316 is a feature common to the deletion candidate merchandise group. A link 2317 is a link for transitioning a detailed merchandise list to a presentation screen. The number of merchandises 2318, the estimated number of customers 2319, and an estimated purchasing rate 2320 indicate those estimated values after updating the node. An update button 2321 is a button for confirming the path update draft 2312. A non-update button 2322 is a button for entering a fact that the path update draft 2312 is not adopted.
A threshold setting field 2402 is a field for designating a lower limit threshold of the merchandise concurrent selling rate at Step S1604. When the lower limit threshold of the merchandise concurrent selling rate is low, even when the purchasing association degree between the merchandises by the same customer is not too high, those merchandises are linked with the same preference type. Therefore, as compared with a case where the lower limit threshold is high, the number of extracted division candidate merchandise groups is liable to be reduced.
An evaluation result summary 2403 presents an evaluation result of the preference type graph. The review recommendation flag to the estimated purchasing rate are the same items as those in the evaluation result summary 2305 in
A threshold designation field 2406 is a field for designating an upper limit threshold/lower limit threshold of a division type affiliation rate at Step S1604. A division graph 2407 presents a node division draft for a preference type “safety-oriented” suggested to be reviewed by the review recommendation flag in the evaluation result summary 2403. In
A purchasing association degree graph 2410 is a division image of the purchasing association degree graph created in a flowchart of
A feature 2412 is a feature of the merchandise groups linked with the preference type after division. A type reproduction rate 2412 is an evaluation value of each preference type when the preference type is divided on the basis of the division candidate merchandise group 2404, and represents a rate of the non-matched merchandise group in the division candidate merchandise group and the actual division result. In an example illustrated in
Although omitted for ease of viewing in
A threshold setting field 2502 is a field for designating a threshold of the purchasing trend matching degree at Step S2202. The evaluation result summary presents the evaluation result of the preference type graph. The review recommendation flag to the estimated purchasing rate are the same items as those in the evaluation result summary in
A customer overlapping degree field 2505 presents the degree of overlapping of the customer group belonging to each preference type integrally proposed. As illustrated in
An OR integration button 2507 instructs the customer analysis device 300 to integrate the respective preference types together in an OR relationship. An AND integration button 2508 instructs the customer analysis device 300 to integrate the respective preference type together in an AND relationship. A non-update button 2509 cancels the integration. A new preference type button 2510 instructs the customer analysis device 300 to create a new preference type that integrates the respective preference types together.
An analysis condition input unit 2701 is a field for selecting the index used in the analysis. An update drift summary 2702 presents an update draft of the preference type graph based on a change in the time-series evaluation index. A preference type 2703 is a preference type name updated and proposed. A pickup feature 2704 represents a trend of the evaluation index that is a basis of the update proposal.
A time-series graph 2707 is a graph indicative of a time-series transition of the number of customers of each preference type, and indicates an trend of reducing the number of customers of the preference type 2703 (adult disease prevention type). A time-series table 2708 illustrates a time-series transition of a purchasing trend matching degree of the diet type and the adult disease prevention type. In
As has been described above, the customer analysis device 300 according to the first embodiment can propose the preference type graph that brings the purchasing preference type (concept related to the purchasing psychological factor) designed by the business person in charge closer to the actual merchandise purchasing history. As a result, the customer analysis device 300 can reduce the try & error in the preference type design of the customers, and further can cope with a conceptual change in the purchasing preference type with time.
The store server 1100 transmits a possessed purchasing history (purchasing history data 381) to the customer analysis device 300, and tallies the analysis result caused by the customer analysis device 300, for example, each customer in the subject store, to thereby present data to be leveraged in a business in the store to a store server user. The merchandise recommendation server 1200 acquires a recommendation merchandise and an appropriate recommendation message for each individual from the analysis result caused by the customer analysis device 300, and creates the merchandise recommendation for each individual. The headquarters business server 1300 is a server that leverages the analysis results caused by the customer analysis device 300 to a retail related business such as a CRM business or a new merchandise development business. For example, a leveraging method of presenting a relationship with a person number scale of each preference type or a demographic attribute as the analysis result, and helping the concept consideration of the new merchandise development is conceivable.
A customer 2901 is an ID of each customer. A preference type 2902 is a preference type to which the customer 2901 belongs. A recommended merchandise 2903 is a merchandise linked with a preference type to which the customer 2901 belongs. A preference type graph may be designed regarding a purchasing time or a Web site browsing time that are linked with the customer ID, for example. A recommended delivery timing 2904 is extracted according to the designed preference type graph. An appeal point vector 2905 is a vector calculated by multiplying the merchandise feature of the recommended merchandise 2903 by the path between the preference type nodes 121 to which the customer 2901 belongs and the merchandise attribute nodes 131. In this situation, it is interpreted that the index such as the customer matching degree is a contribute degree to the preference type of each customer 2901, and the appeal point vector 2905 can be calculated according to the contribute degree. A message 2906 is a message that is generated on the basis of the weight of the appeal point vector 2905. A purchasing probability 2907 is an index value that indicates ease to purchase the merchandises belonging to the preference type. The purchasing probability 2907 is estimated on the basis of the concurrent selling rate matrix 343 with respect to the merchandise group belonging to the preference type linked with the customer 2901 and a past purchasing trend of the customer 2901. It is conceivable that with the user of the purchasing probability 2907, the merchandise higher in appeal power than the provision of the merchandise recommendation measures by using only the preference type graph can be extracted.
A customer group overlapping degree 3108 is a customer group overlapping degree between the preference types of a person who has purchased the subject merchandise (edible oil in
The respective embodiments of the present invention have been described above. However, the present invention includes various modifications without departing from the subject matter of the present invention. For example, in the abovementioned embodiments, in order to easily understand the present invention, the specific configurations are described. However, the present invention does not always provide all of the configurations described above. Also, a part of one configuration example can be replaced with another configuration example, and the configuration of one embodiment can be added with the configuration of another embodiment. Also, in a part of the respective configuration examples, another configuration can be added, deleted, or replaced.
The technique for creating the update draft of the preference type graph is not limited to only the above manner. For example, the customer group having the similar merchandise trend may be extracted by clustering to create an additional draft of a new preference type. In addition, with the extraction of the merchandise group likely to be purchased in the generated customer group on the basis of the demographic information of the client, after an arbitrary customer group and a merchandise group corresponding to the customer group have been extracted, a path additional draft between nodes of the preference type layer 120 and the merchandise attribute layer 130 which can describe the correspondence relationship between the customer group and the merchandise group may be created.
The system configuration of the present invention is not limited to that of
Also, some or all of the above-described respective configurations, functions, processors, processing means may be realized, for example, as an integrated circuit, or other hardware. Also, the above respective configurations and functions may be realized by allowing the processor to interpret and execute programs for realizing the respective functions. That is, the respective configurations and functions may be realized by software. The information on the program, table, and file for realizing the respective functions can be stored in a storage device such as a memory, a hard disc, or an SSD (Solid State Drive), or a storage medium such as an IC card, an SD card, or a DVD.
300: customer analysis device, 301: initial design data, 310: design data, 320: preference type estimator, 330: evaluator, 331: merchandise matching degree analysis unit, 332: customer matching degree analysis unit, 333: division analysis unit, 334: integration analysis unit, 335: update instruction data, 336: update unit, 341: merchandise matching degree vector, 342: customer matching degree list, 343: concurrent selling rate matrix data, 350: update parameter, 360: display, 370: updater, 381: purchasing history data, 1000: customer analysis system.
| Number | Date | Country | Kind |
|---|---|---|---|
| 2015-001540 | Jan 2015 | JP | national |
| Filing Document | Filing Date | Country | Kind |
|---|---|---|---|
| PCT/JP2015/071587 | 7/30/2015 | WO | 00 |
