Sciweavers

387 search results - page 34 / 78
» Mining Approximative Descriptions of Sets Using Rough Sets
Sort
View
FOIS
2006
13 years 9 months ago
Approximation of Ontologies in CASL
In this paper we present methods to generate a Description Logic (DL) theory from a given First Order Logic (FOL) theory, such that each DL axiom is entailed by the given FOL theor...
Klaus Lüttich
BMCBI
2008
140views more  BMCBI 2008»
13 years 7 months ago
FUNYBASE: a FUNgal phYlogenomic dataBASE
Background: The increasing availability of fungal genome sequences provides large numbers of proteins for evolutionary and phylogenetic analyses. However the heterogeneity of data...
Sylvain Marthey, Gabriela Aguileta, Françoi...
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 8 months ago
Dense itemsets
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
Heikki Mannila, Jouni K. Seppänen
KDD
2010
ACM
224views Data Mining» more  KDD 2010»
13 years 11 months ago
Multi-label learning by exploiting label dependency
In multi-label learning, each training example is associated with a set of labels and the task is to predict the proper label set for the unseen example. Due to the tremendous (ex...
Min-Ling Zhang, Kun Zhang
ICDE
2007
IEEE
162views Database» more  ICDE 2007»
14 years 9 months ago
On Density Based Transforms for Uncertain Data Mining
In spite of the great progress in the data mining field in recent years, the problem of missing and uncertain data has remained a great challenge for data mining algorithms. Many ...
Charu C. Aggarwal