Sciweavers

1314 search results - page 80 / 263
» Approximate data mining in very large relational data
Sort
View
AAAI
2010
15 years 3 months ago
Soundness Preserving Approximation for TBox Reasoning
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractab...
Yuan Ren, Jeff Z. Pan, Yuting Zhao
CBMS
2009
IEEE
15 years 8 months ago
On the storage, management and analysis of (multi) similarity for large scale protein structure datasets in the grid
Assessment of the (Multi) Similarity among a set of protein structures is achieved through an ensemble of protein structure comparison methods/algorithms. This leads to the genera...
Gianluigi Folino, Azhar Ali Shah, Natalio Krasnogo...
JCP
2006
173views more  JCP 2006»
15 years 1 months ago
Database Intrusion Detection using Weighted Sequence Mining
Data mining is widely used to identify interesting, potentially useful and understandable patterns from a large data repository. With many organizations focusing on webbased on-lin...
Abhinav Srivastava, Shamik Sural, Arun K. Majumdar
AIIA
2005
Springer
15 years 7 months ago
Towards Fault-Tolerant Formal Concept Analysis
Given Boolean data sets which record properties of objects, Formal Concept Analysis is a well-known approach for knowledge discovery. Recent application domains, e.g., for very lar...
Ruggero G. Pensa, Jean-François Boulicaut
ICDM
2005
IEEE
143views Data Mining» more  ICDM 2005»
15 years 7 months ago
A Computational Framework for Taxonomic Research: Diagnosing Body Shape within Fish Species Complexes
It is estimated that ninety percent of the world’s species have yet to be discovered and described. The main reason for the slow pace of new species description is that the scie...
Yixin Chen, Henry L. Bart Jr., Shuqing Huang, Huim...