878 search results - page 32 / 176 » Modeling Relational Data as Graphs for Mining |
139
click to vote
DSS
2007
15 years 4 months ago
2007
We present two algorithms for learning large-scale gene regulatory networks from microarray data: a modified informationtheory-based Bayesian network algorithm and a modified asso...
133
click to vote
IFIP12
2007
15 years 5 months ago
2007
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
146
click to vote
JIIS
2006
15 years 4 months ago
2006
: Geographic information (e.g., locations, networks, and nearest neighbors) are unique and different from other aspatial attributes (e.g., population, sales, or income). It is a ch...
156
click to vote
KDD
2012
ACM
13 years 6 months ago
2012
ACM
Blockmodelling is an important technique for decomposing graphs into sets of roles. Vertices playing the same role have similar patterns of interactions with vertices in other rol...
142
click to vote
SDM
2010
SIAM
15 years 5 months ago
2010
SIAM
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...