• Title/Summary/Keyword: Recall time

Search Result 328, Processing Time 0.025 seconds

Non-hierarchical Clustering based Hybrid Recommendation using Context Knowledge (상황 지식을 이용한 비계층적 군집 기반 하이브리드 추천)

  • Baek, Ji-Won;Kim, Min-Jeong;Park, Roy C.;Jung, Hoill;Chung, Kyungyong
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.20 no.3
    • /
    • pp.138-144
    • /
    • 2019
  • In a modern society, people are concerned seriously about their travel destinations depending on time, economic problem. In this paper, we propose an non-hierarchical clustering based hybrid recommendation using context knowledge. The proposed method is personalized way of recommended knowledge about preferred travel places according to the user's location, place, and weather. Based on 14 attributes from the data collected through the survey, users with similar characteristics are grouped using a non-hierarchical clustering based hybrid recommendation. This makes more accurate recommendation by weighting implicit and explicit data. The users can be recommended a preferred travel destination without spending unnecessary time. The performance evaluation uses accuracy, recall, F-measure. The evaluation result was shown 0.636 accuracy, 0.723 recall, and 0.676 F-measure.

A Hybrid Model for Android Malware Detection using Decision Tree and KNN

  • Sk Heena Kauser;V.Maria Anu
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.7
    • /
    • pp.186-192
    • /
    • 2023
  • Malwares are becoming a major problem nowadays all around the world in android operating systems. The malware is a piece of software developed for harming or exploiting certain other hardware as well as software. The term Malware is also known as malicious software which is utilized to define Trojans, viruses, as well as other kinds of spyware. There have been developed many kinds of techniques for protecting the android operating systems from malware during the last decade. However, the existing techniques have numerous drawbacks such as accuracy to detect the type of malware in real-time in a quick manner for protecting the android operating systems. In this article, the authors developed a hybrid model for android malware detection using a decision tree and KNN (k-nearest neighbours) technique. First, Dalvik opcode, as well as real opcode, was pulled out by using the reverse procedure of the android software. Secondly, eigenvectors of sampling were produced by utilizing the n-gram model. Our suggested hybrid model efficiently combines KNN along with the decision tree for effective detection of the android malware in real-time. The outcome of the proposed scheme illustrates that the proposed hybrid model is better in terms of the accurate detection of any kind of malware from the Android operating system in a fast and accurate manner. In this experiment, 815 sample size was selected for the normal samples and the 3268-sample size was selected for the malicious samples. Our proposed hybrid model provides pragmatic values of the parameters namely precision, ACC along with the Recall, and F1 such as 0.93, 0.98, 0.96, and 0.99 along with 0.94, 0.99, 0.93, and 0.99 respectively. In the future, there are vital possibilities to carry out more research in this field to develop new methods for Android malware detection.

l-STEP GENERALIZED COMPOSITE ESTIMATOR UNDER 3-WAY BALANCED ROTATION DESIGN

  • KIM K. W.;PARK Y. S.;KIM N. Y.
    • Journal of the Korean Statistical Society
    • /
    • v.34 no.3
    • /
    • pp.219-233
    • /
    • 2005
  • The 3-way balanced multi-level rotation design has been discussed (Park Kim and Kim, 2003), where the 3-way balancing is done on interview time, in monthly sample and rotation group and recall time. A greater advantage of 3-way balanced design is accomplished by an estimator. To obtain the advantage, we generalized previous generalized composite estimator (GCE). We call this as l-step GCE. The variance of the l-step GCE's of various characteristics of interest are presented. Also, we provide the coefficients which minimize the variance of the l-step GCE. Minimizing a weighted sum of variances of all concerned estimators of interest, we drive one set of the compromise coefficient of l-step GCE's to preserve additivity of estimates.

MPEG-1 Video Scene Change Detection Using Horizontal and Vertical Blocks (수평과 수직 블록을 이용한 MPEG-1 비디오 장면전환 검출)

  • Lee, Min-Seop;An, Byeong-Cheol
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.2S
    • /
    • pp.629-637
    • /
    • 2000
  • The content-based information retrieval for a multimedia database uses feature information extracted from the compressed videos. This paper presents an effective method to detect scene changes from compressed videos. Scene changes are detected with DC values of DCT coefficients in MPEG-1 encoded video sequences. Instead of decoding full frames. partial macroblocks of each frame, horizontal and vertical macroblocks, are decoded to detect scene changes. This method detects abrupt scene changes by decoding minimal number of blocks and saves a lot of computation time. The performance of the proposed algorithm is analyzed based on the precision and the recall. The experimental results show the effectiveness in computation time and detection rate to detect scene changes of various MPEG-1 video streams.

  • PDF

Deep Neural Network Models to Recommend Product Repurchase at the Right Time : A Case Study for Grocery Stores

  • Song, Hee Seok
    • Journal of Information Technology Applications and Management
    • /
    • v.25 no.2
    • /
    • pp.73-90
    • /
    • 2018
  • Despite of increasing studies for product recommendation, the recommendation of product repurchase timing has not yet been studied actively. This study aims to propose deep neural network models usingsimple purchase history data to predict the repurchase timing of each customer and compare performances of the models from the perspective of prediction quality, including expected ROI of promotion, variability of precision and recall, and diversity of target selection for promotion. As an experiment result, a recurrent neural network (RNN) model showed higher promotion ROI and the smaller variability compared to MLP and other models. The proposed model can be used to develop a CRM system that can offer SMS or app-based promotionsto the customer at the right time. This model can also be used to increase sales for product repurchase businesses by balancing the level of ordersas well as inducing repurchases by customers.

A Study of Information Searching Behaviors Caused by Time pressure of Researchers (연구자의 시간압박감에 따른 정보탐색행태에 관한 연구)

  • Hong Ki-Churl
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.31 no.3
    • /
    • pp.209-237
    • /
    • 1997
  • The main purpose of this study is to find the difference of information searching behaviours consist of information pursuit cognition and searching character by time pressure of researchers. The majar findings and result by time pressure of researchers are summarized as follows : In terms of information retrieval systems, according to the time pressure, there is a significant difference in recall, precision and diversity. In terms of main used material, there is a significant difference in a book, a research report, and a Journal. In terms of resource types, there is a significant difference in both record and human resource. Also, in terms of searching behaviours, there is a difference to spend time for information collection and information searching strategy, and to decide information searching method and degree of searching.

  • PDF

A Mask Wearing Detection System Based on Deep Learning

  • Yang, Shilong;Xu, Huanhuan;Yang, Zi-Yuan;Wang, Changkun
    • Journal of Multimedia Information System
    • /
    • v.8 no.3
    • /
    • pp.159-166
    • /
    • 2021
  • COVID-19 has dramatically changed people's daily life. Wearing masks is considered as a simple but effective way to defend the spread of the epidemic. Hence, a real-time and accurate mask wearing detection system is important. In this paper, a deep learning-based mask wearing detection system is developed to help people defend against the terrible epidemic. The system consists of three important functions, which are image detection, video detection and real-time detection. To keep a high detection rate, a deep learning-based method is adopted to detect masks. Unfortunately, according to the suddenness of the epidemic, the mask wearing dataset is scarce, so a mask wearing dataset is collected in this paper. Besides, to reduce the computational cost and runtime, a simple online and real-time tracking method is adopted to achieve video detection and monitoring. Furthermore, a function is implemented to call the camera to real-time achieve mask wearing detection. The sufficient results have shown that the developed system can perform well in the mask wearing detection task. The precision, recall, mAP and F1 can achieve 86.6%, 96.7%, 96.2% and 91.4%, respectively.

Time Complexity Analysis of Boolean Query Formulation Algorithms (불리언 질의 구성 알고리즘의 시간복잡도 분석)

  • Kim, Nam-Ho;Donald E. Brown;James C. French
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.3
    • /
    • pp.709-719
    • /
    • 1997
  • Performance of an algorithm can be mesaurde from serval aspects.Suppose thre is a query formulation al-gorithm.Even though this algorithm shows high retrival performance, ie, high recall and percision, retriveing items can rake a long time.In this study, we time complexity of automatic query reformulation algorithms, named the query Tree, DNF method, and Dillon's method, and comparethem in theoretical and practical aspects using a tral-time performance)the absolute times for each algorithm to fromulate a query)in a Sun SparcStation 2. In experiments using three test sets, CSCM, CISI, and Medlars, the query Tree algorithm was the fastest among the three algorithms tested.

  • PDF

Health Risk Management using Feature Extraction and Cluster Analysis considering Time Flow (시간흐름을 고려한 특징 추출과 군집 분석을 이용한 헬스 리스크 관리)

  • Kang, Ji-Soo;Chung, Kyungyong;Jung, Hoill
    • Journal of the Korea Convergence Society
    • /
    • v.12 no.1
    • /
    • pp.99-104
    • /
    • 2021
  • In this paper, we propose health risk management using feature extraction and cluster analysis considering time flow. The proposed method proceeds in three steps. The first is the pre-processing and feature extraction step. It collects user's lifelog using a wearable device, removes incomplete data, errors, noise, and contradictory data, and processes missing values. Then, for feature extraction, important variables are selected through principal component analysis, and data similar to the relationship between the data are classified through correlation coefficient and covariance. In order to analyze the features extracted from the lifelog, dynamic clustering is performed through the K-means algorithm in consideration of the passage of time. The new data is clustered through the similarity distance measurement method based on the increment of the sum of squared errors. Next is to extract information about the cluster by considering the passage of time. Therefore, using the health decision-making system through feature clusters, risks able to managed through factors such as physical characteristics, lifestyle habits, disease status, health care event occurrence risk, and predictability. The performance evaluation compares the proposed method using Precision, Recall, and F-measure with the fuzzy and kernel-based clustering. As a result of the evaluation, the proposed method is excellently evaluated. Therefore, through the proposed method, it is possible to accurately predict and appropriately manage the user's potential health risk by using the similarity with the patient.

Gendered Reporting Gap of the Housework Time: A Comparison of Time Diary and Stylized Survey Questionnaire (성별 가사노동시간 측정 : 시간일지와 서베이문항 방식 비교)

  • kim, Eun-Ji;kim, Su-Jeong
    • Survey Research
    • /
    • v.10 no.2
    • /
    • pp.1-21
    • /
    • 2009
  • The purpose of this study is to compare the estimates of housework time by gender using two representative methods of time use study: Time Diary and Stylized Survey Questionnaire. Our analysis is based on the data from the Lifetime Use Survey(2004), which used time-diary questions, and the Korean Labor & Income Panel Study(KLIPS 2004), which used stylized questions on housework hours. The results show that men over-report their housework time in the stylized time use questions. In contrast, women under-report their housework time, which is unusual in the previous studies on response errors and reporting gap. Subgroup analysis shows that widowed/divorced men tend to over-report their contribution to housework more than other groups whereas among women, groups burdened with employed work, caring and housework underestimate their housework time. This reporting gap is explained by gendered norm and perception of time pressure. The theory to explain under-reporting of the housework time has been undeveloped in the previous studies. Our study suggests that perceptions of time pressure be an important factor to explain women's reporting gap of housework estimates.

  • PDF