The current clustering algorithms for evolving uncertain data stream are sensitive to user specified threshold, and unstable in noise processing. In this paper, DUStream is presented, a density-based algorithm for dis...
详细信息
In order to process the software bug feature sequences, this paper presents a gap-constrained sequential pattern mining algorithm, MEMIGCSP algorithm. The length of the interval between items is limited in the origina...
详细信息
The inuence maximization problem is defined as providing a given initial integer k, mining top-k inuential nodes from a social network such that the spread of inuence in the network is maximized. Some existing studies...
详细信息
The inuence maximization problem is defined as providing a given initial integer k, mining top-k inuential nodes from a social network such that the spread of inuence in the network is maximized. Some existing studies are based on Greedy algorithm, but their time complexity is very high. In this paper, a different method based on Genetic Algorithms, denoted as MAGA is proposed. In the MAGA algorithm, the set of k nodes is seen as a candidate solution, and the expected inuence value as fitness. Use the genetic algorithm to get the optimal solution. Experiments show that the algorithm achieved a balance in inuence spread and running time.
There not only exists the relation of the functional dependency and multi-valued dependency in XML data constraint,but also exists the relation of data dependency obtained only from a certain existing relationship ins...
详细信息
ISBN:
(纸本)9781138026445
There not only exists the relation of the functional dependency and multi-valued dependency in XML data constraint,but also exists the relation of data dependency obtained only from a certain existing relationship instance that is *** reducing data redundancy,in this paper,the concepts of XML functional dependency and XML multi-valued dependency based on the path expression in the Document Type Definition are *** then the inference rules on the condition of the coexistence of functional dependency and multi-valued dependency in XML are ***,the validity and completeness of the inference rules are *** above-mentioned fundamentally solves the problems of implication of functional dependency and multi-valued dependency in XML data,laying a theoretical foundation for XML database design.
This paper discusses the simulated computation methods of remote sensing information model, and tries to put forward a more available solution. It presents our research works on the description and simulation methods ...
详细信息
Sequential pattern mining has a wide range of applications in data streams. The real data involves multiple data streams and each data stream is itemset-sequence. However, most algorithms mine a single item in a singl...
详细信息
In this paper, we proposed a new sequential pattern mining algorithm called WSPD for mining weighted sequential patterns in data streams. The algorithm produces no false negatives and places a bound on the error of th...
详细信息
Maximal frequent sequence mining is an important research issue which has realized the highly compressed storage of frequent sequences. At present, most algorithms are based on bottom-up method and large numbers of ca...
详细信息
In three-dimension space, with the minimum bounding rectangular (MBR) of any type of object's projections in xoy and xoz planes, there are four possible types of projection: minimum bounding rectangular, horizonta...
详细信息
The formal model of spatial directional relations is one of the most important parts in spatial relation research. The most of models are based on Minimum Bounding Rectangle (MBR), and they are not compliant with the ...
详细信息
The formal model of spatial directional relations is one of the most important parts in spatial relation research. The most of models are based on Minimum Bounding Rectangle (MBR), and they are not compliant with the regular pattern of human cognition. In order to get a closer conclusion to human cognition on directional relationship, Angle Histogram model based on Double-projection and Rounded-subdivision (AHDPRS) is proposed in this paper. The model uses the maximum inscribed circles to find out the maximum parts of the object, and calculates the directional relationship between the centers of the circles. This model ignores the inessential details to ensure the result which will be closer to human cognition. The experiments show that this model is feasible.
暂无评论