| Nama Pengarang | : | Yujia Deng |
| Nama Majalah/Jurnal | : | Journal of the American Statistical Association |
| Volume / Nomor Edisi | : | 118 (No. 541) |
| Nomor Halaman | : | 440-456 |
| Abstraksi Narasi | : | Multi-dimensional tensor data have gained increasing attention in the recent years, especially in biomedical imaging analyses. However, the most existing tensor models are only based on the mean information of imaging pixels. Motivated by multimodal optical imaging data in a breast cancer study, we develop a new tensor learning approach to use pixel-wise correlation information, which is represented through the higher order correlation tensor. We proposed a novel semi-symmetric correlation tensor decomposition method which effectively captures the informative spatial patterns of pixel-wise correlations to facilitate cancer diagnosis. We establish the theoretical properties for recovering structure and for classification consistency. In addition, we develop an efficient algorithm to achieve computational scalability. Our simulation studies and an application on breast cancer imaging data all indicate that the proposed method outperforms other competing methods in terms of pattern recognition and prediction accuracy. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Journal of the American Statistical Association |
| Volume / Nomor Edisi | : | 118 (No. 541) |
| Nomor Halaman | : | 424-439 |
| Abstraksi Narasi | : | In modern data science, dynamic tensor data prevail in numerous applications. An important task is to characterize the relationship between dynamic tensor datasets and external covariates. However, the tensor data are often only partially observed, rendering many existing methods inapplicable. In this article, we develop a regression model with a partially observed dynamic tensor as the response and external covariates as the predictor. We introduce the low-rankness, sparsity, and fusion structures on the regression coefficient tensor, and consider a loss function projected over the observed entries. We develop an efficient nonconvex alternating updating algorithm, and derive the finite-sample error bound of the actual estimator from each step of our optimization algorithm. Unobserved entries in the tensor response have imposed serious challenges. As a result, our proposal differs considerably in terms of estimation algorithm, regularity conditions, as well as theoretical properties, compared to the existing tensor completion or tensor response regression solutions. We illustrate the efficacy of our proposed method using simulations and two real applications, including a neuroimaging dementia study and a digital advertising study. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Bina Darma |
| Volume / Nomor Edisi | : | 11-41 (No. 41) |
| Nomor Halaman | : | 65-75 |
| Abstraksi Narasi | : | - |
| Nama Pengarang | : | Cheng-Yu Sun |
| Nama Majalah/Jurnal | : | Journal of the American Statistical Association |
| Volume / Nomor Edisi | : | 118 (No. 541) |
| Nomor Halaman | : | 417-423 |
| Abstraksi Narasi | : | We explore the connections between uniform projection designs and strong orthogonal arrays of strength 2+ in this article. Both of these classes of designs are suitable designs for computer experiments and space-filling in two-dimensional margins, but they are motivated by different considerations. Uniform projection designs are introduced by Sun, Wang, and Xu to capture two-dimensional uniformity using the centered L2-discrepancy whereas strong orthogonal arrays of strength 2+ are brought forth by He, Cheng, and Tang as they achieve stratifications in two-dimensions on finer grids than ordinary orthogonal arrays. We first derive a new expression for the centered L2-discrepancy, which gives a decomposition of the criterion into a sum of squares where each square measures one aspect of design uniformity. This result is not only insightful in itself but also allows us to study strong orthogonal arrays in terms of the discrepancy criterion. More specifically, we show that strong orthogonal arrays of strength 2+ are optimal or nearly optimal under the uniform projection criterion. |
| Nama Pengarang | : | Alam, Tanweer [et al...] |
| Nama Majalah/Jurnal | : | International Journal of Applied Sciences and Smart Technologies |
| Volume / Nomor Edisi | : | 2 (No. 1) |
| Nomor Halaman | : | 75-88 |
| Abstraksi Narasi | : | Smart Campus is an android mobile application that has strong features to f acilitates students, faculties, admins, parents, and managers. It provides a comprehensive integrated solution to improve the overall performance of the college. The use of mobile applications is increasing day by day. We all use the mobile application in a lot of things in our daily life. We came up with an idea of building an application that will help the students and faculty member to accesses the system as fast as possible. In this study, we will discuss the problem and propose a solution to it, as we will talk about the planning phase and its component, requirements the functional and non f unctional with its Data Flow Diagram, etc. We also design the interfaces. This mobile application will help the students and faculty members to do the tasks in the minimum time. |
| Nama Pengarang | : | Ioanes Rakhmat |
| Nama Majalah/Jurnal | : | Bina Darma |
| Volume / Nomor Edisi | : | 11-41 (No. 41) |
| Nomor Halaman | : | 46-64 |
| Abstraksi Narasi | : | - |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Journal of the American Statistical Association |
| Volume / Nomor Edisi | : | 118 (No. 541) |
| Nomor Halaman | : | 405-416 |
| Abstraksi Narasi | : | The use of large datasets for targeted therapeutic interventions requires new ways to characterize the heterogeneity observed across subgroups of a specific population. In particular, models for partially exchangeable data are needed for inference on nested datasets, where the observations are assumed to be organized in different units and some sharing of information is required to learn distinctive features of the units. In this manuscript, we propose a nested common atoms model (CAM) that is particularly suited for the analysis of nested datasets where the distributions of the units are expected to differ only over a small fraction of the observations sampled from each unit. The proposed CAM allows a two-layered clustering at the distributional and observational level and is amenable to scalable posterior inference through the use of a computationally efficient nested slice sampler algorithm. We further discuss how to extend the proposed modeling framework to handle discrete measurements, and we conduct posterior inference on a real microbiome dataset from a diet swap study to investigate how the alterations in intestinal microbiota composition are associated with different eating habits. We further investigate the performance of our model in capturing true distributional structures in the population by means of a simulation study. |
| Nama Pengarang | : | Saragih, Asido [et al...] |
| Nama Majalah/Jurnal | : | International Journal of Applied Sciences and Smart Technologies |
| Volume / Nomor Edisi | : | 2 (No. 1) |
| Nomor Halaman | : | 67-74 |
| Abstraksi Narasi | : | Klein-4 or Klein-V group is a group with four elements including identity. The binary operation on Klein-4 group will produce identitiy if operated to it self and produce another non-identity element if operated to another non identity element. The focus of this paper is to explain the principle of Klein 4 group on Domino card and also f ind all complete possible elements. Domino card is a set of 28 cards which the surface of each card divided in two identic boxes contain combination of dots as patter n. The final part of this research is to find out all possible combination of cards which can be used as elements of a Klein-4 groups. |
| Nama Pengarang | : | Geonawan, Steohanus Ivan |
| Nama Majalah/Jurnal | : | International Journal of Applied Sciences and Smart Technologies |
| Volume / Nomor Edisi | : | 2 (No. 1) |
| Nomor Halaman | : | 59-66 |
| Abstraksi Narasi | : | A set of data pattern that have the characteristic of a function can be approached using Newton series simulation. When using the Newton series, the simulation result of the summation of extrapolation data can be gradually done in step by step. However, if using the IN series, the simulation result of the summation of extrapolation data doesn't need to be gradually done in step by step. The methodology in this research compares the data pattern from the simulation results of the high degree function with the results of interpolation and extrapolation from the results of the IN series simulation. Furthermore, will be carried out comparison simulation analysis of the summation of the function values gradually with the extrapolation f unction directly using the IN series. The result of comparison simulation analysis point out that the value of the total summation of data between the gradual and the direct summation is the same, so that the direct sum technique using the IN Series is able to make the total sum process more efficient. |
| Nama Pengarang | : | Djoko Oentoeng Soeropati |
| Nama Majalah/Jurnal | : | Bina Darma |
| Volume / Nomor Edisi | : | 11-41 (No. 41) |
| Nomor Halaman | : | 37-45 |
| Abstraksi Narasi | : | - |