Sciweavers

2497 search results - page 239 / 500
» A Partial-Repeatability Approach to Data Mining
Sort
View
LWA
2004
15 years 6 months ago
Efficient Frequent Pattern Mining in Relational Databases
Data mining on large relational databases has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind ...
Xuequn Shang, Kai-Uwe Sattler, Ingolf Geist
PKDD
1998
Springer
96views Data Mining» more  PKDD 1998»
15 years 9 months ago
Knowledge Discovery with Qualitative Influences and Synergies
We review some approaches to qualitative uncertainty and propose a new one based on the idea of Absolute Order of Magnitude. We show that our ideas can be useful for Knowledge Disc...
Jesús Cerquides, Ramon López de M&aa...
JISE
2008
108views more  JISE 2008»
15 years 4 months ago
Efficient Discovery of Frequent Continuities by Projected Window List Technology
Mining frequent patterns in databases is a fundamental and essential problem in data mining research. A continuity is a kind of causal relationship which describes a definite temp...
Kuo-Yu Huang, Chia-Hui Chang, Kuo-Zui Lin
KDD
2000
ACM
77views Data Mining» more  KDD 2000»
15 years 8 months ago
Small is beautiful: discovering the minimal set of unexpected patterns
A drawback of most traditional data mining methods is that they do not leverage prior knowledge of users. In many business settings, managers and analysts have significant intuiti...
Balaji Padmanabhan, Alexander Tuzhilin
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
15 years 11 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal