The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
A mineração de padrões correlacionados em grandes bancos de dados de transações é uma das tarefas essenciais na mineração de dados, uma vez que um grande número de padrões geralmente é extraído, mas é difícil encontrar padrões com a correlação. A análise de dados necessária deve ser feita de acordo com os requisitos da aplicação real específica. Nas abordagens de mineração anteriores, padrões com afinidade fraca são encontrados mesmo com um suporte mínimo alto. Neste artigo, sugerimos mineração de padrões de afinidade de suporte ponderado, na qual uma nova medida, a confiança de suporte ponderada (ws-confidence), é desenvolvida para identificar padrões correlacionados com a afinidade de suporte ponderada. Para podar eficientemente os padrões de afinidade fraca, provamos que a medida de confiança ws satisfaz as propriedades anti-monótonas e de suporte ponderado cruzado que podem ser aplicadas para eliminar padrões com níveis de suporte ponderados diferentes. Com base nas duas propriedades, desenvolvemos um algoritmo de mineração de padrões de afinidade de suporte ponderado (WSP). Os padrões de afinidade de suporte ponderados podem ser úteis para responder às questões de análise comparativa, como encontrar conjuntos de itens contendo itens que fornecem níveis de despesas totais de vendas semelhantes com uma faixa de erro aceitável α% e detectar listas de itens com níveis semelhantes de lucros totais. Além disso, nosso estudo de desempenho mostra que o WSP é eficiente e escalável para mineração de padrões de afinidade de suporte ponderados.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Unil YUN, "On Identifying Useful Patterns to Analyze Products in Retail Transaction Databases" in IEICE TRANSACTIONS on Information,
vol. E92-D, no. 12, pp. 2430-2438, December 2009, doi: 10.1587/transinf.E92.D.2430.
Abstract: Mining correlated patterns in large transaction databases is one of the essential tasks in data mining since a huge number of patterns are usually mined, but it is hard to find patterns with the correlation. The needed data analysis should be made according to the requirements of the particular real application. In previous mining approaches, patterns with the weak affinity are found even with a high minimum support. In this paper, we suggest weighted support affinity pattern mining in which a new measure, weighted support confidence (ws-confidence) is developed to identify correlated patterns with the weighted support affinity. To efficiently prune the weak affinity patterns, we prove that the ws-confidence measure satisfies the anti-monotone and cross weighted support properties which can be applied to eliminate patterns with dissimilar weighted support levels. Based on the two properties, we develop a weighted support affinity pattern mining algorithm (WSP). The weighted support affinity patterns can be useful to answer the comparative analysis queries such as finding itemsets containing items which give similar total selling expense levels with an acceptable error range α% and detecting item lists with similar levels of total profits. In addition, our performance study shows that WSP is efficient and scalable for mining weighted support affinity patterns.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.2430/_p
Copiar
@ARTICLE{e92-d_12_2430,
author={Unil YUN, },
journal={IEICE TRANSACTIONS on Information},
title={On Identifying Useful Patterns to Analyze Products in Retail Transaction Databases},
year={2009},
volume={E92-D},
number={12},
pages={2430-2438},
abstract={Mining correlated patterns in large transaction databases is one of the essential tasks in data mining since a huge number of patterns are usually mined, but it is hard to find patterns with the correlation. The needed data analysis should be made according to the requirements of the particular real application. In previous mining approaches, patterns with the weak affinity are found even with a high minimum support. In this paper, we suggest weighted support affinity pattern mining in which a new measure, weighted support confidence (ws-confidence) is developed to identify correlated patterns with the weighted support affinity. To efficiently prune the weak affinity patterns, we prove that the ws-confidence measure satisfies the anti-monotone and cross weighted support properties which can be applied to eliminate patterns with dissimilar weighted support levels. Based on the two properties, we develop a weighted support affinity pattern mining algorithm (WSP). The weighted support affinity patterns can be useful to answer the comparative analysis queries such as finding itemsets containing items which give similar total selling expense levels with an acceptable error range α% and detecting item lists with similar levels of total profits. In addition, our performance study shows that WSP is efficient and scalable for mining weighted support affinity patterns.},
keywords={},
doi={10.1587/transinf.E92.D.2430},
ISSN={1745-1361},
month={December},}
Copiar
TY - JOUR
TI - On Identifying Useful Patterns to Analyze Products in Retail Transaction Databases
T2 - IEICE TRANSACTIONS on Information
SP - 2430
EP - 2438
AU - Unil YUN
PY - 2009
DO - 10.1587/transinf.E92.D.2430
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E92-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2009
AB - Mining correlated patterns in large transaction databases is one of the essential tasks in data mining since a huge number of patterns are usually mined, but it is hard to find patterns with the correlation. The needed data analysis should be made according to the requirements of the particular real application. In previous mining approaches, patterns with the weak affinity are found even with a high minimum support. In this paper, we suggest weighted support affinity pattern mining in which a new measure, weighted support confidence (ws-confidence) is developed to identify correlated patterns with the weighted support affinity. To efficiently prune the weak affinity patterns, we prove that the ws-confidence measure satisfies the anti-monotone and cross weighted support properties which can be applied to eliminate patterns with dissimilar weighted support levels. Based on the two properties, we develop a weighted support affinity pattern mining algorithm (WSP). The weighted support affinity patterns can be useful to answer the comparative analysis queries such as finding itemsets containing items which give similar total selling expense levels with an acceptable error range α% and detecting item lists with similar levels of total profits. In addition, our performance study shows that WSP is efficient and scalable for mining weighted support affinity patterns.
ER -