Sciweavers

2180 search results - page 73 / 436
» Algorithms for discovering bucket orders from data
Sort
View
BIBE
2005
IEEE
15 years 9 months ago
Selecting Informative Genes from Microarray Dataset by Incorporating Gene Ontology
Selecting informative genes from microarray experiments is one of the most important data analysis steps for deciphering biological information imbedded in such experiments. Howev...
Xian Xu, Aidong Zhang
KDD
2004
ACM
285views Data Mining» more  KDD 2004»
15 years 9 months ago
Effective localized regression for damage detection in large complex mechanical structures
In this paper, we propose a novel data mining technique for the efficient damage detection within the large-scale complex mechanical structures. Every mechanical structure is defi...
Aleksandar Lazarevic, Ramdev Kanapady, Chandrika K...
ICDE
2008
IEEE
124views Database» more  ICDE 2008»
16 years 5 months ago
Mining Approximate Order Preserving Clusters in the Presence of Noise
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
Mengsheng Zhang, Wei Wang 0010, Jinze Liu
PVLDB
2010
107views more  PVLDB 2010»
15 years 2 months ago
On Multi-Column Foreign Key Discovery
A foreign/primary key relationship between relational tables is one of the most important constraints in a database. From a data analysis perspective, discovering foreign keys is ...
Meihui Zhang, Marios Hadjieleftheriou, Beng Chin O...
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
15 years 10 months ago
Fast Frequent Free Tree Mining in Graph Databases
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
Peixiang Zhao, Jeffrey Xu Yu