scholarly journals Address Authentication Method for Sustainable Social Qualification

2020 ◽  
Vol 12 (5) ◽  
pp. 1700
Author(s):  
Hosung Park ◽  
Seungsoo Nam ◽  
Daeseon Choi
Keyword(s):  
Error Rate ◽  
Social Cost ◽  
Clustering Algorithms ◽  
High Density ◽  
Experimental Results ◽  
Online Identification ◽  
Long Duration ◽  
Density Based Clustering ◽  
Public Inquiry

This paper proposes an address authentication method based on a user’s location history. Address authentication refers to actual residence verification, which can be used in various fields such as personnel qualification, online identification, and public inquiry. In other words, accurate address authentication methods can reduce social cost for actual residence verification. For address authentication, existing studies discover the user’s regular locations, called location of interest (LOI), from the location history by using clustering algorithms. They authenticate an address if the address is contained in one of the LOIs. However, unnecessary LOIs, which are unrelated to the address may lead to false authentications of illegitimate addresses, that is, other users’ addresses or feigned addresses. The proposed method tries to reduce the authentication error rate by eliminating unnecessary LOIs with the distinguishing properties of the addresses. In other words, only few LOIs that satisfy the properties (long duration, high density, and consistency) are kept and utilized for address authentication. Experimental results show that the proposed method decreases the authentication error rate compared with previous approaches using time-based clustering and density-based clustering.

An improved OPTICS clustering algorithm for discovering clusters with uneven densities

2021 ◽  
Vol 25 (6) ◽  
pp. 1453-1471
Author(s):  
Chunhua Tang ◽  
Han Wang ◽  
Zhiwen Wang ◽  
Xiangkun Zeng ◽  
Huaran Yan ◽  
...  
Keyword(s):  
Time Complexity ◽  
Clustering Algorithm ◽  
Nearest Neighbor ◽  
Clustering Algorithms ◽  
Substantial Improvement ◽  
Experimental Results ◽  
High Time ◽  
Parameter Setting ◽  
K Nearest Neighbor ◽  
Density Based Clustering

Most density-based clustering algorithms have the problems of difficult parameter setting, high time complexity, poor noise recognition, and weak clustering for datasets with uneven density. To solve these problems, this paper proposes FOP-OPTICS algorithm (Finding of the Ordering Peaks Based on OPTICS), which is a substantial improvement of OPTICS (Ordering Points To Identify the Clustering Structure). The proposed algorithm finds the demarcation point (DP) from the Augmented Cluster-Ordering generated by OPTICS and uses the reachability-distance of DP as the radius of neighborhood eps of its corresponding cluster. It overcomes the weakness of most algorithms in clustering datasets with uneven densities. By computing the distance of the k-nearest neighbor of each point, it reduces the time complexity of OPTICS; by calculating density-mutation points within the clusters, it can efficiently recognize noise. The experimental results show that FOP-OPTICS has the lowest time complexity, and outperforms other algorithms in parameter setting and noise recognition.

scholarly journals Enhancing of DBSCAN based on Sampling and Densitybased Separation

2016 ◽  
Vol 42 (1) ◽  
pp. 38-47
Author(s):  
Safaa Al-mamory ◽  
Israa Kamil
Keyword(s):  
Real World ◽  
Clustering Algorithms ◽  
Experimental Results ◽  
New Technique ◽  
Real World Data ◽  
New Techniques ◽  
World Data ◽  
Density Based Clustering ◽  
A New Technique

DBSCAN (Density-Based Clustering of Applications with Noise )is one of the attractive algorithms among densitybased clustering algorithms. It characterized by its ability to detect clusters of various sizes and shapes with the presence of noise, but its performance degrades when data have different densities .In this paper, we proposed a new technique to separate data based on its density with a new samplingtechnique , the purpose of these new techniques is for getting data with homogenous density .The experimental results onsynthetic data and real world data show that the new technique enhanced the clustering of DBSCAN to large extent.

Distance Density Based Clustering Algorithm in Wireless Sensor Network

2011 ◽  
Vol 291-294 ◽  
pp. 344-348
Author(s):  
Lin Lin ◽  
Shu Yan ◽  
Yi Nian
Keyword(s):  
Clustering Algorithm ◽  
Distribution Density ◽  
Simulation Experiment ◽  
Clustering Algorithms ◽  
Wireless Sensor ◽  
Energy Usage ◽  
Cluster Heads ◽  
Hierarchical Topology ◽  
Energy Factors ◽  
Density Based Clustering

The hierarchical topology of wireless sensor networks can effectively reduce the consumption in communication. Clustering algorithm is the foundation to realize herarchical structure, so it has been extensive researched. On the basis of Leach algorithm, a distance density based clustering algorithm (DDBC) is proposed, considering synthetically the distribution density of around nodes and the remaining energy factors of the node to dynamically banlance energy usage of nodes when selecting cluster heads. We analyzed the performance of DDBC through compared with the existing other clustering algorithms in simulation experiment. Results show that the proposed method can generare stable quantity cluster heads and banlance the energy load effectively.

Detection of Microbubbles Using the Hough Transform

2013 ◽  
Vol 378 ◽  
pp. 478-482
Author(s):  
Yoshihiro Mitani ◽  
Toshitaka Oki
Keyword(s):  
Image Processing ◽  
Error Rate ◽  
Hough Transform ◽  
Detection Method ◽  
Experimental Results ◽  
Average Error ◽  
Image Processing Techniques ◽  
Average Error Rate ◽  
Processing Techniques

The microbubble has been widely used and shown to be effective in various fields. Therefore, there is an importance of measuring accurately its size by image processing techniques. In this paper, we propose a detection method of microbubbles by the approach based on the Hough transform. Experimental results show only 4.49% of the average error rate of the undetected microbubbles and incorrectly detected ones. This low percentage of the error rate shows the effectiveness of the proposed method.

Misuse Detection for Mobile Devices Using Behaviour Profiling

2011 ◽  
Vol 1 (1) ◽  
pp. 41-53 ◽  
Author(s):  
Fudong Li ◽  
Nathan Clarke ◽  
Maria Papadaki ◽  
Paul Dowland
Keyword(s):  
Mobile Devices ◽  
Error Rate ◽  
Text Message ◽  
Modern Society ◽  
Experimental Results ◽  
Equal Error Rate ◽  
Misuse Detection ◽  
General Application ◽  
Point Of Entry ◽  
Application Specific

Mobile devices have become essential to modern society; however, as their popularity has grown, so has the requirement to ensure devices remain secure. This paper proposes a behaviour-based profiling technique using a mobile user’s application usage to detect abnormal activities. Through operating transparently to the user, the approach offers significant advantages over traditional point-of-entry authentication and can provide continuous protection. The experiment employed the MIT Reality dataset and a total of 45,529 log entries. Four experiments were devised based on an application-level dataset containing the general application; two application-specific datasets combined with telephony and text message data; and a combined dataset that included both application-level and application-specific. Based on the experiments, a user’s profile was built using either static or dynamic profiles and the best experimental results for the application-level applications, telephone, text message, and multi-instance applications were an EER (Equal Error Rate) of 13.5%, 5.4%, 2.2%, and 10%, respectively.

scholarly journals STABILITY OF HIGH DENSITY CUBES IN RUBBLE MOUND BREAKWATERS

2020 ◽  
pp. 4
Author(s):  
Yalcin Yuksel ◽  
Marcel van Gent ◽  
Esin Cevik ◽  
H. Alper Kaya ◽  
Irem Gumuscu ◽  
...  
Keyword(s):  
Relative Density ◽  
Slope Angle ◽  
High Density ◽  
Experimental Results ◽  
Normal Density ◽  
Stability Number ◽  
Damage Initiation ◽  
Rubble Mound ◽  
The Stability ◽  
Rubble Mound Breakwaters

The stability number for rubble mound breakwaters is a function of several parameters and depends on unit shape, placing method, slope angle, relative density, etc. In this study two different densities for cubes in breakwater armour layers were tested to determine the influence of the density on the stability. The experimental results show that the stability of high density blocks were found to be more stable and the damage initiation for high density blocks started at higher stability numbers compared to normal density cubes.

scholarly journals Improved minimum-minimum roughness algorithm for clustering categorical data

2021 ◽  
Vol 8 (10) ◽  
pp. 43-50
Author(s):  
Truong et al. ◽  
Keyword(s):  
Machine Learning ◽  
Data Mining ◽  
Hierarchical Clustering ◽  
Categorical Data ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Experimental Results ◽  
Data Sets ◽  
Top Down ◽  
Hierarchical Clustering Algorithm

Clustering is a fundamental technique in data mining and machine learning. Recently, many researchers are interested in the problem of clustering categorical data and several new approaches have been proposed. One of the successful and pioneering clustering algorithms is the Minimum-Minimum Roughness algorithm (MMR) which is a top-down hierarchical clustering algorithm and can handle the uncertainty in clustering categorical data. However, MMR tends to choose the category with less value leaf node with more objects, leading to undesirable clustering results. To overcome such shortcomings, this paper proposes an improved version of the MMR algorithm for clustering categorical data, called IMMR (Improved Minimum-Minimum Roughness). Experimental results on actual data sets taken from UCI show that the IMMR algorithm outperforms MMR in clustering categorical data.

Sign in / Sign up

Export Citation Format

Share Document