Rare association rule mining from incremental databases View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2018-11-10

AUTHORS

Anindita Borah, Bhabesh Nath

ABSTRACT

Rare association rule mining is an imperative field of data mining that attempts to identify rare correlations among the items in a database. Although numerous attempts pertaining to rare association rule mining can be found in the literature, there are still certain issues that need utmost attention. The most prominent one among them is the rare association rule mining from incremental databases. The existing rare association rule mining techniques are capable of operating only on static databases, assuming that the entire database to be operated on is available during the outset of the mining process. Inclusion of new records, however, may lead to the generation of some new interesting rules from the current set of data, invalidating the previously extracted significant rare association rules. Executing the entire mining process from scratch for the newly arrived set of data could be a tedious affair. With a view to resolve the issue of incremental rare association rule mining, this study presents a single-pass tree-based approach for extracting rare association rules when new data are inserted into the original database. The proposed approach is capable of generating the complete set of frequent and rare patterns without rescanning the updated database and reconstructing the entire tree structure when new transactions are added to the existent database. Experimental evaluation has been carried out on several benchmark real and synthetic datasets to analyze the efficiency of the proposed approach. Furthermore, to assess its applicability in real-world applications, experimental analysis has been performed on a real geological dataset where earthquake records are incrementally being added on an annual basis. Comparative performance analysis demonstrates the preeminence of proposed approach over existing frequent and rare association rule mining techniques. More... »

PAGES

1-22

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/s10044-018-0759-3

DOI

http://dx.doi.org/10.1007/s10044-018-0759-3

DIMENSIONS

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


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/0806", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information Systems", 
        "type": "DefinedTerm"
      }, 
      {
        "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"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Tezpur University", 
          "id": "https://www.grid.ac/institutes/grid.45982.32", 
          "name": [
            "Department of Computer Science and Engineering, Tezpur University, Napaam, Sonitpur, 784028, Tezpur, Assam, India"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Borah", 
        "givenName": "Anindita", 
        "id": "sg:person.07777665021.87", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07777665021.87"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Tezpur University", 
          "id": "https://www.grid.ac/institutes/grid.45982.32", 
          "name": [
            "Department of Computer Science and Engineering, Tezpur University, Napaam, Sonitpur, 784028, Tezpur, Assam, India"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Nath", 
        "givenName": "Bhabesh", 
        "id": "sg:person.013356517216.81", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013356517216.81"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1016/j.eswa.2008.03.014", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1001327543"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-642-23544-3_21", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1001898205", 
          "https://doi.org/10.1007/978-3-642-23544-3_21"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-642-23544-3_21", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1001898205", 
          "https://doi.org/10.1007/978-3-642-23544-3_21"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.eswa.2007.04.009", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1004555974"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1023/a:1026482903537", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1014757602", 
          "https://doi.org/10.1023/a:1026482903537"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1023/b:dami.0000005258.31418.83", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1019489501", 
          "https://doi.org/10.1023/b:dami.0000005258.31418.83"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/342009.335372", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1025244221"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-47922-8_13", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1025432990", 
          "https://doi.org/10.1007/3-540-47922-8_13"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-47922-8_13", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1025432990", 
          "https://doi.org/10.1007/3-540-47922-8_13"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-47887-6_34", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1028532683", 
          "https://doi.org/10.1007/3-540-47887-6_34"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/170035.170072", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1028726331"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s10115-006-0032-8", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1046963641", 
          "https://doi.org/10.1007/s10115-006-0032-8"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s10115-006-0032-8", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1046963641", 
          "https://doi.org/10.1007/s10115-006-0032-8"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.procs.2015.07.391", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1047694068"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/312129.312274", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1050403296"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.ijar.2004.11.006", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1053720823"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-319-69900-4_59", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1092444311", 
          "https://doi.org/10.1007/978-3-319-69900-4_59"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-319-69900-4_59", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1092444311", 
          "https://doi.org/10.1007/978-3-319-69900-4_59"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/ictai.2007.30", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1093700141"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/i-smac.2017.8058373", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1093825101"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/icde.1996.492094", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1094013387"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/cidm.2009.4938669", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1094100617"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/ideas.2003.1214917", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1094606503"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/icmla.2007.106", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1095142357"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/isda.2009.55", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1095740449"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1142/9789812819536_0020", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1096084080"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-981-10-5828-8_51", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1100246764", 
          "https://doi.org/10.1007/978-981-10-5828-8_51"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1504/ijkedm.2017.091018", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1103330629"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-981-10-8055-5_39", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1105290507", 
          "https://doi.org/10.1007/978-981-10-8055-5_39"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.eswa.2018.07.010", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1105296841"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2018-11-10", 
    "datePublishedReg": "2018-11-10", 
    "description": "Rare association rule mining is an imperative field of data mining that attempts to identify rare correlations among the items in a database. Although numerous attempts pertaining to rare association rule mining can be found in the literature, there are still certain issues that need utmost attention. The most prominent one among them is the rare association rule mining from incremental databases. The existing rare association rule mining techniques are capable of operating only on static databases, assuming that the entire database to be operated on is available during the outset of the mining process. Inclusion of new records, however, may lead to the generation of some new interesting rules from the current set of data, invalidating the previously extracted significant rare association rules. Executing the entire mining process from scratch for the newly arrived set of data could be a tedious affair. With a view to resolve the issue of incremental rare association rule mining, this study presents a single-pass tree-based approach for extracting rare association rules when new data are inserted into the original database. The proposed approach is capable of generating the complete set of frequent and rare patterns without rescanning the updated database and reconstructing the entire tree structure when new transactions are added to the existent database. Experimental evaluation has been carried out on several benchmark real and synthetic datasets to analyze the efficiency of the proposed approach. Furthermore, to assess its applicability in real-world applications, experimental analysis has been performed on a real geological dataset where earthquake records are incrementally being added on an annual basis. Comparative performance analysis demonstrates the preeminence of proposed approach over existing frequent and rare association rule mining techniques.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/s10044-018-0759-3", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1041985", 
        "issn": [
          "1433-7541", 
          "1433-755X"
        ], 
        "name": "Pattern Analysis and Applications", 
        "type": "Periodical"
      }
    ], 
    "name": "Rare association rule mining from incremental databases", 
    "pagination": "1-22", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "38c0b05cd5ae6fee33f097ee525c44843e144b75017cc8e56352a7b31b631bae"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s10044-018-0759-3"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1109805234"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s10044-018-0759-3", 
      "https://app.dimensions.ai/details/publication/pub.1109805234"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-10T14:24", 
    "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/0000000001_0000000264/records_8660_00000610.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://link.springer.com/10.1007%2Fs10044-018-0759-3"
  }
]
 

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/s10044-018-0759-3'

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/s10044-018-0759-3'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s10044-018-0759-3'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s10044-018-0759-3'


 

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

149 TRIPLES      21 PREDICATES      50 URIs      16 LITERALS      5 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/s10044-018-0759-3 schema:about anzsrc-for:08
2 anzsrc-for:0806
3 schema:author N226a561f0d5e4a89bcf3f220e468b1e6
4 schema:citation sg:pub.10.1007/3-540-47887-6_34
5 sg:pub.10.1007/3-540-47922-8_13
6 sg:pub.10.1007/978-3-319-69900-4_59
7 sg:pub.10.1007/978-3-642-23544-3_21
8 sg:pub.10.1007/978-981-10-5828-8_51
9 sg:pub.10.1007/978-981-10-8055-5_39
10 sg:pub.10.1007/s10115-006-0032-8
11 sg:pub.10.1023/a:1026482903537
12 sg:pub.10.1023/b:dami.0000005258.31418.83
13 https://doi.org/10.1016/j.eswa.2007.04.009
14 https://doi.org/10.1016/j.eswa.2008.03.014
15 https://doi.org/10.1016/j.eswa.2018.07.010
16 https://doi.org/10.1016/j.ijar.2004.11.006
17 https://doi.org/10.1016/j.procs.2015.07.391
18 https://doi.org/10.1109/cidm.2009.4938669
19 https://doi.org/10.1109/i-smac.2017.8058373
20 https://doi.org/10.1109/icde.1996.492094
21 https://doi.org/10.1109/icmla.2007.106
22 https://doi.org/10.1109/ictai.2007.30
23 https://doi.org/10.1109/ideas.2003.1214917
24 https://doi.org/10.1109/isda.2009.55
25 https://doi.org/10.1142/9789812819536_0020
26 https://doi.org/10.1145/170035.170072
27 https://doi.org/10.1145/312129.312274
28 https://doi.org/10.1145/342009.335372
29 https://doi.org/10.1504/ijkedm.2017.091018
30 schema:datePublished 2018-11-10
31 schema:datePublishedReg 2018-11-10
32 schema:description Rare association rule mining is an imperative field of data mining that attempts to identify rare correlations among the items in a database. Although numerous attempts pertaining to rare association rule mining can be found in the literature, there are still certain issues that need utmost attention. The most prominent one among them is the rare association rule mining from incremental databases. The existing rare association rule mining techniques are capable of operating only on static databases, assuming that the entire database to be operated on is available during the outset of the mining process. Inclusion of new records, however, may lead to the generation of some new interesting rules from the current set of data, invalidating the previously extracted significant rare association rules. Executing the entire mining process from scratch for the newly arrived set of data could be a tedious affair. With a view to resolve the issue of incremental rare association rule mining, this study presents a single-pass tree-based approach for extracting rare association rules when new data are inserted into the original database. The proposed approach is capable of generating the complete set of frequent and rare patterns without rescanning the updated database and reconstructing the entire tree structure when new transactions are added to the existent database. Experimental evaluation has been carried out on several benchmark real and synthetic datasets to analyze the efficiency of the proposed approach. Furthermore, to assess its applicability in real-world applications, experimental analysis has been performed on a real geological dataset where earthquake records are incrementally being added on an annual basis. Comparative performance analysis demonstrates the preeminence of proposed approach over existing frequent and rare association rule mining techniques.
33 schema:genre research_article
34 schema:inLanguage en
35 schema:isAccessibleForFree false
36 schema:isPartOf sg:journal.1041985
37 schema:name Rare association rule mining from incremental databases
38 schema:pagination 1-22
39 schema:productId N38534f57b8c640afb11553dd46568839
40 N87c9b7f04eed4ced9c6a3c1864ddd029
41 Na154a089e5f44468b7acab780573488c
42 schema:sameAs https://app.dimensions.ai/details/publication/pub.1109805234
43 https://doi.org/10.1007/s10044-018-0759-3
44 schema:sdDatePublished 2019-04-10T14:24
45 schema:sdLicense https://scigraph.springernature.com/explorer/license/
46 schema:sdPublisher Ne5926032cd6741f1aa7b671dba0a991c
47 schema:url https://link.springer.com/10.1007%2Fs10044-018-0759-3
48 sgo:license sg:explorer/license/
49 sgo:sdDataset articles
50 rdf:type schema:ScholarlyArticle
51 N226a561f0d5e4a89bcf3f220e468b1e6 rdf:first sg:person.07777665021.87
52 rdf:rest Nd70c4390cb6f4690959bd91dc02eb442
53 N38534f57b8c640afb11553dd46568839 schema:name readcube_id
54 schema:value 38c0b05cd5ae6fee33f097ee525c44843e144b75017cc8e56352a7b31b631bae
55 rdf:type schema:PropertyValue
56 N87c9b7f04eed4ced9c6a3c1864ddd029 schema:name dimensions_id
57 schema:value pub.1109805234
58 rdf:type schema:PropertyValue
59 Na154a089e5f44468b7acab780573488c schema:name doi
60 schema:value 10.1007/s10044-018-0759-3
61 rdf:type schema:PropertyValue
62 Nd70c4390cb6f4690959bd91dc02eb442 rdf:first sg:person.013356517216.81
63 rdf:rest rdf:nil
64 Ne5926032cd6741f1aa7b671dba0a991c schema:name Springer Nature - SN SciGraph project
65 rdf:type schema:Organization
66 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
67 schema:name Information and Computing Sciences
68 rdf:type schema:DefinedTerm
69 anzsrc-for:0806 schema:inDefinedTermSet anzsrc-for:
70 schema:name Information Systems
71 rdf:type schema:DefinedTerm
72 sg:journal.1041985 schema:issn 1433-7541
73 1433-755X
74 schema:name Pattern Analysis and Applications
75 rdf:type schema:Periodical
76 sg:person.013356517216.81 schema:affiliation https://www.grid.ac/institutes/grid.45982.32
77 schema:familyName Nath
78 schema:givenName Bhabesh
79 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013356517216.81
80 rdf:type schema:Person
81 sg:person.07777665021.87 schema:affiliation https://www.grid.ac/institutes/grid.45982.32
82 schema:familyName Borah
83 schema:givenName Anindita
84 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07777665021.87
85 rdf:type schema:Person
86 sg:pub.10.1007/3-540-47887-6_34 schema:sameAs https://app.dimensions.ai/details/publication/pub.1028532683
87 https://doi.org/10.1007/3-540-47887-6_34
88 rdf:type schema:CreativeWork
89 sg:pub.10.1007/3-540-47922-8_13 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025432990
90 https://doi.org/10.1007/3-540-47922-8_13
91 rdf:type schema:CreativeWork
92 sg:pub.10.1007/978-3-319-69900-4_59 schema:sameAs https://app.dimensions.ai/details/publication/pub.1092444311
93 https://doi.org/10.1007/978-3-319-69900-4_59
94 rdf:type schema:CreativeWork
95 sg:pub.10.1007/978-3-642-23544-3_21 schema:sameAs https://app.dimensions.ai/details/publication/pub.1001898205
96 https://doi.org/10.1007/978-3-642-23544-3_21
97 rdf:type schema:CreativeWork
98 sg:pub.10.1007/978-981-10-5828-8_51 schema:sameAs https://app.dimensions.ai/details/publication/pub.1100246764
99 https://doi.org/10.1007/978-981-10-5828-8_51
100 rdf:type schema:CreativeWork
101 sg:pub.10.1007/978-981-10-8055-5_39 schema:sameAs https://app.dimensions.ai/details/publication/pub.1105290507
102 https://doi.org/10.1007/978-981-10-8055-5_39
103 rdf:type schema:CreativeWork
104 sg:pub.10.1007/s10115-006-0032-8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046963641
105 https://doi.org/10.1007/s10115-006-0032-8
106 rdf:type schema:CreativeWork
107 sg:pub.10.1023/a:1026482903537 schema:sameAs https://app.dimensions.ai/details/publication/pub.1014757602
108 https://doi.org/10.1023/a:1026482903537
109 rdf:type schema:CreativeWork
110 sg:pub.10.1023/b:dami.0000005258.31418.83 schema:sameAs https://app.dimensions.ai/details/publication/pub.1019489501
111 https://doi.org/10.1023/b:dami.0000005258.31418.83
112 rdf:type schema:CreativeWork
113 https://doi.org/10.1016/j.eswa.2007.04.009 schema:sameAs https://app.dimensions.ai/details/publication/pub.1004555974
114 rdf:type schema:CreativeWork
115 https://doi.org/10.1016/j.eswa.2008.03.014 schema:sameAs https://app.dimensions.ai/details/publication/pub.1001327543
116 rdf:type schema:CreativeWork
117 https://doi.org/10.1016/j.eswa.2018.07.010 schema:sameAs https://app.dimensions.ai/details/publication/pub.1105296841
118 rdf:type schema:CreativeWork
119 https://doi.org/10.1016/j.ijar.2004.11.006 schema:sameAs https://app.dimensions.ai/details/publication/pub.1053720823
120 rdf:type schema:CreativeWork
121 https://doi.org/10.1016/j.procs.2015.07.391 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047694068
122 rdf:type schema:CreativeWork
123 https://doi.org/10.1109/cidm.2009.4938669 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094100617
124 rdf:type schema:CreativeWork
125 https://doi.org/10.1109/i-smac.2017.8058373 schema:sameAs https://app.dimensions.ai/details/publication/pub.1093825101
126 rdf:type schema:CreativeWork
127 https://doi.org/10.1109/icde.1996.492094 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094013387
128 rdf:type schema:CreativeWork
129 https://doi.org/10.1109/icmla.2007.106 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095142357
130 rdf:type schema:CreativeWork
131 https://doi.org/10.1109/ictai.2007.30 schema:sameAs https://app.dimensions.ai/details/publication/pub.1093700141
132 rdf:type schema:CreativeWork
133 https://doi.org/10.1109/ideas.2003.1214917 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094606503
134 rdf:type schema:CreativeWork
135 https://doi.org/10.1109/isda.2009.55 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095740449
136 rdf:type schema:CreativeWork
137 https://doi.org/10.1142/9789812819536_0020 schema:sameAs https://app.dimensions.ai/details/publication/pub.1096084080
138 rdf:type schema:CreativeWork
139 https://doi.org/10.1145/170035.170072 schema:sameAs https://app.dimensions.ai/details/publication/pub.1028726331
140 rdf:type schema:CreativeWork
141 https://doi.org/10.1145/312129.312274 schema:sameAs https://app.dimensions.ai/details/publication/pub.1050403296
142 rdf:type schema:CreativeWork
143 https://doi.org/10.1145/342009.335372 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025244221
144 rdf:type schema:CreativeWork
145 https://doi.org/10.1504/ijkedm.2017.091018 schema:sameAs https://app.dimensions.ai/details/publication/pub.1103330629
146 rdf:type schema:CreativeWork
147 https://www.grid.ac/institutes/grid.45982.32 schema:alternateName Tezpur University
148 schema:name Department of Computer Science and Engineering, Tezpur University, Napaam, Sonitpur, 784028, Tezpur, Assam, India
149 rdf:type schema:Organization
 




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


...