Learn More
Most classic network entity sorting algorithms are implemented in a homogeneous network, and they are not applicable to a heterogeneous network. Registered patent history data denotes the innovations and the achievements in different research fields. In this paper, we present an iteration algorithm called inventor-ranking, to sort the influences of patent(More)
The top-k ranking is based on some scoring function in deterministic applications. However, in uncertain applications, such a clean definition does not exist, since the process of reporting a tuple in a top-k answer does not depend only on its score but also on its membership probability. This work introduces an approach to processing top-k queries based on(More)
Rough set theory is an efficient information processing tool used in the discovery of data dependencies. It evaluates the importance of attributes, discovers the patterns of data, reduces all redundant objects and attributes, and seeks the minimum subset of attributes. This paper presents a method for attribute reduction on combination of rough set and(More)
One of the main obstacles facing current data mining techniques is attribute reduction. This paper discusses the basic concepts of rough set, and studies two rough approximations operators under neighborhood systems. An attribute reduction method based on rough set theory and neighborhood systems is presented. The experimental results show that the method(More)
Information extraction (IE) is the problem of constructing a knowledge base from a corpus of text documents. In recent years, uncertain data applications have grown in importance in the large number of real-world applications, and IE as an uncertain data source. This paper investigated the uncertain data represent and presented a probabilistic framework(More)
  • 1