Sciweavers

155 search results - page 29 / 31
» An efficient algorithm for mining closed inter-transaction i...
Sort
View
KDD
2004
ACM
138views Data Mining» more  KDD 2004»
16 years 3 months ago
IDR/QR: an incremental dimension reduction algorithm via QR decomposition
Dimension reduction is a critical data preprocessing step for many database and data mining applications, such as efficient storage and retrieval of high-dimensional data. In the ...
Jieping Ye, Qi Li, Hui Xiong, Haesun Park, Ravi Ja...
KDD
2005
ACM
137views Data Mining» more  KDD 2005»
16 years 3 months ago
Pattern-based similarity search for microarray data
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
Haixun Wang, Jian Pei, Philip S. Yu
SAC
2010
ACM
15 years 10 months ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil
AIIA
2005
Springer
15 years 8 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
ICDE
2006
IEEE
133views Database» more  ICDE 2006»
16 years 4 months ago
ViEWNet: Visual Exploration of Region-Wide Traffic Networks
Location-based services and data mining algorithms analyzing objects moving on a complex traffic network are becoming increasingly important. In this paper, we introduce a new app...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...