1861 search results - page 285 / 373 » Pattern Databases |
134
Voted
KDD
2006
ACM
16 years 3 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
128
Voted
KDD
2004
ACM
16 years 3 months ago
2004
ACM
Essentially all data mining algorithms assume that the datagenerating process is independent of the data miner's activities. However, in many domains, including spam detectio...
133
Voted
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
This paper describes a hidden Markov model (HMM) based approach to perform search interface segmentation. Automatic processing of an interface is a must to access the invisible co...
259
click to vote
ICDE
2009
IEEE
16 years 4 months ago
2009
IEEE
This paper investigates the discovery of conditional functional dependencies (CFDs). CFDs are a recent extension of functional dependencies (FDs) by supporting patterns of semantic...
219
Voted
ICDE
2008
IEEE
16 years 4 months ago
2008
IEEE
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...