Sciweavers

362 search results - page 34 / 73
» Discovering Interesting Holes in Data
Sort
View
89
Voted
ICDM
2006
IEEE
166views Data Mining» more  ICDM 2006»
15 years 4 months ago
Mining Generalized Graph Patterns Based on User Examples
There has been a lot of recent interest in mining patterns from graphs. Often, the exact structure of the patterns of interest is not known. This happens, for example, when molecu...
Pavel Dmitriev, Carl Lagoze
106
Voted
KDD
2005
ACM
218views Data Mining» more  KDD 2005»
15 years 10 months ago
A maximum entropy web recommendation system: combining collaborative and content features
Web users display their preferences implicitly by navigating through a sequence of pages or by providing numeric ratings to some items. Web usage mining techniques are used to ext...
Xin Jin, Yanzan Zhou, Bamshad Mobasher
83
Voted
VIZSEC
2004
Springer
15 years 3 months ago
PortVis: a tool for port-based detection of security events
Most visualizations of security-related network data require large amounts of finely detailed, high-dimensional data. However, in some cases, the data available can only be coars...
Jonathan McPherson, Kwan-Liu Ma, Paul Krystosk, To...
103
Voted
KDD
1995
ACM
193views Data Mining» more  KDD 1995»
15 years 1 months ago
Analyzing the Benefits of Domain Knowledge in Substructure Discovery
Discovering repetitive, interesting, and functional substructures in a structural database improves the ability to interpret and compress the data. However, scientists working wit...
Surnjani Djoko, Diane J. Cook, Lawrence B. Holder
88
Voted
KDD
2005
ACM
91views Data Mining» more  KDD 2005»
15 years 10 months ago
On mining cross-graph quasi-cliques
Joint mining of multiple data sets can often discover interesting, novel, and reliable patterns which cannot be obtained solely from any single source. For example, in cross-marke...
Jian Pei, Daxin Jiang, Aidong Zhang