Sciweavers

2180 search results - page 16 / 436
» Algorithms for discovering bucket orders from data
Sort
View
PAKDD
1998
ACM
103views Data Mining» more  PAKDD 1998»
14 years 19 days ago
Discovering Case Knowledge Using Data Mining
The use of Data Mining in removing current bottlenecks within Case-based Reasoning (CBR) systems is investigated along with the possible role of CBR in providing a knowledge manag...
Sarabjot S. Anand, David W. Patterson, John G. Hug...
ICDM
2008
IEEE
102views Data Mining» more  ICDM 2008»
14 years 2 months ago
Mining Order-Preserving Submatrices from Data with Repeated Measurements
Order-preserving submatrices (OPSM’s) have been shown useful in capturing concurrent patterns in data when the relative magnitudes of data items are more important than their ab...
Chun Kit Chui, Ben Kao, Kevin Y. Yip, Sau Dan Lee
RECOMB
2004
Springer
14 years 8 months ago
Discovering temporal relations in molecular pathways using protein-protein interactions
The availability of large-scale protein-protein interaction data provides us with many opportunities to study molecular pathways involving proteins. In this paper we propose to mi...
Martin Farach-Colton, Yang Huang, John L. L. Woolf...
ICDE
2012
IEEE
208views Database» more  ICDE 2012»
11 years 11 months ago
Discovering Multiple Clustering Solutions: Grouping Objects in Different Views of the Data
—Traditional clustering algorithms identify just a single clustering of the data. Today’s complex data, however, allow multiple interpretations leading to several valid groupin...
Emmanuel Müller, Stephan Günnemann, Ines...
EDBT
2009
ACM
184views Database» more  EDBT 2009»
14 years 3 months ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer