Time and Space Efficient Discovery of Maximal Geometric Graphs View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2007

AUTHORS

Hiroki Arimura , Takeaki Uno , Shinichi Shimozono

ABSTRACT

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 scaling. While Kuramochi and Karypis (ICDM2002) extensively studied the frequent pattern mining problem for geometric subgraphs, the maximal graph mining has not been considered so far. In this paper, we study the maximal (or closed) graph mining problem for the general class of geometric graphs in the 2D plane by extending the framework of Kuramochi and Karypis. Combining techniques of canonical encoding and a depth-first search tree for the class of maximal patterns, we present a polynomial delay and polynomial space algorithm, MaxGeo, that enumerates all maximal subgraphs in a given input geometric graph without duplicates. This is the first result establishing the output-sensitive complexity of closed graph mining for geometric graphs. We also show that the frequent graph mining problem is also solvable in polynomial delay and polynomial time. More... »

PAGES

42-55

Book

TITLE

Discovery Science

ISBN

978-3-540-75487-9

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-540-75488-6_6

DOI

http://dx.doi.org/10.1007/978-3-540-75488-6_6

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1001317711


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0101", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Pure Mathematics", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/01", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Mathematical Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Hokkaido University", 
          "id": "https://www.grid.ac/institutes/grid.39158.36", 
          "name": [
            "Hokkaido University, Kita 14-jo, Nishi 9-chome, Sapporo 060-0814, Japan"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Arimura", 
        "givenName": "Hiroki", 
        "id": "sg:person.013325377075.00", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013325377075.00"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "National Institute of Informatics", 
          "id": "https://www.grid.ac/institutes/grid.250343.3", 
          "name": [
            "National Institute of Informatics, Tokyo 101\u20138430, Japan"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Uno", 
        "givenName": "Takeaki", 
        "id": "sg:person.016517167551.57", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016517167551.57"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Kyushu Institute of Technology", 
          "id": "https://www.grid.ac/institutes/grid.258806.1", 
          "name": [
            "Kyushu Institute of Technology, Kawazu 680-4, Iizuka 820-8502, Japan"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Shimozono", 
        "givenName": "Shinichi", 
        "id": "sg:person.015565512245.50", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015565512245.50"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1016/s0020-0190(02)00240-5", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1001519681"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/s0020-0190(02)00240-5", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1001519681"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/11536314_1", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1003806620", 
          "https://doi.org/10.1007/11536314_1"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/11536314_1", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1003806620", 
          "https://doi.org/10.1007/11536314_1"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/pl00009388", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1010917210", 
          "https://doi.org/10.1007/pl00009388"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/pl00009388", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1010917210", 
          "https://doi.org/10.1007/pl00009388"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0166-218x(95)00026-n", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1013152121"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/775047.775058", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1013503742"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/956750.956784", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1020461301"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://app.dimensions.ai/details/publication/pub.1021021236", 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-1-4612-1098-6", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1021021236", 
          "https://doi.org/10.1007/978-1-4612-1098-6"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-1-4612-1098-6", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1021021236", 
          "https://doi.org/10.1007/978-1-4612-1098-6"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-45372-5_2", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1026984655", 
          "https://doi.org/10.1007/3-540-45372-5_2"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-45372-5_2", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1026984655", 
          "https://doi.org/10.1007/3-540-45372-5_2"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1023/a:1007610422992", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1028044412", 
          "https://doi.org/10.1023/a:1007610422992"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/1143844.1143964", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1028732912"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-30214-8_2", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1032189170", 
          "https://doi.org/10.1007/978-3-540-30214-8_2"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-30214-8_2", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1032189170", 
          "https://doi.org/10.1007/978-3-540-30214-8_2"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-24775-3_9", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1038916179", 
          "https://doi.org/10.1007/978-3-540-24775-3_9"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-24775-3_9", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1038916179", 
          "https://doi.org/10.1007/978-3-540-24775-3_9"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/956750.956787", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1040031905"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/1014052.1014091", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1041745949"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/959242.959249", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1047866982"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-49257-7_25", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1048579740", 
          "https://doi.org/10.1007/3-540-49257-7_25"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-49257-7_25", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1048579740", 
          "https://doi.org/10.1007/3-540-49257-7_25"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/11602613_73", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1049227974", 
          "https://doi.org/10.1007/11602613_73"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/11602613_73", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1049227974", 
          "https://doi.org/10.1007/11602613_73"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/11602613_73", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1049227974", 
          "https://doi.org/10.1007/11602613_73"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/1.9781611972726.10", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1088799860"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.21236/ada438939", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1091605517"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/icde.2004.1319986", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1093587884"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/icdm.2004.10078", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1095760949"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2007", 
    "datePublishedReg": "2007-01-01", 
    "description": "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 scaling. While Kuramochi and Karypis (ICDM2002) extensively studied the frequent pattern mining problem for geometric subgraphs, the maximal graph mining has not been considered so far. In this paper, we study the maximal (or closed) graph mining problem for the general class of geometric graphs in the 2D plane by extending the framework of Kuramochi and Karypis. Combining techniques of canonical encoding and a depth-first search tree for the class of maximal patterns, we present a polynomial delay and polynomial space algorithm, MaxGeo, that enumerates all maximal subgraphs in a given input geometric graph without duplicates. This is the first result establishing the output-sensitive complexity of closed graph mining for geometric graphs. We also show that the frequent graph mining problem is also solvable in polynomial delay and polynomial time.", 
    "editor": [
      {
        "familyName": "Corruble", 
        "givenName": "Vincent", 
        "type": "Person"
      }, 
      {
        "familyName": "Takeda", 
        "givenName": "Masayuki", 
        "type": "Person"
      }, 
      {
        "familyName": "Suzuki", 
        "givenName": "Einoshin", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-540-75488-6_6", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-75487-9"
      ], 
      "name": "Discovery Science", 
      "type": "Book"
    }, 
    "name": "Time and Space Efficient Discovery of Maximal Geometric Graphs", 
    "pagination": "42-55", 
    "productId": [
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-540-75488-6_6"
        ]
      }, 
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "0646cc93d0d3059ce1b0b8edb800a6b9bb34978501cd4f8560a0f7925d5d5b83"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1001317711"
        ]
      }
    ], 
    "publisher": {
      "location": "Berlin, Heidelberg", 
      "name": "Springer Berlin Heidelberg", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-540-75488-6_6", 
      "https://app.dimensions.ai/details/publication/pub.1001317711"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2019-04-16T05:33", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000346_0000000346/records_99821_00000000.jsonl", 
    "type": "Chapter", 
    "url": "https://link.springer.com/10.1007%2F978-3-540-75488-6_6"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-75488-6_6'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-75488-6_6'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-75488-6_6'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-75488-6_6'


 

This table displays all metadata directly associated to this object as RDF triples.

168 TRIPLES      23 PREDICATES      49 URIs      20 LITERALS      8 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-540-75488-6_6 schema:about anzsrc-for:01
2 anzsrc-for:0101
3 schema:author N1faf207eb52d4fbd8d29287026061f2c
4 schema:citation sg:pub.10.1007/11536314_1
5 sg:pub.10.1007/11602613_73
6 sg:pub.10.1007/3-540-45372-5_2
7 sg:pub.10.1007/3-540-49257-7_25
8 sg:pub.10.1007/978-1-4612-1098-6
9 sg:pub.10.1007/978-3-540-24775-3_9
10 sg:pub.10.1007/978-3-540-30214-8_2
11 sg:pub.10.1007/pl00009388
12 sg:pub.10.1023/a:1007610422992
13 https://app.dimensions.ai/details/publication/pub.1021021236
14 https://doi.org/10.1016/0166-218x(95)00026-n
15 https://doi.org/10.1016/s0020-0190(02)00240-5
16 https://doi.org/10.1109/icde.2004.1319986
17 https://doi.org/10.1109/icdm.2004.10078
18 https://doi.org/10.1137/1.9781611972726.10
19 https://doi.org/10.1145/1014052.1014091
20 https://doi.org/10.1145/1143844.1143964
21 https://doi.org/10.1145/775047.775058
22 https://doi.org/10.1145/956750.956784
23 https://doi.org/10.1145/956750.956787
24 https://doi.org/10.1145/959242.959249
25 https://doi.org/10.21236/ada438939
26 schema:datePublished 2007
27 schema:datePublishedReg 2007-01-01
28 schema:description 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 scaling. While Kuramochi and Karypis (ICDM2002) extensively studied the frequent pattern mining problem for geometric subgraphs, the maximal graph mining has not been considered so far. In this paper, we study the maximal (or closed) graph mining problem for the general class of geometric graphs in the 2D plane by extending the framework of Kuramochi and Karypis. Combining techniques of canonical encoding and a depth-first search tree for the class of maximal patterns, we present a polynomial delay and polynomial space algorithm, MaxGeo, that enumerates all maximal subgraphs in a given input geometric graph without duplicates. This is the first result establishing the output-sensitive complexity of closed graph mining for geometric graphs. We also show that the frequent graph mining problem is also solvable in polynomial delay and polynomial time.
29 schema:editor Nc2851d868f9a44dcb976257f890675ef
30 schema:genre chapter
31 schema:inLanguage en
32 schema:isAccessibleForFree true
33 schema:isPartOf Na0e1ec7dde7045a0a260f3f2026927a9
34 schema:name Time and Space Efficient Discovery of Maximal Geometric Graphs
35 schema:pagination 42-55
36 schema:productId N1b5e88e79a324112953532bebf79ad00
37 N4a37f60d2dc14a75982703538b27a24d
38 Nfe51b08dc9364879aba0f68df651799d
39 schema:publisher N8947bdfd70bf4b34ab6222e27583dbd6
40 schema:sameAs https://app.dimensions.ai/details/publication/pub.1001317711
41 https://doi.org/10.1007/978-3-540-75488-6_6
42 schema:sdDatePublished 2019-04-16T05:33
43 schema:sdLicense https://scigraph.springernature.com/explorer/license/
44 schema:sdPublisher N7096bd36c9524d01829e5852d591cb34
45 schema:url https://link.springer.com/10.1007%2F978-3-540-75488-6_6
46 sgo:license sg:explorer/license/
47 sgo:sdDataset chapters
48 rdf:type schema:Chapter
49 N0098186e953c43b299930426da7c5da7 schema:familyName Corruble
50 schema:givenName Vincent
51 rdf:type schema:Person
52 N1b5e88e79a324112953532bebf79ad00 schema:name readcube_id
53 schema:value 0646cc93d0d3059ce1b0b8edb800a6b9bb34978501cd4f8560a0f7925d5d5b83
54 rdf:type schema:PropertyValue
55 N1b78d006d90c48bebca2878429d4a585 schema:familyName Suzuki
56 schema:givenName Einoshin
57 rdf:type schema:Person
58 N1faf207eb52d4fbd8d29287026061f2c rdf:first sg:person.013325377075.00
59 rdf:rest N5ed4a698f6a6432ca5e8d994cd8bcd73
60 N49b42c3cb2614f4c8c6dc272730e513b rdf:first N1b78d006d90c48bebca2878429d4a585
61 rdf:rest rdf:nil
62 N4a37f60d2dc14a75982703538b27a24d schema:name doi
63 schema:value 10.1007/978-3-540-75488-6_6
64 rdf:type schema:PropertyValue
65 N5ed4a698f6a6432ca5e8d994cd8bcd73 rdf:first sg:person.016517167551.57
66 rdf:rest Nc3307fbe714d47e39ed2d04ff94f197d
67 N7096bd36c9524d01829e5852d591cb34 schema:name Springer Nature - SN SciGraph project
68 rdf:type schema:Organization
69 N8947bdfd70bf4b34ab6222e27583dbd6 schema:location Berlin, Heidelberg
70 schema:name Springer Berlin Heidelberg
71 rdf:type schema:Organisation
72 N98130d5f28dc4bc1ad71f82d935c0f32 rdf:first Nc31d0bbb35e44401aef6e9dd3dc7549d
73 rdf:rest N49b42c3cb2614f4c8c6dc272730e513b
74 Na0e1ec7dde7045a0a260f3f2026927a9 schema:isbn 978-3-540-75487-9
75 schema:name Discovery Science
76 rdf:type schema:Book
77 Nc2851d868f9a44dcb976257f890675ef rdf:first N0098186e953c43b299930426da7c5da7
78 rdf:rest N98130d5f28dc4bc1ad71f82d935c0f32
79 Nc31d0bbb35e44401aef6e9dd3dc7549d schema:familyName Takeda
80 schema:givenName Masayuki
81 rdf:type schema:Person
82 Nc3307fbe714d47e39ed2d04ff94f197d rdf:first sg:person.015565512245.50
83 rdf:rest rdf:nil
84 Nfe51b08dc9364879aba0f68df651799d schema:name dimensions_id
85 schema:value pub.1001317711
86 rdf:type schema:PropertyValue
87 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
88 schema:name Mathematical Sciences
89 rdf:type schema:DefinedTerm
90 anzsrc-for:0101 schema:inDefinedTermSet anzsrc-for:
91 schema:name Pure Mathematics
92 rdf:type schema:DefinedTerm
93 sg:person.013325377075.00 schema:affiliation https://www.grid.ac/institutes/grid.39158.36
94 schema:familyName Arimura
95 schema:givenName Hiroki
96 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013325377075.00
97 rdf:type schema:Person
98 sg:person.015565512245.50 schema:affiliation https://www.grid.ac/institutes/grid.258806.1
99 schema:familyName Shimozono
100 schema:givenName Shinichi
101 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015565512245.50
102 rdf:type schema:Person
103 sg:person.016517167551.57 schema:affiliation https://www.grid.ac/institutes/grid.250343.3
104 schema:familyName Uno
105 schema:givenName Takeaki
106 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016517167551.57
107 rdf:type schema:Person
108 sg:pub.10.1007/11536314_1 schema:sameAs https://app.dimensions.ai/details/publication/pub.1003806620
109 https://doi.org/10.1007/11536314_1
110 rdf:type schema:CreativeWork
111 sg:pub.10.1007/11602613_73 schema:sameAs https://app.dimensions.ai/details/publication/pub.1049227974
112 https://doi.org/10.1007/11602613_73
113 rdf:type schema:CreativeWork
114 sg:pub.10.1007/3-540-45372-5_2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1026984655
115 https://doi.org/10.1007/3-540-45372-5_2
116 rdf:type schema:CreativeWork
117 sg:pub.10.1007/3-540-49257-7_25 schema:sameAs https://app.dimensions.ai/details/publication/pub.1048579740
118 https://doi.org/10.1007/3-540-49257-7_25
119 rdf:type schema:CreativeWork
120 sg:pub.10.1007/978-1-4612-1098-6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1021021236
121 https://doi.org/10.1007/978-1-4612-1098-6
122 rdf:type schema:CreativeWork
123 sg:pub.10.1007/978-3-540-24775-3_9 schema:sameAs https://app.dimensions.ai/details/publication/pub.1038916179
124 https://doi.org/10.1007/978-3-540-24775-3_9
125 rdf:type schema:CreativeWork
126 sg:pub.10.1007/978-3-540-30214-8_2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1032189170
127 https://doi.org/10.1007/978-3-540-30214-8_2
128 rdf:type schema:CreativeWork
129 sg:pub.10.1007/pl00009388 schema:sameAs https://app.dimensions.ai/details/publication/pub.1010917210
130 https://doi.org/10.1007/pl00009388
131 rdf:type schema:CreativeWork
132 sg:pub.10.1023/a:1007610422992 schema:sameAs https://app.dimensions.ai/details/publication/pub.1028044412
133 https://doi.org/10.1023/a:1007610422992
134 rdf:type schema:CreativeWork
135 https://app.dimensions.ai/details/publication/pub.1021021236 schema:CreativeWork
136 https://doi.org/10.1016/0166-218x(95)00026-n schema:sameAs https://app.dimensions.ai/details/publication/pub.1013152121
137 rdf:type schema:CreativeWork
138 https://doi.org/10.1016/s0020-0190(02)00240-5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1001519681
139 rdf:type schema:CreativeWork
140 https://doi.org/10.1109/icde.2004.1319986 schema:sameAs https://app.dimensions.ai/details/publication/pub.1093587884
141 rdf:type schema:CreativeWork
142 https://doi.org/10.1109/icdm.2004.10078 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095760949
143 rdf:type schema:CreativeWork
144 https://doi.org/10.1137/1.9781611972726.10 schema:sameAs https://app.dimensions.ai/details/publication/pub.1088799860
145 rdf:type schema:CreativeWork
146 https://doi.org/10.1145/1014052.1014091 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041745949
147 rdf:type schema:CreativeWork
148 https://doi.org/10.1145/1143844.1143964 schema:sameAs https://app.dimensions.ai/details/publication/pub.1028732912
149 rdf:type schema:CreativeWork
150 https://doi.org/10.1145/775047.775058 schema:sameAs https://app.dimensions.ai/details/publication/pub.1013503742
151 rdf:type schema:CreativeWork
152 https://doi.org/10.1145/956750.956784 schema:sameAs https://app.dimensions.ai/details/publication/pub.1020461301
153 rdf:type schema:CreativeWork
154 https://doi.org/10.1145/956750.956787 schema:sameAs https://app.dimensions.ai/details/publication/pub.1040031905
155 rdf:type schema:CreativeWork
156 https://doi.org/10.1145/959242.959249 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047866982
157 rdf:type schema:CreativeWork
158 https://doi.org/10.21236/ada438939 schema:sameAs https://app.dimensions.ai/details/publication/pub.1091605517
159 rdf:type schema:CreativeWork
160 https://www.grid.ac/institutes/grid.250343.3 schema:alternateName National Institute of Informatics
161 schema:name National Institute of Informatics, Tokyo 101–8430, Japan
162 rdf:type schema:Organization
163 https://www.grid.ac/institutes/grid.258806.1 schema:alternateName Kyushu Institute of Technology
164 schema:name Kyushu Institute of Technology, Kawazu 680-4, Iizuka 820-8502, Japan
165 rdf:type schema:Organization
166 https://www.grid.ac/institutes/grid.39158.36 schema:alternateName Hokkaido University
167 schema:name Hokkaido University, Kita 14-jo, Nishi 9-chome, Sapporo 060-0814, Japan
168 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...