Qianfang Xu

  • Citations Per Year
Learn More
Currently those algorithms to mine the alarm association rules are limited to the minimal support, so that they can only obtain the association rules among the frequently occurring alarm events, furthermore, the rules couldn't be visual display. This paper provides a novel mining alarm correlation visualization algorithm based on the non-linear(More)
Mining of confident patterns from the datasets with skewed support distributions is a very important problem in the pattern discovery field. A hyperclique pattern is presented as a new type of association pattern for mining such datasets, in which items are highly affiliated with each other. The maximal hyperclique pattern is a more compact representation(More)
Given a network, community detection aims at finding all dense sub-graphs. Removing edges across different communities (border edges) is classic and effective. However, most of existing methods have high computing spends or suffer in the quality of resulting communities. In this paper, we propose a community detection algorithm: Edge Pruning (EP), with the(More)
currently those algorithms to mine the alarm association rules are limited to the minimal support, so that they can only obtain the association rules among the frequently occurring alarms. This paper proposes a new mining algorithm based on spectral graph theory. The algorithms firstly sets up alarm association model with time series; Secondly, it regards(More)
Keywords extraction is the process of choosing several words from a document to express its main idea. Keywords help people understand an article quickly and clearly. In recent years, more and more researchers pay attention to its research since its important role in text clustering, text classification, automatic abstracting, and text retrieval. This paper(More)
Credible association rule(CAR) is a new type of association pattern in which items are highly affiliated with each other. The presence of an item in one transaction strongly implies the presence of every other item in the same CAR. And a maximal CAR is a CAR whose each superset isn't a CAR, so the maximal CAR specifies a more compact representation of a(More)
  • 1