2021
DOI: 10.1109/tkde.2019.2945573
|View full text |Cite
|
Sign up to set email alerts
|

On the Efficient Representation of Datasets as Graphs to Mine Maximal Frequent Itemsets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
8
1

Relationship

2
7

Authors

Journals

citations
Cited by 36 publications
(11 citation statements)
references
References 54 publications
0
11
0
Order By: Relevance
“…A popular Frequent Itemsets (FIs) mining is a task to find itemsets in a transactional database. The graph-based approach is used for the representation of a complete transactional database ( Halim, Ali & Khan, 2019 ).…”
Section: Review Overviewmentioning
confidence: 99%
“…A popular Frequent Itemsets (FIs) mining is a task to find itemsets in a transactional database. The graph-based approach is used for the representation of a complete transactional database ( Halim, Ali & Khan, 2019 ).…”
Section: Review Overviewmentioning
confidence: 99%
“…Various works [15][16][17][18][19][20][21] have been done on detecting sentence-level polarity with handcrafted features. Recent advances introduced neural network-based approaches [1,2,[22][23][24][25][26][27][28]. Despite such approaches yielding promising results, these do not cater to sentences expressing emotions on multiple topics.…”
Section: Related Workmentioning
confidence: 99%
“…Apart from these, there exist some linguistic‐based works on judicial documents, as in Halim, Ali, and Khan (2020), Halim and Rehan (2020) Metsker, Trofimov, Sikorsky, and Kovalchuk (2018), Tang and Kageura (2019) and Yuan, Lan, Hao, and Zhao (2019). These practical applications ensured strong motivation for research in the judicial text.…”
Section: Introductionmentioning
confidence: 99%