<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>Faculty of Computing</title>
<link href="https://onlineresource.ucsy.edu.mm/handle/123456789/29" rel="alternate"/>
<subtitle/>
<id>https://onlineresource.ucsy.edu.mm/handle/123456789/29</id>
<updated>2026-06-08T10:29:18Z</updated>
<dc:date>2026-06-08T10:29:18Z</dc:date>
<entry>
<title>Topic Extraction of Crawled Documents Collection using Correlated Topic Model in MapReduce Framework</title>
<link href="https://onlineresource.ucsy.edu.mm/handle/123456789/2602" rel="alternate"/>
<author>
<name>Oo, Mi Khine</name>
</author>
<author>
<name>Khine, May Aye</name>
</author>
<id>https://onlineresource.ucsy.edu.mm/handle/123456789/2602</id>
<updated>2022-04-24T08:25:21Z</updated>
<published>2019-12-01T00:00:00Z</published>
<summary type="text">Topic Extraction of Crawled Documents Collection using Correlated Topic Model in MapReduce Framework
Oo, Mi Khine; Khine, May Aye
The tremendous increase in the amount of available research documents impels researchers to propose &#13;
topic models to extract the latent semantic themes of a documents collection. However, how to extract the &#13;
hidden topics of the documents collection has become a crucial task for many topic model applications. &#13;
Moreover, conventional topic modeling approaches suffer from the scalability problem when the size of &#13;
documents collection increases. In this paper, the Correlated Topic Model with variational Expectation Maximization algorithm is implemented in MapReduce framework to solve the scalability problem. The &#13;
proposed approach utilizes the dataset crawled from the public digital library. In addition, the full-texts of &#13;
the crawled documents are analysed to enhance the accuracy of MapReduce CTM. The experiments are &#13;
conducted to demonstrate the performance of the proposed algorithm. From the evaluation, the proposed &#13;
approach has a comparable performance in terms of topic coherences with LDA implemented in &#13;
MapReduce framework.
Topic Extraction of Crawled Documents Collection using Correlated Topic Model in MapReduce Framework
</summary>
<dc:date>2019-12-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Correlated Topic Modeling for Big Data with MapReduce</title>
<link href="https://onlineresource.ucsy.edu.mm/handle/123456789/2601" rel="alternate"/>
<author>
<name>Oo, Mi Khine</name>
</author>
<author>
<name>Khine, May Aye</name>
</author>
<id>https://onlineresource.ucsy.edu.mm/handle/123456789/2601</id>
<updated>2022-04-24T08:15:21Z</updated>
<published>2018-10-01T00:00:00Z</published>
<summary type="text">Correlated Topic Modeling for Big Data with MapReduce
Oo, Mi Khine; Khine, May Aye
Efficient extraction of useful information is a &#13;
rising problem in Big data, since the amount of information &#13;
being gathered across various domains grows with an increasing &#13;
rate. So, it takes more time to understand the underlying themes &#13;
of the documents collection. To deal with such problem in the &#13;
context of Big data, the proposed approach implements the &#13;
correlated topic model (CTM) with MapReduce framework to &#13;
reveal the thematic information represented by words, to speed &#13;
up the processing and to increase the scalability of the model. &#13;
We apply variational Expectation-Maximization (EM) to make &#13;
inference for CTM. In this paper, academic articles are collected &#13;
by using a web crawler. Then CTM is exploited to uncover the &#13;
underlying themes of the collection. The use of CTM with &#13;
MapReduce implementation improves the accuracy and &#13;
performance in a reliable and scalable manner.
Correlated Topic Modeling for Big Data with MapReduce
</summary>
<dc:date>2018-10-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Science-related Articles Recommendation System from Big Data</title>
<link href="https://onlineresource.ucsy.edu.mm/handle/123456789/2600" rel="alternate"/>
<author>
<name>Oo, Mi Khine</name>
</author>
<author>
<name>Khaing, Myo Kay</name>
</author>
<id>https://onlineresource.ucsy.edu.mm/handle/123456789/2600</id>
<updated>2022-04-24T08:10:21Z</updated>
<published>2016-02-01T00:00:00Z</published>
<summary type="text">Science-related Articles Recommendation System from Big Data
Oo, Mi Khine; Khaing, Myo Kay
Under the explosive increase of global data, &#13;
the term Big data is mainly used to describe &#13;
enormous datasets. With the availability of &#13;
increasingly large quantities of digital &#13;
information, it is becoming more difficult for &#13;
researchers to extract and find relevant articles &#13;
pertinent to their interests. In this system, we &#13;
propose an approach to discover and &#13;
recommend the desired articles by combining &#13;
collaborative filtering (CF) with topic modeling. &#13;
Correlated Topic Model (CTM) is used for &#13;
modeling topics. Our approach not only&#13;
considers the interactions between users through &#13;
collaborative filtering but also learns the &#13;
properties of items involved through topic &#13;
modeling to improve recommendation. In order &#13;
to handle a large dataset, a Big data analytics &#13;
tool Hadoop is used to perform processing over &#13;
distributed clusters. The proposed approach &#13;
learns the accuracy of the recommendation.
Science-related Articles Recommendation System from Big Data
</summary>
<dc:date>2016-02-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>A Study on Community Overlapping Detection Algorithms in Social Networks</title>
<link href="https://onlineresource.ucsy.edu.mm/handle/123456789/2507" rel="alternate"/>
<author>
<name>Win, Eaint Mon</name>
</author>
<author>
<name>Khine, May Aye</name>
</author>
<id>https://onlineresource.ucsy.edu.mm/handle/123456789/2507</id>
<updated>2020-03-17T12:19:55Z</updated>
<published>2020-02-28T00:00:00Z</published>
<summary type="text">A Study on Community Overlapping Detection Algorithms in Social Networks
Win, Eaint Mon; Khine, May Aye
Community detection is one of the most important research area wherein invention and growth&#13;
of social networks. Community is a set of members densely connected within a group and sparely connected&#13;
with the other groups. In social networks, the singular characteristic of communities is multi membership of a&#13;
node resulting in overlapping communities. Another relevant feature of social networks is the possibility to&#13;
evolve over time. In recent years, many researchers have worked on various methods that can efficiently&#13;
unveil overlapped structure on dynamic network. This paper reviews the previous studies done on the&#13;
problem of overlapping community detection algorithms. Moreover, some approaches for dynamic network&#13;
that change from time to time are also described.
</summary>
<dc:date>2020-02-28T00:00:00Z</dc:date>
</entry>
</feed>
