Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Inah Jeon

dblp:163/3947 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
3 papers
Data mining · 96% Graph data management · 4%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › big data analytics › large-scale data mining
distributed data mining
0.522016
SCouT: Scalable coupled matrix-tensor factorization - algorithm and discoveries · ICDE 2016
HaTen2: Billion-scale tensor decompositions · ICDE 2015
Data mining › multidimensional data analysis › multiway data analysis › tensor analysis
tensor factorization
0.522016
SCouT: Scalable coupled matrix-tensor factorization - algorithm and discoveries · ICDE 2016
HaTen2: Billion-scale tensor decompositions · ICDE 2015
Data mining › multidimensional data analysis › multiway data analysis › tensor analysis › tensor factorization
coupled matrix-tensor factorization
0.212016
SCouT: Scalable coupled matrix-tensor factorization - algorithm and discoveries · ICDE 2016
Data mining › multidimensional data analysis › multiway data analysis › tensor analysis › tensor factorization
tensor mining
0.212016
Mining billion-scale tensors: algorithms and discoveries · VLDB J. 2016
Data mining › multidimensional data analysis › multiway data analysis › tensor analysis › tensor factorization
distributed tensor factorization
0.212015
HaTen2: Billion-scale tensor decompositions · ICDE 2015

Methods — techniques the papers use, named apart from their topics

mapreduce · 0.5tensor decomposition · 0.2coupled matrix-tensor factorization · 0.2
YearPublicationVenuePosition
2016 SCouT: Scalable coupled matrix-tensor factorization - algorithm and discoveries
abstract
How can we analyze very large real-world tensors where additional information is coupled with certain modes of tensors? Coupled matrix-tensor factorization is a useful tool to simultaneously analyze matrices and a tensor, and has been used for important applications including collaborative filtering, multi-way clustering, and link prediction. However, existing single machine or distributed algorithms for coupled matrix-tensor factorization do not scale for tensors with billions of elements in each mode. In this paper, we propose SCOUT, a large-scale coupled matrix-tensor factorization algorithm running on the distributed MAPREDUCE platform. By carefully reorganizing operations, and reusing intermediate data, SCOUT decomposes up to 100× larger tensors than existing methods, and shows linear scalability for order and machines while other methods are limited in scalability. We also apply SCOUT on real world tensors and discover interesting hidden patterns like seasonal spike, and steady attentions for healthy food on Yelp dataset containing user-business-yearmonth tensor and two coupled matrices.
Byungsoo Jeon, Inah Jeon, Lee Sael, U Kang
ICDE2
2016 Mining billion-scale tensors: algorithms and discoveries
Inah Jeon, Evangelos E. Papalexakis, Christos Faloutsos, Lee Sael, U Kang
VLDB J.1
2015 HaTen2: Billion-scale tensor decompositions
abstract
How can we find useful patterns and anomalies in large scale real-world data with multiple attributes? For example, network intrusion logs, with (source-ip, target-ip, port-number, timestamp)? Tensors are suitable for modeling these multi-dimensional data, and widely used for the analysis of social networks, web data, network traffic, and in many other settings. However, current tensor decomposition methods do not scale for tensors with millions and billions of rows, columns and `fibers', that often appear in real datasets. In this paper, we propose HaTen2, a scalable distributed suite of tensor decomposition algorithms running on the MapReduce platform. By carefully reordering the operations, and exploiting the sparsity of real world tensors, HaTen2 dramatically reduces the intermediate data, and the number of jobs. As a result, using HaTen2, we analyze big real-world tensors that can not be handled by the current state of the art, and discover hidden concepts.
Inah Jeon, Evangelos E. Papalexakis, U Kang, Christos Faloutsos
ICDE1