A bevásárlókosár modelljének alkalmazása a fluidumcsomópontok osztályozására
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
Budapesti Gazdasági Főiskola
2014
|
| Sorozat: | Prosperitas
1 No. 2 |
| Tárgyszavak: | |
| Kulcsszavak: | Vásárlói kosár Gyakori termékek Asszociációs szabály Osztályozás Market basket Frequent item Association rule Classification |
| Online Access: | http://publikaciotar.uni-bge.hu/725 |
| Kivonat: | In the paper we show a modeling method for market baskets and its applications in the study of service processes. Te discovery of frequent market baskets, as well as the exploitation of the associations between items is always an interesting topics for the researchers. In the previous studies the purchases and transactions of customers are analysed on the item level. Recently in some researches the customers purchases and transactions have been studied quantitatively: the studies concerned with not only the items, but with the quantity of each item or service that the customers or the clients required, and furthermore, with the structure of the required items or the relationships of the service processes. In this research the modeling method for market baskets based on the quantitative analysis is described and studied further. With an formal description of the model it is shown in this paper that the structure of the items or the relationships of the services required by the customers or the clients can be studied thoroughly in this approach. It is shown also that this approach is suitable for the studies of customers and clients, including their classification. One of the advantages is that, as it is described in this approach, the natural relationships between the required items or services become clearer, if they are considered in a partially ordered, network structure. Some previously-considered problems can be studied in this generalized model with the tools of network theory. In this paper after the description of the explicit representation of frequent market baskets and associations, as well as their computing algorithms we introduce a new concept of customer classification and related d-neighborhood. We show also in this paper a method to define the d-neighborhood between the customer groups or between the nodes in a service process that in some case is more efficient. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 75-87 |
| ISSN: | 2064-759X |