Sciweavers

301 search results - page 18 / 61
» On Finding Dense Subgraphs
Sort
View
90
Voted
CIKM
2010
Springer
14 years 7 months ago
Discovery of numerous specific topics via term co-occurrence analysis
We describe efficient techniques for construction of large term co-occurrence graphs, and investigate an application to the discovery of numerous fine-grained (specific) topics. A...
Omid Madani, Jiye Yu
BMCBI
2008
208views more  BMCBI 2008»
14 years 9 months ago
GraphFind: enhancing graph searching by low support data mining techniques
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
Alfredo Ferro, Rosalba Giugno, Misael Mongiov&igra...
NIPS
2004
14 years 11 months ago
Semi-supervised Learning on Directed Graphs
Given a directed graph in which some of the nodes are labeled, we investigate the question of how to exploit the link structure of the graph to infer the labels of the remaining u...
Dengyong Zhou, Bernhard Schölkopf, Thomas Hof...
WABI
2001
Springer
142views Bioinformatics» more  WABI 2001»
15 years 2 months ago
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
Juris Viksna, David Gilbert
ICDE
2006
IEEE
110views Database» more  ICDE 2006»
15 years 11 months ago
Mining Dense Periodic Patterns in Time Series Data
Existing techniques to mine periodic patterns in time series data are focused on discovering full-cycle periodic patterns from an entire time series. However, many useful partial ...
Chang Sheng, Wynne Hsu, Mong-Li Lee