Follow
Umair Muhammad
Title
Cited by
Cited by
Year
An effective graph summarization and compression technique for a large-scaled graph
H Seo, K Park, Y Han, H Kim, M Umair, KU Khan, YK Lee
The Journal of Supercomputing, 1-15, 2018
92018
LPaMI: A Graph-Based Lifestyle Pattern Mining Application Using Personal Image Collections in Smartphones
KU Khan, A Alam, B Dolgorsuren, MA Uddin, M Umair, U Sang, ...
Applied Sciences 7 (12), 1200, 2017
42017
Efficient Frequent Pattern Management and Compression System in Multiple Named Graphs
T Sultana, U Qudus, M Umair, T Kim, MG Morshed, YK Lee
한국정보과학회 학술발표논문집, 38-40, 2020
32020
Graph pattern detection and structural redundancy reduction to compress named graphs
T Sultana, MD Hossain, M Umair, MN Khan, A Alam, YK Lee
Information Sciences 647, 119428, 2023
22023
Distributed In-memory Granularity-based Time-Series Graph Compression
A Alam, M Umair, B Dolgorsuren, MR Akhond, MAS Ali, U Qudus, YK Lee
한국정보과학회 학술발표논문집, 235-237, 2018
12018
BLOCK Formulation technique for Compressed Graph Computation
M Umair, MK Rasel, YK Lee
한국정보과학회 학술발표논문집, 263-265, 2017
12017
iRun: Horizontal and Vertical Shape of a Region-Based Graph Compression
M Umair, L Young, Koo
Sensors 22 (24), 2022
2022
Adjustor: Mining on Compressed Graph with Adjacency Information Constructor while exploiting Parallel Computing
M Umair, S Tangina, L Young, Koo
[한국정보과학회] KDBC 2021 : Korean DataBase Conference 2021 At: Daejeon, 2021
2021
An improved co-training approach for document Sentiment classification
J Khan, A Alam, MN Khan, I Ullah, M Umair, U Qudus, TH Afridi, SS Park, ...
한국정보과학회 학술발표논문집, 791-793, 2020
2020
An Efficient RDF Graph Summarization Framework
VTT Duong, M Umair, YK Lee
한국정보과학회 학술발표논문집, 152-154, 2019
2019
EnvOnto: An ontology for current and future Environmental datasets
U Qudus, MS Islam, M Umair, YK Lee
한국정보과학회 학술발표논문집, 196-198, 2019
2019
A large scale graph processing using Low Latency Optane SSD
B Dolgorsuren, M Umair, YK Lee
한국정보과학회 학술발표논문집, 21-23, 2019
2019
The system can't perform the operation now. Try again later.
Articles 1–12