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.
Community detection has a very important role in data processing and analysis, which is very hot in recent years. However, traditional algorithms have shortcomings in both time complexity and precision. In this paper, we introduce a Modified Genetic Algorithm (MGA) that with alleles encoding and half uniform crossover to detect community structure. In the algorithm, each allele of the chromosome stands...
With the development of technology, calculated amount especially in seismic data processing is increasing in virtual computing environment and the data size is astonishing. In this paper, based on the seismic data and the influence factors during the calculation, we present a suitable data partitioning strategy-the PGA (Pretreatment Genetic Algorithm) algorithm. The scheduling problem in virtual computing...
This paper presents a new clustering algorithm based on the combination of GA(Genetic Algorithm) and k-medoids algorithm . The new algorithm can not only improve the precision of clustering but also recognize isolated points. At the same time, the new algorithm may expedite the convergence of GA and save the time cost because of introducing the k-medoids algorithm in GA. Based on this, we build knowledge...
This paper proposes an effective clustering algorithm for databases, which are benchmark data sets of data mining applications. We present a Genetic Clustering Algorithm (GCA) that finds a globally optimal partition of a given data sets into a specified number of clusters. The algorithm is distance-based and creates centroids. To evaluate the proposed algorithm, we use some artificial data sets and...
The process of designing a parallel data warehouse has two main steps: (1) fragmentation and (2) allocation of generated fragments at various nodes. Usually, fragmentation and allocation tasks are used iteratively (we first split the warehouse horizontally and then allocate fragments over the nodes). The main drawback of such design approach (called iterative) is that it does not take into account...
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.