EDBT 2026 Demo / reviewers in the wild / expert
Noor Akhmad Setiawan
dblp:58/590
· DBLP profile ↗
5ranked-venue papers
0as first author
1since 2021 · last 2024
0000-0002-5631-1073ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Human-computer interaction and ubiquitous computing · 2 · 1 since 2021Artificial intelligence and machine learning · 1Software engineering, systems software and programming languages · 1Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1
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
1 paper |
Data integration and cleaning · 100% | |
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Storage systems · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data integration and cleaning
data transformation |
0.4 | 1 | 2020 | Enhanced Graph Transforming V2 Algorithm for Non-Simple Graph in Big Data Pre-Processing · IEEE Trans. Knowl. Data Eng. 2020 |
Graph algorithms and graph theory › graph theory
graph transformation |
0.4 | 1 | 2020 | Enhanced Graph Transforming V2 Algorithm for Non-Simple Graph in Big Data Pre-Processing · IEEE Trans. Knowl. Data Eng. 2020 |
Storage systems › key-value storage
NoSQL database |
0.1 | 1 | 2020 | Enhanced Graph Transforming V2 Algorithm for Non-Simple Graph in Big Data Pre-Processing · IEEE Trans. Knowl. Data Eng. 2020 |
Methods — techniques the papers use, named apart from their topics
graph transforming algorithm · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Robust Object Selection in Spontaneous Gaze-Controlled Application Using Exponential Moving Average and Hidden Markov ModelabstractThe human gaze is a promising input modality for interactive applications due to its advantages: giving benefits to motion-impaired people while providing faster, intuitive, and easy interaction. The most common form of gaze interaction is object selection. During the last decade, gaze gestures and smooth pursuit-based interaction have been emerging techniques for spontaneous object selection in various gaze-controlled applications. Unfortunately, the challenge of spontaneous interaction demands no prior gaze-to-screen calibration, which leads to inaccurate object selection. To overcome the accuracy issue, this article proposes a novel method for spontaneous gaze interaction based on Pearson product-moment correlation as a measure of similarity, an exponential moving average filter for signal denoising, and a hidden Markov model to perform eye movement classification. Based on experimental results, our approach yielded the best object selection accuracy and success time of$\text{89.60}\pm \text{10.59}\%$and$\text{4364}\pm \text{235.86}$ms, respectively. Our results imply that spontaneous interaction for gaze-controlled applications is possible with careful consideration of the underlying techniques to handle noisy data generated by the eye tracker. Furthermore, the proposed method is promising for future development of interactive touchless display systems that comply with the health protocols of the World Health Organization during the COVID-19 pandemic. Suatmi Murnani, Noor Akhmad Setiawan, Sunu Wibirama |
IEEE Trans. Hum. Mach. Syst. | 2 |
| 2020 | Enhanced Graph Transforming V2 Algorithm for Non-Simple Graph in Big Data Pre-ProcessingabstractIncapability of relational database in handling large-scale data triggers the development of NoSQL database that becomes part of a big data ecosystem. NoSQL database has different characteristics compared to the relational database. However, NoSQL database requires data from the relational database as one of the structured data sources. Therefore, data pre-processing is required to ensure proper data migration from a relational database to NoSQL database. This data pre-processing is normally called data transformation. One of the simple and understandable transformation algorithms is graph transforming algorithm. However, the algorithm has a problem in solving a non-simple graph (multigraph). This research proposes an algorithm to overcome several multigraph problems. The experimental work confirms that the algorithm proposed in this research is able to transform data from a relational database to NoSQL schema that has a minimum number of redundant attributes while the data completeness is still maintained. Sutedi Sutedi, Noor Akhmad Setiawan, Teguh Bharata Adji |
IEEE Trans. Knowl. Data Eng. | 2 |
| 2019 | Development and evaluation of adaptive metacognitive scaffolding for algorithm-learning systemabstractAdaptive metacognitive scaffolding is developed to provide learning assistance on an as‐needed basis; thus, advances the effectiveness of computer‐based learning systems. Metacognitive scaffoldings have been developed for some science subjects; however, not for algorithm‐learning. The learning algorithm is different from learning science as it is more oriented to problem‐solving; therefore, this study is aimed to describe the modelling, development, and evaluation of the adaptive metacognitive scaffolding which is dedicated for encouraging algorithm‐learning. In addition, the authors present a new approach for learner modelling to find students’ metacognitive state. Adaptivity of the scaffolding is based on the learner modelling. To evaluate the effectiveness of the developed system, it is deployed in a real algorithm‐learning classroom of 38 students. The class is randomly divided into two groups: experiment and control. Two parameters are measured from both groups, i.e. academic success and academic satisfaction. Non‐parametric statistical test, i.e. Mann–Whitney U‐test (significance level 0.01) rejects the null hypothesis (U‐value = 86.5 and U‐critical = 101). This result verifies that the academic success of the experiment group is significantly higher than that of the control group. In addition, an academic satisfaction survey shows that adaptive scaffolding is valid in assisting students while learning with the system. Indriana Hidayah, Teguh Bharata Adji, Noor Akhmad Setiawan |
IET Softw. | 3 |
| 2016 | Work in progress: Application of unsupervised learning method toward student's metacognition assessmentabstractThere has been awareness of the importance of metacognitive skill in learning processes, especially for university students, who are required to be more self-regulated. Therefore, monitoring the development of such skill is needed to ensure student's achievements. Currently, in classroom learning environments, student's metacognition can be observed conventionally by using interview or think-aloud procedures, however, the tasks are tedious and impractical for big number of students. Therefore, an automatic student's metacognition assessment/modeling is in progress. This paper proposes a partly automatic metacognition assessment, which is an implementation of unsupervised learning method. This proposed method is proven using a case study in which the dataset was gathered by administering Metacognitive Awareness Inventory (MAI) questionnaire to undergraduate students in our department. Experiment shows that the proposed method could be utilized for automatic assessment of student's metacognition. Two groups of students are identified, one that does well in their metacognitive awareness and the other one that needs further guidance and advisory to help them achieve better results and avoid failures. Indriana Hidayah, Teguh Bharata Adji, Noor Akhmad Setiawan, Kartika Maharani |
EDUCON | 3 |
| 2016 | Analytical Incremental Learning: Fast Constructive Learning Method for Neural Network
Syukron Abu Ishaq Alfarozi, Noor Akhmad Setiawan, Teguh Bharata Adji, Kuntpong Woraratpanya, Kitsuchart Pasupa, Masanori Sugimoto |
ICONIP (2) | 2 |