Though K-means is very popular for general clustering, its performance, which generally converges to numerous local minima, depends highly on initial cluster centers. In this paper a novel initialization scheme to sel...
详细信息
Though K-means is very popular for general clustering, its performance, which generally converges to numerous local minima, depends highly on initial cluster centers. In this paper a novel initialization scheme to select initial cluster centers for K-means clustering is proposed. This algorithm is based on reverse nearest neighbor （RNN） search which retrieves all points in a given data set whose nearest neighbor is a given query point. The initial cluster centers computed using this methodology are found to be very close to the desired cluster centers for iterative clustering algorithms. This procedure is applicable to clustering algorithms for continuous data. The application of the proposed algorithm to K-means clustering algorithm is demonstrated. An experiment is carried out on several popular datasets and the results show the advantages of the proposed method.
In recent years a huge number of online auctions that use Multi Agent systems have been created. As a result there are numerous auctions that provide the same product. In this case each customer can buy a product with...
详细信息
ISBN:
(纸本)1565553195
In recent years a huge number of online auctions that use Multi Agent systems have been created. As a result there are numerous auctions that provide the same product. In this case each customer can buy a product with the lowest possible price. But searching between auctions in terms of finding the suitable product can be time consuming for consumers and also providing products in different markets is a difficult task for suppliers. So the need for an autonomous agent in these types of markets is deeply felt. On the other side the structure of an auction mechanism that provides the environment for traders to operate their trades is vital. Despite all the research that has been done about online auctions, most of them were about single markets. But in real world the stocks and commodities of companies are listed and traded in different markets. There is a growing tendency towards research about online auctions and Market Design. Particularly in recent years CAT (CATallactics) game has provided an important opportunity to develop and test new techniques in this field. In this paper after introducing CAT game and PersianCAT agent, we want to challenge the conventional accepting policy used in stock markets like New York Stock Exchange and provide a better solution that improves the general performance of the markets.
This research presents an enhanced version of the Technology Acceptance Model (TAM), which integrates usability and learning objectives to evaluate the effect of adopting virtual laboratories on student performance. D...
详细信息
The article introduces an innovative framework called Kororā, which aims to enhance the security and integrity of live virtual machine migration in a public cloud computing environment. The framework incorporates a t...
详细信息
Parametric search is a useful tool in geometric optimization. Invented by Nimrod Megiddo in 1983, it has been widely used in computational geometry. Unfortunately, this technique has rarely been used in the combinator...
详细信息
Parametric search is a useful tool in geometric optimization. Invented by Nimrod Megiddo in 1983, it has been widely used in computational geometry. Unfortunately, this technique has rarely been used in the combinatorial optimization community in China. In this paper, we introduce parametric search via three new geometric optimization applications.
Keywords Parametric search - geometric optimization - facility location
Performance on multi-hop networks suffers from limited throughput capacity and poor scalability problems as the network size or density increases (Gupta and Kumar, 2000). One way to alleviate these problems is to equi...
详细信息
Performance on multi-hop networks suffers from limited throughput capacity and poor scalability problems as the network size or density increases (Gupta and Kumar, 2000). One way to alleviate these problems is to equip each node with multiple radios. As hardware cost drops, this approach becomes more and more appealing and feasible. By tuning radios into non-interfering channels, the wireless spectrum can be more efficiently utilized, thus enhancing the whole network performance. This work extensively evaluates Dynamic Source Routing Protocol(DSR) (Johnson and Maltz, 1996) for multi-radio multi-hop networks. Through simulations, DSR with multi-radio extensions exhibits an overall performance improvement for throughput, packet delivery rate and latency.
In the application of target tracking based on dynamic convey tree-based collaboration (DCTC) in wireless sensor networks, collisions and interferences among nodes pose a challenge for data aggregation. In this paper,...
详细信息
In order to utilize a best hot rolling process, intelligent database system involving with rolling conditions rolling materials was developed in this research work. The system design is to consider how to optimize man...
详细信息
Schema integration is an important discipline for constructing a heterogeneous database system. The task becomes particularly challenging when involves the resolution of naming, structural and semantic conflicts. We p...
详细信息
暂无评论