Sciweavers

1836 search results - page 306 / 368
» Mining Clustering Dimensions
Sort
View
KDD
2005
ACM
180views Data Mining» more  KDD 2005»
15 years 5 months ago
Information retrieval based on collaborative filtering with latent interest semantic map
In this paper, we propose an information retrieval model called Latent Interest Semantic Map (LISM), which features retrieval composed of both Collaborative Filtering(CF) and Prob...
Noriaki Kawamae, Katsumi Takahashi
PAKDD
2004
ACM
83views Data Mining» more  PAKDD 2004»
15 years 5 months ago
Providing Diversity in K-Nearest Neighbor Query Results
Abstract. Given a point query Q in multi-dimensional space, K-Nearest Neighbor (KNN) queries return the K closest answers in the database with respect to Q. In this scenario, it is...
Anoop Jain, Parag Sarda, Jayant R. Haritsa
DAWAK
1999
Springer
15 years 4 months ago
Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
KDD
1997
ACM
146views Data Mining» more  KDD 1997»
15 years 4 months ago
Density-Connected Sets and their Application for Trend Detection in Spatial Databases
1 Several clustering algorithms have been proposed for class identification in spatial databases such as earth observation databases. The effectivity of the well-known algorithms ...
Martin Ester, Hans-Peter Kriegel, Jörg Sander...
CINQ
2004
Springer
157views Database» more  CINQ 2004»
15 years 3 months ago
Inductive Databases and Multiple Uses of Frequent Itemsets: The cInQ Approach
Inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operat...
Jean-François Boulicaut