Sciweavers

449 search results - page 54 / 90
» Measuring the Similarity of Geometric Graphs
Sort
View
CMOT
2004
141views more  CMOT 2004»
13 years 7 months ago
Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
Garry Robins, Malcolm Alexander
WEBI
2004
Springer
14 years 1 months ago
TSSP: A Reinforcement Algorithm to Find Related Papers
Content analysis and citation analysis are two common methods in recommending system. Compared with content analysis, citation analysis can discover more implicitly related papers...
Shen Huang, Gui-Rong Xue, Benyu Zhang, Zheng Chen,...
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
14 years 7 months ago
On Schema Matching with Opaque Column Names and Data Values
Most previous solutions to the schema matching problem rely in some fashion upon identifying "similar" column names in the schemas to be matched, or by recognizing commo...
Jaewoo Kang, Jeffrey F. Naughton
ICMCS
2005
IEEE
162views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Clustering of Video Objects by Graph Matching
We propose a new graph-based data structure, called Spatio Temporal Region Graph (STRG) which can represent the content of video sequence. Unlike existing ones which consider main...
JeongKyu Lee, Jung-Hwan Oh, Sae Hwang
ICDM
2005
IEEE
190views Data Mining» more  ICDM 2005»
14 years 1 months ago
Neighborhood Formation and Anomaly Detection in Bipartite Graphs
Many real applications can be modeled using bipartite graphs, such as users vs. files in a P2P system, traders vs. stocks in a financial trading system, conferences vs. authors ...
Jimeng Sun, Huiming Qu, Deepayan Chakrabarti, Chri...