Sciweavers

661 search results - page 87 / 133
» Scalable Parallel Data Mining for Association Rules
Sort
View
KDD
2001
ACM
226views Data Mining» more  KDD 2001»
14 years 9 months ago
Mining from open answers in questionnaire data
Surveys are an important part of marketing and customer relationship management, and open answers (i.e., answers to open questions) in particular may contain valuable information ...
Hang Li, Kenji Yamanishi
ICDM
2005
IEEE
187views Data Mining» more  ICDM 2005»
14 years 2 months ago
Parallel Algorithms for Distance-Based and Density-Based Outliers
An outlier is an observation that deviates so much from other observations as to arouse suspicion that it was generated by a different mechanism. Outlier detection has many applic...
Elio Lozano, Edgar Acuña
ISCI
2007
99views more  ISCI 2007»
13 years 9 months ago
Privacy-preserving algorithms for distributed mining of frequent itemsets
Standard algorithms for association rule mining are based on identification of frequent itemsets. In this paper, we study how to maintain privacy in distributed mining of frequen...
Sheng Zhong
IFIP12
2008
13 years 10 months ago
Agent Based Frequent Set Meta Mining: Introducing EMADS
In this paper we: introduce EMADS, the Extendible Multi-Agent Data mining System, to support the dynamic creation of communities of data mining agents; explore the capabilities of ...
Kamal Ali Albashiri, Frans Coenen, Paul H. Leng
IFIP12
2008
13 years 10 months ago
P-Prism: A Computationally Efficient Approach to Scaling up Classification Rule Induction
Top Down Induction of Decision Trees (TDIDT) is the most commonly used method of constructing a model from a dataset in the form of classification rules to classify previously unse...
Frederic T. Stahl, Max A. Bramer, Mo Adda