Transaction item embedding by maximizing a joint probability

Yutaro Ueno, Masaomi Kimura

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Frequent pattern mining plays an important role in the data mining field. This topic has been studied for a long time. Most of the method which finds frequent pattern mining is high computational cost. In general, transaction data is sparse. Therefore, searching frequent itemsets in a dense part of transaction data is better than searching all transaction data. In this paper, we propose a method to embed items from transactions to a low dimensional vector space. We show the relationship between transaction data and a low dimensional vector space which is created by our method.

Original languageEnglish
Title of host publication2019 IEEE 4th International Conference on Computer and Communication Systems, ICCCS 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages5-8
Number of pages4
ISBN (Electronic)9781728113227
DOIs
Publication statusPublished - 2019 Feb
Event4th IEEE International Conference on Computer and Communication Systems, ICCCS 2019 - Singapore, Singapore
Duration: 2019 Feb 232019 Feb 25

Publication series

Name2019 IEEE 4th International Conference on Computer and Communication Systems, ICCCS 2019

Conference

Conference4th IEEE International Conference on Computer and Communication Systems, ICCCS 2019
CountrySingapore
CitySingapore
Period19/2/2319/2/25

Fingerprint

Vector spaces
Data mining
Costs

Keywords

  • Data mining
  • F requent pattern mining
  • Itemset mining
  • Machine learning
  • Transaction dataset

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Networks and Communications
  • Computer Vision and Pattern Recognition
  • Information Systems

Cite this

Ueno, Y., & Kimura, M. (2019). Transaction item embedding by maximizing a joint probability. In 2019 IEEE 4th International Conference on Computer and Communication Systems, ICCCS 2019 (pp. 5-8). [8821745] (2019 IEEE 4th International Conference on Computer and Communication Systems, ICCCS 2019). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CCOMS.2019.8821745

Transaction item embedding by maximizing a joint probability. / Ueno, Yutaro; Kimura, Masaomi.

2019 IEEE 4th International Conference on Computer and Communication Systems, ICCCS 2019. Institute of Electrical and Electronics Engineers Inc., 2019. p. 5-8 8821745 (2019 IEEE 4th International Conference on Computer and Communication Systems, ICCCS 2019).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ueno, Y & Kimura, M 2019, Transaction item embedding by maximizing a joint probability. in 2019 IEEE 4th International Conference on Computer and Communication Systems, ICCCS 2019., 8821745, 2019 IEEE 4th International Conference on Computer and Communication Systems, ICCCS 2019, Institute of Electrical and Electronics Engineers Inc., pp. 5-8, 4th IEEE International Conference on Computer and Communication Systems, ICCCS 2019, Singapore, Singapore, 19/2/23. https://doi.org/10.1109/CCOMS.2019.8821745
Ueno Y, Kimura M. Transaction item embedding by maximizing a joint probability. In 2019 IEEE 4th International Conference on Computer and Communication Systems, ICCCS 2019. Institute of Electrical and Electronics Engineers Inc. 2019. p. 5-8. 8821745. (2019 IEEE 4th International Conference on Computer and Communication Systems, ICCCS 2019). https://doi.org/10.1109/CCOMS.2019.8821745
Ueno, Yutaro ; Kimura, Masaomi. / Transaction item embedding by maximizing a joint probability. 2019 IEEE 4th International Conference on Computer and Communication Systems, ICCCS 2019. Institute of Electrical and Electronics Engineers Inc., 2019. pp. 5-8 (2019 IEEE 4th International Conference on Computer and Communication Systems, ICCCS 2019).
@inproceedings{65e5c1d36ba540faa02b5d079168dca8,
title = "Transaction item embedding by maximizing a joint probability",
abstract = "Frequent pattern mining plays an important role in the data mining field. This topic has been studied for a long time. Most of the method which finds frequent pattern mining is high computational cost. In general, transaction data is sparse. Therefore, searching frequent itemsets in a dense part of transaction data is better than searching all transaction data. In this paper, we propose a method to embed items from transactions to a low dimensional vector space. We show the relationship between transaction data and a low dimensional vector space which is created by our method.",
keywords = "Data mining, F requent pattern mining, Itemset mining, Machine learning, Transaction dataset",
author = "Yutaro Ueno and Masaomi Kimura",
year = "2019",
month = "2",
doi = "10.1109/CCOMS.2019.8821745",
language = "English",
series = "2019 IEEE 4th International Conference on Computer and Communication Systems, ICCCS 2019",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "5--8",
booktitle = "2019 IEEE 4th International Conference on Computer and Communication Systems, ICCCS 2019",

}

TY - GEN

T1 - Transaction item embedding by maximizing a joint probability

AU - Ueno, Yutaro

AU - Kimura, Masaomi

PY - 2019/2

Y1 - 2019/2

N2 - Frequent pattern mining plays an important role in the data mining field. This topic has been studied for a long time. Most of the method which finds frequent pattern mining is high computational cost. In general, transaction data is sparse. Therefore, searching frequent itemsets in a dense part of transaction data is better than searching all transaction data. In this paper, we propose a method to embed items from transactions to a low dimensional vector space. We show the relationship between transaction data and a low dimensional vector space which is created by our method.

AB - Frequent pattern mining plays an important role in the data mining field. This topic has been studied for a long time. Most of the method which finds frequent pattern mining is high computational cost. In general, transaction data is sparse. Therefore, searching frequent itemsets in a dense part of transaction data is better than searching all transaction data. In this paper, we propose a method to embed items from transactions to a low dimensional vector space. We show the relationship between transaction data and a low dimensional vector space which is created by our method.

KW - Data mining

KW - F requent pattern mining

KW - Itemset mining

KW - Machine learning

KW - Transaction dataset

UR - http://www.scopus.com/inward/record.url?scp=85072983300&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85072983300&partnerID=8YFLogxK

U2 - 10.1109/CCOMS.2019.8821745

DO - 10.1109/CCOMS.2019.8821745

M3 - Conference contribution

AN - SCOPUS:85072983300

T3 - 2019 IEEE 4th International Conference on Computer and Communication Systems, ICCCS 2019

SP - 5

EP - 8

BT - 2019 IEEE 4th International Conference on Computer and Communication Systems, ICCCS 2019

PB - Institute of Electrical and Electronics Engineers Inc.

ER -