Paper Title:
Top-K Strongly Related Projects Pairs Mining Algorithm Based on Threshold Estimate
  Abstract

This paper presents a candidate set in the case does not produce only scan through a database to extract the top-k strongly correlated item pairs method. Secondly, the structural information using a relational database, an appropriate estimate of the effective threshold, so that the results of K contains at least one project to effectively address the relational database on the Top-K strongly related to the problem of mining projects, and without Pay too much computational cost.

  Info
Periodical
Advanced Materials Research (Volumes 268-270)
Edited by
Feng Xiong
Pages
1103-1109
DOI
10.4028/www.scientific.net/AMR.268-270.1103
Citation
M. Y. Luo, "Top-K Strongly Related Projects Pairs Mining Algorithm Based on Threshold Estimate", Advanced Materials Research, Vols. 268-270, pp. 1103-1109, 2011
Online since
July 2011
Authors
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Lu Na Byon, Jeong Hye Han
Abstract:As electronic commerce progresses, temporal association rules are developed by time to offer personalized services for customer’s interests....
287
Authors: Zhong Ping Zhang, Yong Xin Liang
Abstract:This paper proposes a new data stream outlier detection algorithm SODRNN based on reverse nearest neighbors. We deal with the sliding window...
1032
Authors: Hai Feng Li, Ning Zhang
Chapter 1: Transportation & Service Science
Abstract:Maximal frequent itemsets are one of several condensed representations of frequent itemsets, which store most of the information contained in...
21
Authors: Jun Tan
Chapter 12: Computer-Aided Design and Applications in Industry and Civil Engineering
Abstract:Online mining of frequent closed itemsets over streaming data is one of the most important issues in mining data streams. In this paper, we...
2910