Sciweavers

2497 search results - page 350 / 500
» A Partial-Repeatability Approach to Data Mining
Sort
View
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
15 years 10 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
SSDBM
2006
IEEE
121views Database» more  SSDBM 2006»
15 years 10 months ago
Time Series Analysis Using the Concept of Adaptable Threshold Similarity
The issue of data mining in time series databases is of utmost importance for many practical applications and has attracted a lot of research in the past years. In this paper, we ...
Johannes Aßfalg, Hans-Peter Kriegel, Peer Kr...
ADC
2005
Springer
183views Database» more  ADC 2005»
15 years 9 months ago
Discovering User Access Pattern Based on Probabilistic Latent Factor Model
There has been an increased demand for characterizing user access patterns using web mining techniques since the informative knowledge extracted from web server log files can not ...
Guandong Xu, Yanchun Zhang, Jiangang Ma, Xiaofang ...
ICDM
2002
IEEE
148views Data Mining» more  ICDM 2002»
15 years 9 months ago
SLPMiner: An Algorithm for Finding Frequent Sequential Patterns Using Length-Decreasing Support Constraint
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
Masakazu Seno, George Karypis
PKDD
2001
Springer
120views Data Mining» more  PKDD 2001»
15 years 8 months ago
Text Categorization and Semantic Browsing with Self-Organizing Maps on Non-euclidean Spaces
This paper introduces a new type of Self-Organizing Map (SOM) for Text Categorization and Semantic Browsing. We propose a “hyperbolic SOM” (HSOM) based on a regular tesselation...
Jörg Ontrup, Helge Ritter