Sciweavers

728 search results - page 64 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
KDD
1999
ACM
199views Data Mining» more  KDD 1999»
14 years 3 days ago
The Application of AdaBoost for Distributed, Scalable and On-Line Learning
We propose to use AdaBoost to efficiently learn classifiers over very large and possibly distributed data sets that cannot fit into main memory, as well as on-line learning wher...
Wei Fan, Salvatore J. Stolfo, Junxin Zhang
TFS
2011
242views Education» more  TFS 2011»
13 years 2 months ago
Linguistic Summarization Using IF-THEN Rules and Interval Type-2 Fuzzy Sets
—Linguistic summarization (LS) is a data mining or knowledge discovery approach to extract patterns from databases. Many authors have used this technique to generate summaries li...
Dongrui Wu, Jerry M. Mendel
KAIS
2006
164views more  KAIS 2006»
13 years 7 months ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis
CVPR
2007
IEEE
14 years 10 months ago
Feature Mining for Image Classification
The efficiency and robustness of a vision system is often largely determined by the quality of the image features available to it. In data mining, one typically works with immense...
Piotr Dollár, Zhuowen Tu, Hai Tao, Serge Be...
SDM
2007
SIAM
204views Data Mining» more  SDM 2007»
13 years 9 months ago
Flexible Anonymization For Privacy Preserving Data Publishing: A Systematic Search Based Approach
k-anonymity is a popular measure of privacy for data publishing: It measures the risk of identity-disclosure of individuals whose personal information are released in the form of ...
Bijit Hore, Ravi Chandra Jammalamadaka, Sharad Meh...