Sciweavers

1116 search results - page 173 / 224
» Domination Mining and Querying
Sort
View
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
14 years 1 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
KDD
2005
ACM
180views Data Mining» more  KDD 2005»
14 years 1 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
ICDM
2003
IEEE
184views Data Mining» more  ICDM 2003»
14 years 1 months ago
Detecting Patterns of Change Using Enhanced Parallel Coordinates Visualization
Analyzing data to find trends, correlations, and stable patterns is an important problem for many industrial applications. In this paper, we propose a new technique based on paral...
Kaidi Zhao, Bing Liu, Thomas M. Tirpak, Andreas Sc...
SSD
1999
Springer
197views Database» more  SSD 1999»
13 years 12 months ago
3D Shape Histograms for Similarity Search and Classification in Spatial Databases
Classification is one of the basic tasks of data mining in modern database applications including molecular biology, astronomy, mechanical engineering, medical imaging or meteorolo...
Mihael Ankerst, Gabi Kastenmüller, Hans-Peter...
KDD
1998
ACM
99views Data Mining» more  KDD 1998»
13 years 12 months ago
On the Efficient Gathering of Sufficient Statistics for Classification from Large SQL Databases
For a wide variety of classification algorithms, scalability to large databases can be achieved by observing that most algorithms are driven by a set of sufficient statistics that...
Goetz Graefe, Usama M. Fayyad, Surajit Chaudhuri