Sciweavers

1061 search results - page 140 / 213
» An Experimental Study of Data Migration Algorithms
Sort
View
145
Voted
AAAI
2008
15 years 6 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
111
Voted
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 4 months ago
Dense itemsets
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
Heikki Mannila, Jouni K. Seppänen
149
Voted
KDD
2007
ACM
151views Data Mining» more  KDD 2007»
16 years 4 months ago
Efficient mining of iterative patterns for software specification discovery
Studies have shown that program comprehension takes up to 45% of software development costs. Such high costs are caused by the lack-of documented specification and further aggrava...
Chao Liu 0001, David Lo, Siau-Cheng Khoo
141
Voted
WSDM
2010
ACM
322views Data Mining» more  WSDM 2010»
16 years 1 months ago
Inferring Search Behaviors Using Partially Observable Markov (POM) Model
This article describes an application of the partially observable Markov (POM) model to the analysis of a large scale commercial web search log. Mathematically, POM is a variant o...
Kuansan Wang, Nikolas Gloy, Xiaolong Li
WSDM
2012
ACM
334views Data Mining» more  WSDM 2012»
13 years 11 months ago
mTrust: discerning multi-faceted trust in a connected world
Traditionally, research about trust assumes a single type of trust between users. However, trust, as a social concept, inherently has many facets indicating multiple and heterogen...
Jiliang Tang, Huiji Gao, Huan Liu