Sciweavers

728 search results - page 76 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
PKDD
2005
Springer
94views Data Mining» more  PKDD 2005»
14 years 1 months ago
Evaluating the Correlation Between Objective Rule Interestingness Measures and Real Human Interest
In the last few years, the data mining community has proposed a number of objective rule interestingness measures to select the most interesting rules, out of a large set of discov...
Deborah R. Carvalho, Alex Alves Freitas, Nelson F....
KDD
2001
ACM
216views Data Mining» more  KDD 2001»
14 years 8 months ago
The distributed boosting algorithm
In this paper, we propose a general framework for distributed boosting intended for efficient integrating specialized classifiers learned over very large and distributed homogeneo...
Aleksandar Lazarevic, Zoran Obradovic
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
14 years 1 months ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
KDD
2005
ACM
205views Data Mining» more  KDD 2005»
14 years 1 months ago
Feature bagging for outlier detection
Outlier detection has recently become an important problem in many industrial and financial applications. In this paper, a novel feature bagging approach for detecting outliers in...
Aleksandar Lazarevic, Vipin Kumar
BMCBI
2005
150views more  BMCBI 2005»
13 years 7 months ago
Discover protein sequence signatures from protein-protein interaction data
Background: The development of high-throughput technologies such as yeast two-hybrid systems and mass spectrometry technologies has made it possible to generate large protein-prot...
Jianwen Fang, Ryan J. Haasl, Yinghua Dong, Gerald ...