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
Neste artigo, introduzimos um novo padrão sequencial, o Padrão de sequência de usuário interativo (IUSP). Este padrão é útil para agrupar usuários altamente inter-relacionados em comunicações unidirecionais, como e-mail, SMS, etc., especialmente quando as comunicações incluem muitos usuários de spam. Além disso, propomos um algoritmo eficiente para descobrir IUSPs a partir de logs massivos de comunicação unidirecional contendo apenas as seguintes informações: remetentes, destinatários e datas e horas. Embora haja uma dificuldade em que o nosso novo padrão sequencial viole a Apriori propriedade, o algoritmo proposto apresenta excelente desempenho de processamento e baixo custo de armazenamento em experimentos em um conjunto de dados real.
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
Jihwan SONG, Deokmin HAAM, Yoon-Joon LEE, Myoung-Ho KIM, "Efficient Discovery of Highly Interrelated Users in One-Way Communications" in IEICE TRANSACTIONS on Information,
vol. E94-D, no. 3, pp. 714-717, March 2011, doi: 10.1587/transinf.E94.D.714.
Abstract: In this paper, we introduce a new sequential pattern, the Interactive User Sequence Pattern (IUSP). This pattern is useful for grouping highly interrelated users in one-way communications such as e-mail, SMS, etc., especially when the communications include many spam users. Also, we propose an efficient algorithm for discovering IUSPs from massive one-way communication logs containing only the following information: senders, receivers, and dates and times. Even though there is a difficulty in that our new sequential pattern violates the Apriori property, the proposed algorithm shows excellent processing performance and low storage cost in experiments on a real dataset.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E94.D.714/_p
Copiar
@ARTICLE{e94-d_3_714,
author={Jihwan SONG, Deokmin HAAM, Yoon-Joon LEE, Myoung-Ho KIM, },
journal={IEICE TRANSACTIONS on Information},
title={Efficient Discovery of Highly Interrelated Users in One-Way Communications},
year={2011},
volume={E94-D},
number={3},
pages={714-717},
abstract={In this paper, we introduce a new sequential pattern, the Interactive User Sequence Pattern (IUSP). This pattern is useful for grouping highly interrelated users in one-way communications such as e-mail, SMS, etc., especially when the communications include many spam users. Also, we propose an efficient algorithm for discovering IUSPs from massive one-way communication logs containing only the following information: senders, receivers, and dates and times. Even though there is a difficulty in that our new sequential pattern violates the Apriori property, the proposed algorithm shows excellent processing performance and low storage cost in experiments on a real dataset.},
keywords={},
doi={10.1587/transinf.E94.D.714},
ISSN={1745-1361},
month={March},}
Copiar
TY - JOUR
TI - Efficient Discovery of Highly Interrelated Users in One-Way Communications
T2 - IEICE TRANSACTIONS on Information
SP - 714
EP - 717
AU - Jihwan SONG
AU - Deokmin HAAM
AU - Yoon-Joon LEE
AU - Myoung-Ho KIM
PY - 2011
DO - 10.1587/transinf.E94.D.714
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E94-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2011
AB - In this paper, we introduce a new sequential pattern, the Interactive User Sequence Pattern (IUSP). This pattern is useful for grouping highly interrelated users in one-way communications such as e-mail, SMS, etc., especially when the communications include many spam users. Also, we propose an efficient algorithm for discovering IUSPs from massive one-way communication logs containing only the following information: senders, receivers, and dates and times. Even though there is a difficulty in that our new sequential pattern violates the Apriori property, the proposed algorithm shows excellent processing performance and low storage cost in experiments on a real dataset.
ER -