The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Scanning acquires status information regarding target hosts. In networks, attackers often conduct coordinated scans of the target host or network segment because such scans are efficient and stealthy. However, an algorithm that effectively detects coordinated scans has not yet been developed. In this study, we identify a coordinated scan under a single controller during a clustering analysis of the...
With the fast development of storage technologies, large-scale and high dimensional datasets are stored in a distributed way. It usually applies distributed clustering algorithms to cluster distributed datasets. This paper presents a distributed clustering algorithm based on Clique and high dimensionality reduction to do the distributed clustering. Moreover, the efficiency, accuracy and extendibility...
Similarity measurements play an important role in the clustering analysis, so any good or bad methods of measuring similar degree directly affect the clustering algorithm. In the paper, several approaches to similarity measurements for single attribute type data, which had been proposed, have been discussed. Moreover, a way has been obtained so as to calculate the similar degree of multiple attribute...
Given a graph G=(V,E) with real positive edge weights, where each edge (u, v) is labeled either + or - depending on whether u and v have been deemed to be similar or dissimilar, the problem of correlation clustering with l clusters is to partition the vertices of G into at most l clusters to minimize the total weight of + edges between clusters and - edges within clusters. This problem for general...
The first and foremost question needed to be considered in clustering analysis is how to measure the similarity that decides the result of clustering immediately. However, are many shortcomings in traditional methods. This paper deals with similarity of English texts using sequence alignment which is always used in biology informatics. This method do not use traditional way that transform texts so...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.