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.
Indoor positioning system in wireless local area network (WLAN) has become more and more popular accompanied by the popularization of GPS. While increasing numbers of access point (AP) enhancing the positioning accuracy little, the complexity increases a lot. To keep balance between the positioning accuracy and the complexity, we summarize three clustering methods named K-means, affinity propagation...
This paper proposes an Algorithm for Automatically Estimating the Clustering Number based on Spectral Clustering Algorithm—ScaEcn, which estimates the clustering number via computing the amount of eigenvalue equals to 1 in Laplace matrix. The fabricating data-set and UCI data-set have been used in the experiment; the result indicates that the ScaEcn has satisfactory effect in both fabricating data...
Moving sequential pattern mining is important in the trajectory analysis of moving objects and mobility prediction in mobile environment. The traditional sequential pattern mining method-PrefixSpan, is not applicable to the spatial constrained applications and it will produce a large number of duplicated projected databases in mining data sets. In order to overcome these drawbacks, a new algorithm...
This paper focus on continuous K-nearest neighbor (CKNN for short) query and propose a query method based on R-Tree and Quad Tree (QR-Tree) to support continuous K-nearest neighbor query for moving objects, in which the main idea is to use a QR-Tree to divide the static spatial space for the moving objects. In the interested region, it uses the QR-Tree and hash tables as an index to store the moving...
With the growing popularity of mobile computing and wireless communications, managing the continuously changing information of the moving objects is becoming feasible, especially in LBS application which is characterized by a large number of moving objects and a large number of continuous queries. In this paper, we focus on continuous k-nearest neighbor (CkNN for short) query and propose a query method...
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.