Sciweavers

140 search results - page 15 / 28
» Discovery of Frequent DATALOG Patterns
Sort
View
EDBT
2009
ACM
138views Database» more  EDBT 2009»
14 years 2 months ago
FOGGER: an algorithm for graph generator discovery
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou
ICDM
2008
IEEE
127views Data Mining» more  ICDM 2008»
14 years 1 months ago
Word Sense Discovery for Web Information Retrieval
Word meaning disambiguation has always been an important problem in many computer science tasks, such as information retrieval and extraction. One of the problems, faced in automa...
Tomasz Nykiel, Henryk Rybinski
BMCBI
2008
141views more  BMCBI 2008»
13 years 7 months ago
Discovering functional interaction patterns in protein-protein interaction networks
Background: In recent years, a considerable amount of research effort has been directed to the analysis of biological networks with the availability of genome-scale networks of ge...
Mehmet E. Turanalp, Tolga Can
DIS
2007
Springer
13 years 11 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
14 years 9 days ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu