Sciweavers

7581 search results - page 459 / 1517
» Incompleteness in Data Mining
Sort
View
ER
2004
Springer
103views Database» more  ER 2004»
16 years 7 days ago
Modeling Default Induction with Conceptual Structures
Our goal is to model the way people induce knowledge from rare and sparse data. This paper describes a theoretical framework for inducing knowledge from these incomplete data descr...
Julien Velcin, Jean-Gabriel Ganascia
194
Voted
DAWAK
2005
Springer
16 years 12 days ago
A Decremental Algorithm for Maintaining Frequent Itemsets in Dynamic Databases
Data mining and machine learning must confront the problem of pattern maintenance because data updating is a fundamental operation in data management. Most existing data-mining alg...
Shichao Zhang, Xindong Wu, Jilian Zhang, Chengqi Z...
ISMIS
2005
Springer
16 years 11 days ago
A Data Model Based on Paraconsistent Intuitionistic Fuzzy Relations
Abstract. Paraconsistent intuitionistic fuzzy set is an extension of intuitionistic fuzzy set or interval-valued fuzzy set. It relaxes the requirement that t + f ≤ 1, where t is ...
Haibin Wang, Rajshekhar Sunderraman
191
Voted
ADMA
2005
Springer
124views Data Mining» more  ADMA 2005»
15 years 8 months ago
Finding All Frequent Patterns Starting from the Closure
Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of d...
Mohammad El-Hajj, Osmar R. Zaïane
153
Voted
ICDM
2006
IEEE
132views Data Mining» more  ICDM 2006»
16 years 27 days ago
Mining for Tree-Query Associations in a Graph
New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasets structured as graphs. We present an efficient algorithm for minin...
Eveline Hoekx, Jan Van den Bussche