Implementasi dan Evaluasi Visualisasi Data Interaktif pada Publikasi Laporan Bulanan Data Sosial Ekonomi Indonesia

Setiap bulan BPS mempublikasikan buku LBDSE Indonesia, dimana di dalam publikasi tersebut berisi perkembangan dari 18 topik data beserta visualisasinya. Namun, visualisasi data pada publikasi LBDSE tidak lengkap dan hanya bersifat statis, sedangkan data yang ada memiliki dimensi/variabel yang cukup besar. Sehingga peneliti berfikir untuk mengimplementasikan visualisasi data interaktif publikasi LBDSE pada SIVIS LBDSE agar memudahkan dalam memahami data-data nya. Untuk menilai keberhasilan tujuan pengimplementasian tersebut, peneliti akan melakukan evaluasi terhadap visualisasi data pada SIVIS LBDSE berdasarkan penilaian pengguna menggunakan 8 indikator penilaian yang diadopsi dari penelitian terdahulu. Tujuan penelitian ini yaitu untuk mengimplementasikan visualisasi data interaktif pada data LBDSE, mengevaluasi visualisasi data pada SIVIS LBDSE, serta mengetahui visualisasi data terbaik terhadap data kategorik publikasi LBDSE. Dengan bantuan 50 responden, mereka menilai bahwa visualisasi data pada SIVIS LBDSE memiliki keunggulan dan kekurangannya masing-masing berdasarkan 8 indikator penilaian yang digunakan. Namun secara keseluruhan responden mengurutkan visualisasi data terbaik untuk data kategorik secara berturut-turut yaitu, Bar Chart, Tree Map, Bubble Map, dan Pie Chart.

Visualisation for ontology sense-making: A tree-map based algorithmic approach

Ontology sense-making or visual comprehension of the ontological schemata and structure are vital for cross-validation purposes of the ontology increment during the process of applied ontology construction. Also, it is important to query the ontology in order to verify the accuracy of the stored knowledge embeddings. This will boost the interactions between domain specialists and ontologists in applied ontology construction processes. Hence existing mechanisms have numerous of deficiencies (discussed in the paper), a new algorithm is proposed in this research to boost the efficiency of usage of tree-maps for effective ontology sense making. Proposed algorithm and prototype are quantitatively and qualitatively assessed for their accuracy and efficacy.

Classifying natural products from plants, fungi or bacteria using the COCONUT database and machine learning

Natural products (NPs) represent one of the most important resources for discovering new drugs. Here we asked whether NP origin can be assigned from their molecular structure in a subset of 60,171 NPs in the recently reported Collection of Open Natural Products (COCONUT) database assigned to plants, fungi, or bacteria. Visualizing this subset in an interactive tree-map (TMAP) calculated using MAP4 (MinHashed atom pair fingerprint) clustered NPs according to their assigned origin (https://tm.gdb.tools/map4/coconut_tmap/), and a support vector machine (SVM) trained with MAP4 correctly assigned the origin for 94% of plant, 89% of fungal, and 89% of bacterial NPs in this subset. An online tool based on an SVM trained with the entire subset correctly assigned the origin of further NPs with similar performance (https://np-svm-map4.gdb.tools/). Origin information might be useful when searching for biosynthetic genes of NPs isolated from plants but produced by endophytic microorganisms.

Classifying Natural Products from Plants, Fungi or Bacteria using the COCONUT Database and Machine Learning

Natural products (NPs) represent one of the most important resources for discovering new drugs. Here we asked whether NP origin can be assigned from their molecular structure in a subset of 60,171 NPs in the recently reported Collection of Open Natural Products (COCONUT) database assigned to plants, fungi, or bacteria. Visualizing this subset in an interactive tree-map (TMAP) calculated using MAP4 (MinHashed atom pair fingerprint) clustered NPs according to their assigned origin (https://tm.gdb.tools/map4/coconut_tmap/), and a support vector machine (SVM) trained with MAP4 correctly assigned the origin for 94% of plant, 89% of fungal, and 89% of bacterial NPs in this subset. An online tool based on an SVM trained with the entire subset correctly assigned the origin of further NPs with similar performance (https://np-svm-map4.gdb.tools/). Origin information might be useful when searching for biosynthetic genes of NPs isolated from plants but produced by endophytic microorganisms.

Remote Usability Assessment of Topic Visualization Interfaces with Public Participation Data: A Case Study

Citizen participation often faces challenges of transparency and accountability. Visualizations’s usability becomes key for public consultation activities. The tree map is frequently used to disseminate data and to give it back to the population. The purpose of this study is to understand how tree maps and stacked barcharts differ in terms of effectiveness, efficiency, and satisfaction in tasks, like solving topic categorization and comparison analysis tasks. An experimental design was used to examine user performance based on a task-based usability test. 34 participants interacted remotely with data visualizations from an open 2016 participatory constitution-making process. The ANOVA showed that stacked barcharts work significantly better for comparison tasks than the tree map, but there are no significant differences in regards to categorization tasks. Public participation initiatives should first determine what cognitive operations their users perform before deciding which visualization interfaces will be more useful for the intended public.

Automatic content-based image retrieval using hierarchical clustering algorithms

The overall objective of this thesis is to present a methodology for guiding adaptations of an RBF-based relevance feedback network, embedded in automatic content-based image retrieval (CBIR) systems, through the principle of unsupervised hierarchical clustering. The main focus of this thesis is two-fold: introducing a new member of Self-Organizing Tree Map (SOTM) family, the Directed self-organizing tree map (DSOTM) that not only provides a partial supervision on cluster generation by forcing divisions away from the query class, but also presents an objective verdict on resemblance of the input pattern as its tree structure grows; and using a base-10 Genetic Algorithm (GA) approach to accurately determine the contribution of individual feature vectors for a successful retrieval in a so-called "feature weight detection process." The DSOTM is quite attractive in CBIR since it aims to reduce both user workload and subjectivity. Repetitive user interaction steps are replaced by a DSOTM module, which adaptively guides relevance feedback, to bridge the gap between low-level image descriptors and high-level semantics. To further reduce this gap and achieve an enhanced performance for the automatic CBIR system under study, a GA-based approach was proposed in conjunction with the DSOTM. The resulting framework is referred to as GA-based CBIR (GA-CBIR) and aims to import human subjectivity by automatically adjusting the search process to what the system evolves "to believe" is significant content within the query. In this engine, traditional GA operators work closely with the DSOTM to better attune the apparent discriminative characteristics observed in an image by a human user.

Automatic content-based image retrieval using hierarchical clustering algorithms

The overall objective of this thesis is to present a methodology for guiding adaptations of an RBF-based relevance feedback network, embedded in automatic content-based image retrieval (CBIR) systems, through the principle of unsupervised hierarchical clustering. The main focus of this thesis is two-fold: introducing a new member of Self-Organizing Tree Map (SOTM) family, the Directed self-organizing tree map (DSOTM) that not only provides a partial supervision on cluster generation by forcing divisions away from the query class, but also presents an objective verdict on resemblance of the input pattern as its tree structure grows; and using a base-10 Genetic Algorithm (GA) approach to accurately determine the contribution of individual feature vectors for a successful retrieval in a so-called "feature weight detection process." The DSOTM is quite attractive in CBIR since it aims to reduce both user workload and subjectivity. Repetitive user interaction steps are replaced by a DSOTM module, which adaptively guides relevance feedback, to bridge the gap between low-level image descriptors and high-level semantics. To further reduce this gap and achieve an enhanced performance for the automatic CBIR system under study, a GA-based approach was proposed in conjunction with the DSOTM. The resulting framework is referred to as GA-based CBIR (GA-CBIR) and aims to import human subjectivity by automatically adjusting the search process to what the system evolves "to believe" is significant content within the query. In this engine, traditional GA operators work closely with the DSOTM to better attune the apparent discriminative characteristics observed in an image by a human user.

Mapping of Damar Mata Kucing (Shorea javanica) Plus Trees in Repong Damar Penengahan Village, Karya Penggawa Sub District, West Pesisir Regency, Lampung Province

The distribution of seed and plus tree sources of damar mata kucing (Shorea javanica) in Repong Damar village is important to provide good quality of seeds. Currently, the existence of seed source of damar mata kucing is still unknown. Based on these conditions, it is necessary to mapping the seeds source or damar mata kucing plus trees. This study aims to analyze the plus tree map distribution using geographic information systems. This research was conducted using a survey method to determine the coordinates based on the growth location characteristics. Data analysis was performed using geographic information systems. The results showed that there were 24 plus trees (17.5%) of the total population studied and distributed in 3 location, namely east, north and west part. The plus tree distribution is mostly in the eastern part of 58.3%, the northern part is 20.8%, and the western part is 20.8%. The growth location conditions in the eastern part has a slope of 5 - 15%, with an altitude of 41 - 121 m.asl. In the western part it has a slope of 5 - 7%, with an altitude of 40 - 73 masl and the northern part has a slope of 5 - 15%, with an altitude of 35 - 174 masl.

Forward triplets and topological entropy on trees

<p style='text-indent:20px;'>We provide a new and very simple criterion of positive topological entropy for tree maps. We prove that a tree map <inline-formula><tex-math id="M1">\begin{document}$ f $\end{document}</tex-math></inline-formula> has positive entropy if and only if some iterate <inline-formula><tex-math id="M2">\begin{document}$ f^k $\end{document}</tex-math></inline-formula> has a periodic orbit with three aligned points consecutive in time, that is, a triplet <inline-formula><tex-math id="M3">\begin{document}$ (a,b,c) $\end{document}</tex-math></inline-formula> such that <inline-formula><tex-math id="M4">\begin{document}$ f^k(a) = b $\end{document}</tex-math></inline-formula>, <inline-formula><tex-math id="M5">\begin{document}$ f^k(b) = c $\end{document}</tex-math></inline-formula> and <inline-formula><tex-math id="M6">\begin{document}$ b $\end{document}</tex-math></inline-formula> belongs to the interior of the unique interval connecting <inline-formula><tex-math id="M7">\begin{document}$ a $\end{document}</tex-math></inline-formula> and <inline-formula><tex-math id="M8">\begin{document}$ c $\end{document}</tex-math></inline-formula> (a <i>forward triplet</i> of <inline-formula><tex-math id="M9">\begin{document}$ f^k $\end{document}</tex-math></inline-formula>). We also prove a new criterion of entropy zero for simplicial <inline-formula><tex-math id="M10">\begin{document}$ n $\end{document}</tex-math></inline-formula>-periodic patterns <inline-formula><tex-math id="M11">\begin{document}$ P $\end{document}</tex-math></inline-formula> based on the non existence of forward triplets of <inline-formula><tex-math id="M12">\begin{document}$ f^k $\end{document}</tex-math></inline-formula> for any <inline-formula><tex-math id="M13">\begin{document}$ 1\le k&lt;n $\end{document}</tex-math></inline-formula> inside <inline-formula><tex-math id="M14">\begin{document}$ P $\end{document}</tex-math></inline-formula>. Finally, we study the set <inline-formula><tex-math id="M15">\begin{document}$ \mathcal{X}_n $\end{document}</tex-math></inline-formula> of all <inline-formula><tex-math id="M16">\begin{document}$ n $\end{document}</tex-math></inline-formula>-periodic patterns <inline-formula><tex-math id="M17">\begin{document}$ P $\end{document}</tex-math></inline-formula> that have a forward triplet inside <inline-formula><tex-math id="M18">\begin{document}$ P $\end{document}</tex-math></inline-formula>. For any <inline-formula><tex-math id="M19">\begin{document}$ n $\end{document}</tex-math></inline-formula>, we define a pattern that attains the minimum entropy in <inline-formula><tex-math id="M20">\begin{document}$ \mathcal{X}_n $\end{document}</tex-math></inline-formula> and prove that this entropy is the unique real root in <inline-formula><tex-math id="M21">\begin{document}$ (1,\infty) $\end{document}</tex-math></inline-formula> of the polynomial <inline-formula><tex-math id="M22">\begin{document}$ x^n-2x-1 $\end{document}</tex-math></inline-formula>.</p>