A CMAC-based scheme for determining membership with classification of text strings View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

2015-07-10

AUTHORS

Heng Ma, Ying-Chih Tseng, Lu-I. Chen

ABSTRACT

Membership determination of text strings has been an important procedure for analyzing textual data of a tremendous amount, especially when time is a crucial factor. Bloom filter has been a well-known approach for dealing with such a problem because of its succinct structure and simple determination procedure. As determination of membership with classification is becoming increasingly desirable, parallel Bloom filters are often implemented for facilitating the additional classification requirement. The parallel Bloom filters, however, tend to produce additional false-positive errors since membership determination must be performed on each of the parallel layers. We propose a scheme based on CMAC, a neural network mapping, which only requires a single-layer calculation to simultaneously obtain information of both the membership and classification. A hash function specifically designed for text strings is also proposed. The proposed scheme could effectively reduce false-positive errors by converging the range of membership acceptance to the minimum for each class during the neural network mapping. Simulation results show that the proposed scheme committed significantly less errors than the benchmark, parallel Bloom filters, with limited and identical memory usage at different classification levels. More... »

PAGES

1959-1967

References to SciGraph publications

  • 1998. Augmenting Suffix Trees, with Applications in ALGORITHMS — ESA’ 98
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s00521-015-1989-6

    DOI

    http://dx.doi.org/10.1007/s00521-015-1989-6

    DIMENSIONS

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

    PUBMED

    https://www.ncbi.nlm.nih.gov/pubmed/27616819


    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/08", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Information and Computing Sciences", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0801", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Artificial Intelligence and Image Processing", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "Department of Industrial Management, Chung Hua University, No. 707, Sec.2, WuFu Rd., Hsinchu, Taiwan", 
              "id": "http://www.grid.ac/institutes/grid.411655.2", 
              "name": [
                "Department of Industrial Management, Chung Hua University, No. 707, Sec.2, WuFu Rd., Hsinchu, Taiwan"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Ma", 
            "givenName": "Heng", 
            "id": "sg:person.010101465477.39", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010101465477.39"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Ph.D. Program of Technology Management, Chung Hua University, Hsinchu, Taiwan", 
              "id": "http://www.grid.ac/institutes/grid.411655.2", 
              "name": [
                "Ph.D. Program of Technology Management, Chung Hua University, Hsinchu, Taiwan"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Tseng", 
            "givenName": "Ying-Chih", 
            "id": "sg:person.012112576575.37", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012112576575.37"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Ph.D. Program of Technology Management, Chung Hua University, Hsinchu, Taiwan", 
              "id": "http://www.grid.ac/institutes/grid.411655.2", 
              "name": [
                "Ph.D. Program of Technology Management, Chung Hua University, Hsinchu, Taiwan"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Chen", 
            "givenName": "Lu-I.", 
            "id": "sg:person.012710157175.96", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012710157175.96"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/3-540-68530-8_6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1008184855", 
              "https://doi.org/10.1007/3-540-68530-8_6"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2015-07-10", 
        "datePublishedReg": "2015-07-10", 
        "description": "Membership determination of text strings has been an important procedure for analyzing textual data of a tremendous amount, especially when time is a crucial factor. Bloom filter has been a well-known approach for dealing with such a problem because of its succinct structure and simple determination procedure. As determination of membership with classification is becoming increasingly desirable, parallel Bloom filters are often implemented for facilitating the additional classification requirement. The parallel Bloom filters, however, tend to produce additional false-positive errors since membership determination must be performed on each of the parallel layers. We propose a scheme based on CMAC, a neural network mapping, which only requires a single-layer calculation to simultaneously obtain information of both the membership and classification. A hash function specifically designed for text strings is also proposed. The proposed scheme could effectively reduce false-positive errors by converging the range of membership acceptance to the minimum for each class during the neural network mapping. Simulation results show that the proposed scheme committed significantly less errors than the benchmark, parallel Bloom filters, with limited and identical memory usage at different classification levels.", 
        "genre": "article", 
        "id": "sg:pub.10.1007/s00521-015-1989-6", 
        "inLanguage": "en", 
        "isAccessibleForFree": true, 
        "isPartOf": [
          {
            "id": "sg:journal.1104357", 
            "issn": [
              "0941-0643", 
              "1433-3058"
            ], 
            "name": "Neural Computing and Applications", 
            "publisher": "Springer Nature", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "7", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "27"
          }
        ], 
        "keywords": [
          "parallel Bloom filters", 
          "Bloom filter", 
          "neural network mapping", 
          "text strings", 
          "network mapping", 
          "different classification levels", 
          "false positive errors", 
          "hash function", 
          "memory usage", 
          "textual data", 
          "classification requirements", 
          "tremendous amount", 
          "classification levels", 
          "succinct structure", 
          "simulation results", 
          "less error", 
          "scheme", 
          "classification", 
          "determination of membership", 
          "membership determination", 
          "CMAC", 
          "important procedure", 
          "strings", 
          "error", 
          "filter", 
          "mapping", 
          "usage", 
          "requirements", 
          "information", 
          "crucial factor", 
          "membership", 
          "data", 
          "acceptance", 
          "class", 
          "parallel layers", 
          "time", 
          "amount", 
          "determination procedure", 
          "procedure", 
          "results", 
          "layer", 
          "function", 
          "structure", 
          "minimum", 
          "calculations", 
          "range", 
          "levels", 
          "determination", 
          "factors", 
          "problem", 
          "approach", 
          "simple determination procedure", 
          "additional classification requirement", 
          "additional false-positive errors", 
          "single-layer calculation", 
          "membership acceptance", 
          "identical memory usage", 
          "CMAC-based scheme"
        ], 
        "name": "A CMAC-based scheme for determining membership with classification of text strings", 
        "pagination": "1959-1967", 
        "productId": [
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1009646217"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s00521-015-1989-6"
            ]
          }, 
          {
            "name": "pubmed_id", 
            "type": "PropertyValue", 
            "value": [
              "27616819"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s00521-015-1989-6", 
          "https://app.dimensions.ai/details/publication/pub.1009646217"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2021-12-01T19:32", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20211201/entities/gbq_results/article/article_655.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "https://doi.org/10.1007/s00521-015-1989-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/s00521-015-1989-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/s00521-015-1989-6'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s00521-015-1989-6'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s00521-015-1989-6'


     

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

    140 TRIPLES      22 PREDICATES      85 URIs      76 LITERALS      7 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s00521-015-1989-6 schema:about anzsrc-for:08
    2 anzsrc-for:0801
    3 schema:author N0b6240f77d7045ceaf8abbac019993be
    4 schema:citation sg:pub.10.1007/3-540-68530-8_6
    5 schema:datePublished 2015-07-10
    6 schema:datePublishedReg 2015-07-10
    7 schema:description Membership determination of text strings has been an important procedure for analyzing textual data of a tremendous amount, especially when time is a crucial factor. Bloom filter has been a well-known approach for dealing with such a problem because of its succinct structure and simple determination procedure. As determination of membership with classification is becoming increasingly desirable, parallel Bloom filters are often implemented for facilitating the additional classification requirement. The parallel Bloom filters, however, tend to produce additional false-positive errors since membership determination must be performed on each of the parallel layers. We propose a scheme based on CMAC, a neural network mapping, which only requires a single-layer calculation to simultaneously obtain information of both the membership and classification. A hash function specifically designed for text strings is also proposed. The proposed scheme could effectively reduce false-positive errors by converging the range of membership acceptance to the minimum for each class during the neural network mapping. Simulation results show that the proposed scheme committed significantly less errors than the benchmark, parallel Bloom filters, with limited and identical memory usage at different classification levels.
    8 schema:genre article
    9 schema:inLanguage en
    10 schema:isAccessibleForFree true
    11 schema:isPartOf N6b7dfad4781b4456b4fb3c8cd281dd3e
    12 Nf234cbd4d0064d9a9935d7ee352b6a93
    13 sg:journal.1104357
    14 schema:keywords Bloom filter
    15 CMAC
    16 CMAC-based scheme
    17 acceptance
    18 additional classification requirement
    19 additional false-positive errors
    20 amount
    21 approach
    22 calculations
    23 class
    24 classification
    25 classification levels
    26 classification requirements
    27 crucial factor
    28 data
    29 determination
    30 determination of membership
    31 determination procedure
    32 different classification levels
    33 error
    34 factors
    35 false positive errors
    36 filter
    37 function
    38 hash function
    39 identical memory usage
    40 important procedure
    41 information
    42 layer
    43 less error
    44 levels
    45 mapping
    46 membership
    47 membership acceptance
    48 membership determination
    49 memory usage
    50 minimum
    51 network mapping
    52 neural network mapping
    53 parallel Bloom filters
    54 parallel layers
    55 problem
    56 procedure
    57 range
    58 requirements
    59 results
    60 scheme
    61 simple determination procedure
    62 simulation results
    63 single-layer calculation
    64 strings
    65 structure
    66 succinct structure
    67 text strings
    68 textual data
    69 time
    70 tremendous amount
    71 usage
    72 schema:name A CMAC-based scheme for determining membership with classification of text strings
    73 schema:pagination 1959-1967
    74 schema:productId N46fce31df763484d9d10abbff7b21053
    75 N579dba46050445e185218d66b96e257c
    76 N628bf425313348e69dadcf4c4833395f
    77 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009646217
    78 https://doi.org/10.1007/s00521-015-1989-6
    79 schema:sdDatePublished 2021-12-01T19:32
    80 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    81 schema:sdPublisher Ne2a6804896654517911d8c88542d62b9
    82 schema:url https://doi.org/10.1007/s00521-015-1989-6
    83 sgo:license sg:explorer/license/
    84 sgo:sdDataset articles
    85 rdf:type schema:ScholarlyArticle
    86 N07a98309d32e49b493cad5eacfc1bfa0 rdf:first sg:person.012710157175.96
    87 rdf:rest rdf:nil
    88 N0b6240f77d7045ceaf8abbac019993be rdf:first sg:person.010101465477.39
    89 rdf:rest Nba1b1a9e00914c38bea4a744dab7752e
    90 N46fce31df763484d9d10abbff7b21053 schema:name doi
    91 schema:value 10.1007/s00521-015-1989-6
    92 rdf:type schema:PropertyValue
    93 N579dba46050445e185218d66b96e257c schema:name pubmed_id
    94 schema:value 27616819
    95 rdf:type schema:PropertyValue
    96 N628bf425313348e69dadcf4c4833395f schema:name dimensions_id
    97 schema:value pub.1009646217
    98 rdf:type schema:PropertyValue
    99 N6b7dfad4781b4456b4fb3c8cd281dd3e schema:issueNumber 7
    100 rdf:type schema:PublicationIssue
    101 Nba1b1a9e00914c38bea4a744dab7752e rdf:first sg:person.012112576575.37
    102 rdf:rest N07a98309d32e49b493cad5eacfc1bfa0
    103 Ne2a6804896654517911d8c88542d62b9 schema:name Springer Nature - SN SciGraph project
    104 rdf:type schema:Organization
    105 Nf234cbd4d0064d9a9935d7ee352b6a93 schema:volumeNumber 27
    106 rdf:type schema:PublicationVolume
    107 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    108 schema:name Information and Computing Sciences
    109 rdf:type schema:DefinedTerm
    110 anzsrc-for:0801 schema:inDefinedTermSet anzsrc-for:
    111 schema:name Artificial Intelligence and Image Processing
    112 rdf:type schema:DefinedTerm
    113 sg:journal.1104357 schema:issn 0941-0643
    114 1433-3058
    115 schema:name Neural Computing and Applications
    116 schema:publisher Springer Nature
    117 rdf:type schema:Periodical
    118 sg:person.010101465477.39 schema:affiliation grid-institutes:grid.411655.2
    119 schema:familyName Ma
    120 schema:givenName Heng
    121 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010101465477.39
    122 rdf:type schema:Person
    123 sg:person.012112576575.37 schema:affiliation grid-institutes:grid.411655.2
    124 schema:familyName Tseng
    125 schema:givenName Ying-Chih
    126 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012112576575.37
    127 rdf:type schema:Person
    128 sg:person.012710157175.96 schema:affiliation grid-institutes:grid.411655.2
    129 schema:familyName Chen
    130 schema:givenName Lu-I.
    131 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012710157175.96
    132 rdf:type schema:Person
    133 sg:pub.10.1007/3-540-68530-8_6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008184855
    134 https://doi.org/10.1007/3-540-68530-8_6
    135 rdf:type schema:CreativeWork
    136 grid-institutes:grid.411655.2 schema:alternateName Department of Industrial Management, Chung Hua University, No. 707, Sec.2, WuFu Rd., Hsinchu, Taiwan
    137 Ph.D. Program of Technology Management, Chung Hua University, Hsinchu, Taiwan
    138 schema:name Department of Industrial Management, Chung Hua University, No. 707, Sec.2, WuFu Rd., Hsinchu, Taiwan
    139 Ph.D. Program of Technology Management, Chung Hua University, Hsinchu, Taiwan
    140 rdf:type schema:Organization
     




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


    ...