Sciweavers

641 search results - page 105 / 129
» Collusion set detection using graph clustering
Sort
View
SIGIR
2005
ACM
14 years 2 months ago
SimFusion: measuring similarity using unified relationship matrix
In this paper we use a Unified Relationship Matrix (URM) to represent a set of heterogeneous data objects (e.g., web pages, queries) and their interrelationships (e.g., hyperlinks...
Wensi Xi, Edward A. Fox, Weiguo Fan, Benyu Zhang, ...
SDM
2012
SIAM
252views Data Mining» more  SDM 2012»
11 years 11 months ago
Learning from Heterogeneous Sources via Gradient Boosting Consensus
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
Xiaoxiao Shi, Jean-François Paiement, David...
BMCBI
2004
104views more  BMCBI 2004»
13 years 8 months ago
Discriminative topological features reveal biological network mechanisms
Background: Recent genomic and bioinformatic advances have motivated the development of numerous network models intending to describe graphs of biological, technological, and soci...
Manuel Middendorf, Etay Ziv, Carter Adams, Jen Hom...
JGS
2006
113views more  JGS 2006»
13 years 8 months ago
Pattern based map comparisons
Map comparison techniques based on a pixel-by-pixel comparison are useful for many purposes, but fail to reveal important aspects of map similarities and differences. In contrast, ...
Roger White
SADM
2010
123views more  SADM 2010»
13 years 7 months ago
Discriminative frequent subgraph mining with optimality guarantees
The goal of frequent subgraph mining is to detect subgraphs that frequently occur in a dataset of graphs. In classification settings, one is often interested in discovering discr...
Marisa Thoma, Hong Cheng, Arthur Gretton, Jiawei H...