• Journal of the Korean Statistical Society
• /
• v.13 no.2
• /
• pp.114-120
• /
• 1984

A parallel flats fraction for the $3^n$ design is defined as union of flats ${t}At=c_i(mod 3)}, i=1,2,\cdots, f$ and is symbolically written as At=C where A is rank r. The A matrix partitions the effects into n+1 alias sets where $u=(3^{n-r}-1)/2. For each alias set the f flats produce an ACPM from which a detection matrix is constructed. The set of all possible parallel flats fraction C can be partitioned into equivalence classes. In this paper, we develop some properties of a detection matrix and C.

• Journal of the Korean Statistical Society
• /
• v.12 no.2
• /
• pp.61-68
• /
• 1983

A parallel flats fraction for the $3^n$ factorial experiment is defined as the union of flats, ${t$\mid$At=C_i(mod 3)}, i=1,2,\cdot,f$, in EG(n,3) and is symbolically written as At=C where A is of rank r. The A matrix partitions the effects into u+1 alias sets where $u=(3^{n-r}-1)/2$. For each alias set the f flats produce an alias component permutation matrix (ACPM) with elements from $S_3$. In this paper, a detection vector of the ACPM was constructed for each combination of k or fewer two-factor interactions. Also the relationship between the detection vectors has been shown.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.7
• /
• pp.1543-1549
• /
• 1997

In this paper, rank-based nonparmetric detection of composite signals in additive noise is considered. Based on signs and ranks of observations, the locally optimum detector is deived for weak-signal detection under any specified noise probability density funhction. This detector has similarities to the locally optimum detector for comjposite signals in additive noise. The asymptotic performance of this nonparametric detector is shown to be as good as that of the locally optimum detector.

• Journal of Internet Computing and Services
• /
• v.25 no.2
• /
• pp.39-47
• /
• 2024

Time series analysis is widely employed by many organizations to solve business problems, as it extracts various information and insights from chronologically ordered data. Among its applications, measuring time series similarity is a step to identify time series with similar patterns, which is very important in time series analysis applications such as time series search and clustering. In this study, we propose an efficient method for measuring time series similarity that focuses on anomalies rather than the entire series. In this regard, we validate the proposed method by measuring and analyzing the rank correlation between the similarity measure for the set of subsets extracted by anomaly detection and the similarity measure for the whole time series. Experimental results, especially with stock time series data and an anomaly proportion of 10%, demonstrate a Spearman's rank correlation coefficient of up to 0.9. In conclusion, the proposed method can significantly reduce computation cost of measuring time series similarity, while providing reliable time series search and clustering results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.11
• /
• pp.3723-3737
• /
• 2022

Google Play is one of the largest Android phone app markets and it contains both free and paid apps. It provides a variety of categories for every target user who has different needs and purposes. The customer's rate every product based on their experience of apps and based on the average rating the position of an app in these arch varies. Fraudulent behaviors emerge in those apps which incorporate search rank maltreatment and malware proliferation. To distinguish the fraudulent behavior, a novel framework is structured that finds and uses follows left behind by fraudsters, to identify both malware and applications exposed to the search rank fraud method. This strategy correlates survey exercises and remarkably joins identified review relations with semantic and behavioral signals produced from Google Play application information, to distinguish dubious applications. The proposed model accomplishes 90% precision in grouping gathered informational indexes of malware, fakes, and authentic apps. It finds many fraudulent applications that right now avoid Google Bouncers recognition technology. It also helped the discovery of fake reviews using the reviewer relationship amount of reviews which are forced as positive reviews for each reviewed Google play the android app.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.2180-2197
• /
• 2019

With the proliferation of the Android malicious applications, malware becomes more capable of hiding or confusing its malicious intent through the use of code obfuscation, which has significantly weaken the effectiveness of the conventional defense mechanisms. Therefore, in order to effectively detect unknown malicious applications on the Android platform, we propose DroidVecDeep, an Android malware detection method using deep learning technique. First, we extract various features and rank them using Mean Decrease Impurity. Second, we transform the features into compact vectors based on word2vec. Finally, we train the classifier based on deep learning model. A comprehensive experimental study on a real sample collection was performed to compare various malware detection approaches. Experimental results demonstrate that the proposed method outperforms other Android malware detection techniques.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1984.04a
• /
• pp.60-62
• /
• 1984

Several pitch detection algorithms are studied and compared with the standard pitch detector in a terms of some kinds of errors and each of speaders. Various types of errors are defined, and rank the performance of pitch detectors.

• Journal of KIISE
• /
• v.44 no.4
• /
• pp.417-422
• /
• 2017

Anomaly detection is the identification of data that do not conform to a normal pattern or behavior model in a dataset. It can be utilized for detecting errors among data generated by devices or user behavior change in a social network data set. In this study, we proposed a new approach using rank correlation coefficient to efficiently detect abnormal data in devices of a building. With the increased push for energy conservation, many energy efficiency solutions have been proposed over the years. HVAC (Heating, Ventilating and Air Conditioning) system monitors and manages thousands of sensors such as thermostats, air conditioners, and lighting in large buildings. Currently, operators use the building's HVAC system for controlling efficient energy consumption. By using the proposed approach, it is possible to observe changes of ranking relationship between the devices in HVAC system and identify abnormal behavior in social network.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.2
• /
• pp.21-27
• /
• 2017

In this paper, we propose a pupil detection method using PCA(principal component analysis) and Hough transform. To reduce error to detect eyebrows as pupil, eyebrows are detected using projection function in eye region and eye region is set to not include the eyebrows. In the eye region, pupil candidates are detected using rank order filter. False candidates are removed by using symmetry. The pupil candidates are grouped into pairs based on geometric constraints. A similarity measure is obtained for two eye of each pair using PCA and hough transform, we select a pair with the smallest similarity measure as final two pupils. The experiments have been performed for 1000 images of the BioID face database. The results show that it achieves the higher detection rate than existing method.

• Journal of Broadcast Engineering
• /
• v.7 no.2
• /
• pp.168-180
• /
• 2002

This paper proposes a novel method to detect unauthorized copies of digital images. This copy detection scheme can be used as either an alternative approach or a complementary approach to watermarking. A test image is reduced to 8$\times$8 sub-image by intensity averaging, and the AC coefficients of its discrete cosine transform (DCT) are used to compute distance from those generated from the query image, of which a user wants to find copies. Copies may be Processed to avoid copy detection or enhance image quality. We show ordinal measure of DCT coefficients, which is based on relative ordering of AC magnitude values and using distance metrics between two rank permutations, are robust to various modifications of the original image. The optimal threshold selection scheme using the maximum a posteriori (MAP) criterion is also addressed.