Teguh Bharata Adji

dblp:11/2270 · DBLP profile ↗
← Back
8ranked-venue papers
0as first author
1since 2021 · last 2026
0000-0001-7856-1498ORCID · corroborated

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

Artificial intelligence and machine learning · 3Databases, data management, data science and information retrieval · 2 · 1 since 2021Software engineering, systems software and programming languages · 1Graphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous computing · 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

TopicWeightPapersLastEvidence papers
Data integration and cleaning
data transformation
0.412020
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.412020
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.112020
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
YearPublicationVenuePosition
2026 Global mean-centered correlation: A variance-reduced and theoretically grounded similarity measure for sparse data environments
Slamet Wiyono, Teguh Bharata Adji, Hanung Adi Nugroho, Sunu Wibirama
Inf. Sci.2
2020 Enhanced Graph Transforming V2 Algorithm for Non-Simple Graph in Big Data Pre-Processing
abstract
Incapability 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.3
2019 Development and evaluation of adaptive metacognitive scaffolding for algorithm-learning system
abstract
Adaptive 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.2
2019 Unsupervised software defect prediction using signed Laplacian-based spectral classifier
Aris Marjuni, Teguh Bharata Adji, Ridi Ferdiana
Soft Comput.2
2018 Improvement of fusion algorithm using cascade method and implementation on proxy server for replacing negative content on a porn site
abstract
The development of negative sites brings harm to users of the Internet, especially among teenagers. One way to block these sites is to provide a list of sites that are categorized as negative. However, the problem is that every day new sites appear that have not been listed yet. Therefore an intelligent system that can detect the content and can automatically update the list is needed. Negative content on a website can consist of text, image, and video contents that require different parsing techniques and classifiers to separate and classify such contents. Each classifier produces a probability. Hence, an algorithm that can combine these probabilities is required. Fusion algorithm can combine the probabilities of text, images, and video contents. However, the algorithm does not work on websites which have an equal proportion of negative and positive images, i.e. grey websites. These websites require specific handling such as a cascade fusion algorithm to change the sensitivity so it can reduce the level of over blocking. The results show that after the modification of the fusion algorithm, the accuracy of the classifier increased from 91.62% to 98.49% because the rate of over blocking could be reduced.
Yosua Alvin Adi Soetrisno, Selo Sulistyo, Ridi Ferdiana, Teguh Bharata Adji
Web Intell.4
2017 Multiple layer data hiding scheme based on difference expansion of quad
Aulia Arham, Hanung Adi Nugroho, Teguh Bharata Adji
Signal Process.3
2016 Work in progress: Application of unsupervised learning method toward student's metacognition assessment
abstract
There 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
EDUCON2
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)3