default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRedwan Ahmed Rizvee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j3]Redwan Ahmed Rizvee
, Chowdhury Farhan Ahmed, Carson K. Leung:
A tree-based framework to mine top-K closed sequential patterns. Appl. Intell. 55(3): 221 (2025)- 2024
- [j2]Redwan Ahmed Rizvee, Raheeb Hassan, Md. Mosaddek Khan:
Reinforcement Learning-Based Formulations With Hamiltonian-Inspired Loss Functions for Combinatorial Optimization Over Graphs. IEEE Access 12: 171055-171065 (2024) - [j1]Redwan Ahmed Rizvee, Chowdhury Farhan Ahmed, Md. Fahim Arefin, Carson K. Leung:
A new tree-based approach to mine sequential patterns. Expert Syst. Appl. 242: 122754 (2024) - [i4]Mohidul Haque Mridul, Mohammad Foysal Khan, Redwan Ahmed Rizvee, Md. Mosaddek Khan:
Adaptive Opponent Policy Detection in Multi-Agent MDPs: Real-Time Strategy Switch Identification Using Running Error Estimation. CoRR abs/2406.06500 (2024) - 2023
- [c7]Faisal Haque Bappy, Saklain Zaman, Tariqul Islam, Redwan Ahmed Rizvee, Joon S. Park, Kamrul Hasan:
Towards Immutability: A Secure and Efficient Auditing Framework for Cloud Supporting Data Integrity and File Version Control. GLOBECOM 2023: 6801-6806 - [i3]Faisal Haque Bappy, Saklain Zaman, Tariqul Islam, Redwan Ahmed Rizvee, Joon S. Park, Kamrul Hasan:
Towards Immutability: A Secure and Efficient Auditing Framework for Cloud Supporting Data Integrity and File Version Control. CoRR abs/2308.04453 (2023) - [i2]Redwan Ahmed Rizvee, Md. Mosaddek Khan:
Understanding the Usage of QUBO-based Hamiltonian Function in Combinatorial Optimization over Graphs: A Discussion Using Max Cut (MC) Problem. CoRR abs/2308.13978 (2023) - [i1]Redwan Ahmed Rizvee, Raheeb Hassan, Md. Mosaddek Khan:
A Graph Neural Network-Based QUBO-Formulated Hamiltonian-Inspired Loss Function for Combinatorial Optimization using Reinforcement Learning. CoRR abs/2311.16277 (2023) - 2022
- [c6]Mohammad Fahim Arefin, Chowdhury Farhan Ahmed, Redwan Ahmed Rizvee, Carson K. Leung, Longbing Cao:
Mining Contextual Item Similarity without Concept Hierarchy. IMCOM 2022: 1-8 - [c5]Redwan Ahmed Rizvee, Mohammad Fahim Arefin, Marzan Binte Abid:
A Robust Objective Focused Algorithm to Detect Source Code Plagiarism. UEMCON 2022: 109-115 - 2021
- [c4]Redwan Ahmed Rizvee, Moinul Zaber:
How Newspapers Portrayed COVID-19 - A Study Based on United Kingdom and Bangladesh. ANTICOVID 2021: 41-52 - 2020
- [c3]Redwan Ahmed Rizvee, Mohammad Fahim Arefin, Chowdhury Farhan Ahmed:
Tree-Miner: Mining Sequential Patterns from SP-Tree. PAKDD (2) 2020: 44-56
2010 – 2019
- 2019
- [c2]Umama Dewan, Chowdhury Farhan Ahmed, Carson K. Leung, Redwan Ahmed Rizvee, Deyu Deng, Joglas Souza:
An efficient approach for mining weighted frequent patterns with dynamic weights. ICDM 2019: 13-27 - [c1]Redwan Ahmed Rizvee, Md Shahadat Hossain Shahin, Chowdhury Farhan Ahmed, Carson K. Leung, Deyu Deng, Jiaxing Jason Mai:
Sliding window based weighted periodic pattern mining over time series data. ICDM 2019: 118-132
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-27 00:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
