Sciweavers

942 search results - page 153 / 189
» Efficiently Mining Long Patterns from Databases
Sort
View
69
Voted
SDM
2010
SIAM
153views Data Mining» more  SDM 2010»
14 years 11 months ago
The Generalized Dimensionality Reduction Problem
The dimensionality reduction problem has been widely studied in the database literature because of its application for concise data representation in a variety of database applica...
Charu C. Aggarwal
PKDD
1999
Springer
106views Data Mining» more  PKDD 1999»
15 years 1 months ago
Heuristic Measures of Interestingness
When mining a large database, the number of patterns discovered can easily exceed the capabilities of a human user to identify interesting results. To address this problem, variou...
Robert J. Hilderman, Howard J. Hamilton
86
Voted
BMCBI
2007
107views more  BMCBI 2007»
14 years 9 months ago
antiCODE: a natural sense-antisense transcripts database
Background: Natural antisense transcripts (NATs) are endogenous RNA molecules that exhibit partial or complete complementarity to other RNAs, and that may contribute to the regula...
Yifei Yin, Yi Zhao, Jie Wang, Changning Liu, Shugu...
ICDE
2002
IEEE
206views Database» more  ICDE 2002»
15 years 11 months ago
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
Raghav Kaushik, Pradeep Shenoy, Philip Bohannon, E...
DAC
2005
ACM
14 years 11 months ago
Path delay test compaction with process variation tolerance
In this paper we propose a test compaction method for path delay faults in a logic circuit. The method generates a compact set of two-pattern tests for faults on long paths select...
Seiji Kajihara, Masayasu Fukunaga, Xiaoqing Wen, T...