NextPriorityConcept: A new and generic algorithm computing concepts from complex and heterogeneous data

In this article, we present a new data type agnostic algorithm calculating a concept lattice from heterogeneous and complex data. Our NextPriorityConcept algorithm is first introduced and proved in the binary case as an extension of Bordat's algorithm with the notion of strategies to select onl...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 845; pp. 1 - 20
Main Authors Demko, Christophe, Bertet, Karell, Faucher, Cyril, Viaud, Jean-François, Kuznetsov, Sergei O.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 12.12.2020
Elsevier
Subjects
Artificial Intelligence
Computer Science
Formal Concept Analysis
Heterogeneous data
Information Retrieval
Lattice
Pattern structures
Strategies
Formal Concept Analysis
Heterogeneous data
Pattern structures
Lattice
Strategies
Online AccessGet full text
ISSN0304-3975
1879-2294
1879-2294
DOI10.1016/j.tcs.2020.08.026

Cover

Abstract In this article, we present a new data type agnostic algorithm calculating a concept lattice from heterogeneous and complex data. Our NextPriorityConcept algorithm is first introduced and proved in the binary case as an extension of Bordat's algorithm with the notion of strategies to select only some predecessors of each concept, avoiding the generation of unreasonably large lattices. The algorithm is then extended to any type of data in a generic way. It is inspired by the pattern structure theory, where data are locally described by predicates independent of their types, allowing the management of heterogeneous data.
AbstractList In this article, we present a new data type agnostic algorithm calculating a concept lattice from heterogeneous and complex data. Our NextPriorityConcept algorithm is first introduced and proved in the binary case as an extension of Bordat's algorithm with the notion of strategies to select only some predecessors of each concept, avoiding the generation of unreasonably large lattices. The algorithm is then extended to any type of data in a generic way. It is inspired by the pattern structure theory, where data are locally described by predicates independent of their types, allowing the management of heterogeneous data.
Author Demko, Christophe
Faucher, Cyril
Viaud, Jean-François
Bertet, Karell
Kuznetsov, Sergei O.
Author_xml – sequence: 1
  givenname: Christophe
  orcidid: 0000-0003-0740-8466
  surname: Demko
  fullname: Demko, Christophe
  email: christophe.demko@univ-lr.fr
  organization: L3i, La Rochelle University, France
– sequence: 2
  givenname: Karell
  surname: Bertet
  fullname: Bertet, Karell
  email: karell.bertet@univ-lr.fr
  organization: L3i, La Rochelle University, France
– sequence: 3
  givenname: Cyril
  surname: Faucher
  fullname: Faucher, Cyril
  email: cyril.faucher@univ-lr.fr
  organization: L3i, La Rochelle University, France
– sequence: 4
  givenname: Jean-François
  surname: Viaud
  fullname: Viaud, Jean-François
  email: jean-francois.viaud@univ-lr.fr
  organization: L3i, La Rochelle University, France
– sequence: 5
  givenname: Sergei O.
  surname: Kuznetsov
  fullname: Kuznetsov, Sergei O.
  email: skuznetsov@hse.ru
  organization: National Research University Higher School of Economics, Moscow, Russia
BackLink https://hal.science/hal-03038671$$DView record in HAL
BookMark eNqNkE1LAzEQhoMo2Ko_wNtePeyaZLvZrJ5K8QuKetBzSLOzbco2KUn69e_NuoLgoTiXGYb3mYFniE6NNYDQNcEZwYTdLrOgfEYxxRnmGabsBA0IL6uU0mp0igY4x6M0r8riHA29X-JYRckGaP4K-_DutHU6HCbWKFiHu2ScGNgl0tTJHAw4rRLZzrvIYpUou1pvgjbzOH3HfdI42-9b2H9TCwjgbMfajU9qGeQlOmtk6-Hqp1-gz8eHj8lzOn17epmMp6mivGJpLYE3DFe8gJlsGMcjWoyoypmSM04wACspUTUAmVWqpoxXsUlFiOK4ICXJLxDt727MWh52sm3F2umVdAdBsOhUiaWIqkSnSmAuoqoI3fTQQv7GrdTieTwV3S7ayzkrybZ7QPqsctZ7B82_7pd_GKWDDNqa4KRuj5L3PQnR2VaDE15piNpr7UAFUVt9hP4CVSOmBQ
CitedBy_id crossref_primary_10_1155_2021_5805433
crossref_primary_10_3390_math9050565
crossref_primary_10_1016_j_ins_2024_120345
crossref_primary_10_1016_j_ijar_2024_109269
crossref_primary_10_4274_mirt_galenos_2022_94547
Cites_doi 10.1016/j.tcs.2016.11.021
10.1080/00029890.1952.11988183
10.1007/BF02573985
ContentType Journal Article
Copyright 2020 Elsevier B.V.
Attribution - NonCommercial
Copyright_xml – notice: 2020 Elsevier B.V.
– notice: Attribution - NonCommercial
DBID AAYXX
CITATION
1XC
VOOES
ADTOC
UNPAY
DOI 10.1016/j.tcs.2020.08.026
DatabaseName CrossRef
Hyper Article en Ligne (HAL)
Hyper Article en Ligne (HAL) (Open Access)
Unpaywall for CDI: Periodical Content
Unpaywall
DatabaseTitle CrossRef
DatabaseTitleList
Database_xml – sequence: 1
  dbid: UNPAY
  name: Unpaywall
  url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/
  sourceTypes: Open Access Repository
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISSN 1879-2294
EndPage 20
ExternalDocumentID 10.1016/j.tcs.2020.08.026
oai:HAL:hal-03038671v1
10_1016_j_tcs_2020_08_026
S0304397520304837
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
123
1B1
1RT
1~.
1~5
4.4
457
4G.
5VS
7-5
71M
8P~
9JN
AABNK
AACTN
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAXUO
AAYFN
ABAOU
ABBOA
ABJNI
ABMAC
ABYKQ
ACAZW
ACDAQ
ACGFS
ACRLP
ACZNC
ADBBV
ADEZE
AEBSH
AEKER
AENEX
AFKWA
AFTJW
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ARUGR
AXJTR
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
HVGLF
IHE
IXB
J1W
KOM
LG9
M26
M41
MHUIS
MO0
N9A
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
ROL
RPZ
SCC
SDF
SDG
SES
SPC
SPCBC
SSV
SSW
T5K
TN5
WH7
YNT
ZMT
~G-
29Q
AAEDT
AAQXK
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABEFU
ABFNM
ABWVN
ABXDB
ACLOT
ACNNM
ACRPL
ACVFH
ADCNI
ADMUD
ADNMO
ADVLN
AEIPS
AEUPX
AEXQZ
AFJKZ
AFPUW
AGHFR
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
ASPBG
AVWKF
AZFZN
CITATION
EFKBS
EJD
FGOYB
G-2
HZ~
R2-
SEW
SSZ
TAE
WUQ
XJT
ZY4
~HD
1XC
VOOES
ADTOC
AGCQF
UNPAY
ID FETCH-LOGICAL-c2896-dae8f60985ebaf68042542c36cab810ee6721cdee1b9cd26899cdac11c8051713
IEDL.DBID UNPAY
ISSN 0304-3975
1879-2294
IngestDate Wed Aug 20 00:13:40 EDT 2025
Tue Oct 14 20:34:23 EDT 2025
Thu Oct 09 00:20:01 EDT 2025
Thu Apr 24 22:59:34 EDT 2025
Fri Feb 23 02:47:22 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Keywords Formal Concept Analysis
Heterogeneous data
Pattern structures
Lattice
Strategies
Language English
License Attribution - NonCommercial: http://creativecommons.org/licenses/by-nc
other-oa
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c2896-dae8f60985ebaf68042542c36cab810ee6721cdee1b9cd26899cdac11c8051713
ORCID 0000-0003-0740-8466
0000-0002-9741-4570
0000-0003-3284-9001
0000-0002-0015-9949
OpenAccessLink https://proxy.k.utb.cz/login?url=https://doi.org/10.1016/j.tcs.2020.08.026
PageCount 20
ParticipantIDs unpaywall_primary_10_1016_j_tcs_2020_08_026
hal_primary_oai_HAL_hal_03038671v1
crossref_primary_10_1016_j_tcs_2020_08_026
crossref_citationtrail_10_1016_j_tcs_2020_08_026
elsevier_sciencedirect_doi_10_1016_j_tcs_2020_08_026
PublicationCentury 2000
PublicationDate 2020-12-12
PublicationDateYYYYMMDD 2020-12-12
PublicationDate_xml – month: 12
  year: 2020
  text: 2020-12-12
  day: 12
PublicationDecade 2020
PublicationTitle Theoretical computer science
PublicationYear 2020
Publisher Elsevier B.V
Elsevier
Publisher_xml – name: Elsevier B.V
– name: Elsevier
References Linding (br0100) 2002
Quine (br0140) 1952; 59
Ganter, Wille (br0020) 1999
Kaytoue, Codocedo, Buzmakov, Baixeries, Kuznetsov, Napoli (br0050) 2015
Ferré, Ridoux (br0070) 2000; 1867
Chazelle (br0130) 1993; 10
Barbut, Monjardet (br0010) 1970
Eddine Boukhetta, Demko, Richard, Bertet (br0110) 2020
Bordat (br0090) 1986; 96
Ganter, Kuznetsov (br0040) 2001
Bertet, Demko, Viaud, Guérin (br0030) 2018; 743
Belfodil, Kuznetsov, Robardet, Kaytoue (br0120) 2017
Kaytoue (br0060) February 2020
Ferré (br0080) November 2014
Chazelle (10.1016/j.tcs.2020.08.026_br0130) 1993; 10
Linding (10.1016/j.tcs.2020.08.026_br0100) 2002
Bordat (10.1016/j.tcs.2020.08.026_br0090) 1986; 96
Barbut (10.1016/j.tcs.2020.08.026_br0010) 1970
Ferré (10.1016/j.tcs.2020.08.026_br0070) 2000; 1867
Bertet (10.1016/j.tcs.2020.08.026_br0030) 2018; 743
Kaytoue (10.1016/j.tcs.2020.08.026_br0060) 2020
Quine (10.1016/j.tcs.2020.08.026_br0140) 1952; 59
Ganter (10.1016/j.tcs.2020.08.026_br0020) 1999
Kaytoue (10.1016/j.tcs.2020.08.026_br0050) 2015
Ferré (10.1016/j.tcs.2020.08.026_br0080) 2014
Belfodil (10.1016/j.tcs.2020.08.026_br0120) 2017
Eddine Boukhetta (10.1016/j.tcs.2020.08.026_br0110) 2020
Ganter (10.1016/j.tcs.2020.08.026_br0040) 2001
References_xml – year: 1999
  ident: br0020
  article-title: Formal Concept Analysis, Mathematical Foundations
– volume: 96
  start-page: 31
  year: 1986
  end-page: 47
  ident: br0090
  article-title: Calcul pratique du treillis de Galois d'une correspondance
  publication-title: Math. Sci. Hum.
– volume: 10
  start-page: 377
  year: 1993
  end-page: 409
  ident: br0130
  article-title: An optimal convex hull algorithm in any fixed dimension
  publication-title: Discrete Comput. Geom.
– year: November 2014
  ident: br0080
  article-title: Reconciling expressivity and usability in information access - from filesystems to the semantic web
– start-page: 1425
  year: 2017
  end-page: 1432
  ident: br0120
  article-title: Mining convex polygon patterns with formal concept analysis
  publication-title: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence Main Track
– volume: 743
  start-page: 93
  year: 2018
  end-page: 109
  ident: br0030
  article-title: Lattices, closure systems and implication bases: a survey of structural aspects and algorithms
  publication-title: Theor. Comput. Sci.
– year: 1970
  ident: br0010
  article-title: Ordres et classifications: Algèbre et combinatoire
– volume: 1867
  start-page: 371
  year: 2000
  end-page: 384
  ident: br0070
  article-title: A logical generalization of formal concept analysis
– year: February 2020
  ident: br0060
  article-title: Contributions to pattern discovery
– start-page: 129
  year: 2001
  end-page: 142
  ident: br0040
  article-title: Pattern structures and their projections
  publication-title: LNCS of International Conference on Conceptual Structures (ICCS'01)
– start-page: 227
  year: 2015
  end-page: 231
  ident: br0050
  article-title: Pattern structures and concept lattices for data mining and knowledge processing
  publication-title: Proceedings of ECML-PKDDl
– start-page: 235
  year: 2002
  end-page: 248
  ident: br0100
  article-title: Fast concept analysis
  publication-title: Working with Conceptual Structures-Contributions to ICC
– year: 2020
  ident: br0110
  article-title: Sequence mining using FCA and the
  publication-title: Concept Lattice and Applications (CLA'20)
– volume: 59
  start-page: 521
  year: 1952
  end-page: 531
  ident: br0140
  article-title: The problem of simplifying truth functions
  publication-title: Am. Math. Mon.
– year: 1970
  ident: 10.1016/j.tcs.2020.08.026_br0010
– volume: 743
  start-page: 93
  year: 2018
  ident: 10.1016/j.tcs.2020.08.026_br0030
  article-title: Lattices, closure systems and implication bases: a survey of structural aspects and algorithms
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2016.11.021
– volume: 59
  start-page: 521
  issue: 8
  year: 1952
  ident: 10.1016/j.tcs.2020.08.026_br0140
  article-title: The problem of simplifying truth functions
  publication-title: Am. Math. Mon.
  doi: 10.1080/00029890.1952.11988183
– volume: 96
  start-page: 31
  year: 1986
  ident: 10.1016/j.tcs.2020.08.026_br0090
  article-title: Calcul pratique du treillis de Galois d'une correspondance
  publication-title: Math. Sci. Hum.
– start-page: 227
  year: 2015
  ident: 10.1016/j.tcs.2020.08.026_br0050
  article-title: Pattern structures and concept lattices for data mining and knowledge processing
– year: 2020
  ident: 10.1016/j.tcs.2020.08.026_br0110
  article-title: Sequence mining using FCA and the NextPriorityConcept algorithm
– volume: 10
  start-page: 377
  issue: 1
  year: 1993
  ident: 10.1016/j.tcs.2020.08.026_br0130
  article-title: An optimal convex hull algorithm in any fixed dimension
  publication-title: Discrete Comput. Geom.
  doi: 10.1007/BF02573985
– year: 2014
  ident: 10.1016/j.tcs.2020.08.026_br0080
– start-page: 129
  year: 2001
  ident: 10.1016/j.tcs.2020.08.026_br0040
  article-title: Pattern structures and their projections
– start-page: 1425
  year: 2017
  ident: 10.1016/j.tcs.2020.08.026_br0120
  article-title: Mining convex polygon patterns with formal concept analysis
– year: 1999
  ident: 10.1016/j.tcs.2020.08.026_br0020
– year: 2020
  ident: 10.1016/j.tcs.2020.08.026_br0060
– volume: 1867
  start-page: 371
  year: 2000
  ident: 10.1016/j.tcs.2020.08.026_br0070
  article-title: A logical generalization of formal concept analysis
– start-page: 235
  year: 2002
  ident: 10.1016/j.tcs.2020.08.026_br0100
  article-title: Fast concept analysis
SSID ssj0000576
Score 2.3984594
Snippet In this article, we present a new data type agnostic algorithm calculating a concept lattice from heterogeneous and complex data. Our NextPriorityConcept...
SourceID unpaywall
hal
crossref
elsevier
SourceType Open Access Repository
Enrichment Source
Index Database
Publisher
StartPage 1
SubjectTerms Artificial Intelligence
Computer Science
Formal Concept Analysis
Heterogeneous data
Information Retrieval
Lattice
Pattern structures
Strategies
SummonAdditionalLinks – databaseName: Elsevier ScienceDirect
  dbid: .~1
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEA7qRT34FtcXQTwpddtum229LYuyiIqggreSTtLdldou-_Bx8bc7k7argih4S8OkhMwkkyHffMPYYaD8hEzFEnHgWeShLemBtnyKDTQaEBiy56tr0bn3Lh78hxnWrnJhCFZZnv3FmW5O67KnXq5mfdDv12_pUQ-9qe9SA-MsymD3mlTF4OT9E-aB95HivZJeAFC6etk0GK8xEGO3axsWT-JX-Nk3zfYIJDk_yQby7UWm6RcPdL7ClsqrI28Vs1tlMzpbY8tVWQZe7tI1tng1pWIdrbPuNR6_N8N-TlXq2kWS4ilvcbxOc5kp3iXe6T5wmXZJpPfEwfwRXRq2jPiIUxKK6U_1qxnVIxRNTmPzyYgTzHSD3Z-f3bU7VlldwQIMsoSlpA4SYYeBr2OZiIB2r-dCQ4CMA8fWWmBwCEprJw5BuQIDM1ASHAcC4vVyGptsLsszvcW4qxKlQt8H7YGn4kTqELQd6qajpB2CXWN2ta4RlNTjVAEjjSqM2WOEqohIFRFVxXRFjR1NhwwK3o3fhL1KWdE344nQL_w27AAVO_09EW13WpcR9aG5NIj579mpseOp3v-eyfb_ZrLDFuiLYDKOu8vmxsOJ3sPLzjjeN9b8AfzM_KQ
  priority: 102
  providerName: Elsevier
Title NextPriorityConcept: A new and generic algorithm computing concepts from complex and heterogeneous data
URI https://dx.doi.org/10.1016/j.tcs.2020.08.026
https://hal.science/hal-03038671
https://doi.org/10.1016/j.tcs.2020.08.026
UnpaywallVersion publishedVersion
Volume 845
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier)
  customDbUrl:
  eissn: 1879-2294
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000576
  issn: 1879-2294
  databaseCode: GBLVA
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier ScienceDirect
  customDbUrl:
  eissn: 1879-2294
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000576
  issn: 1879-2294
  databaseCode: .~1
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier ScienceDirect
  customDbUrl:
  eissn: 1879-2294
  dateEnd: 20211012
  omitProxy: true
  ssIdentifier: ssj0000576
  issn: 1879-2294
  databaseCode: ACRLP
  dateStart: 19950109
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier ScienceDirect Open Access Journals
  customDbUrl:
  eissn: 1879-2294
  dateEnd: 20211102
  omitProxy: true
  ssIdentifier: ssj0000576
  issn: 1879-2294
  databaseCode: IXB
  dateStart: 19750601
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals [SCFCJ]
  customDbUrl:
  eissn: 1879-2294
  dateEnd: 20211012
  omitProxy: true
  ssIdentifier: ssj0000576
  issn: 1879-2294
  databaseCode: AIKHN
  dateStart: 19950109
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVLSH
  databaseName: Elsevier Journals
  customDbUrl:
  mediaType: online
  eissn: 1879-2294
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000576
  issn: 1879-2294
  databaseCode: AKRWK
  dateStart: 19750601
  isFulltext: true
  providerName: Library Specific Holdings
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fb9MwED7R9gF42GCAKIPKQjyBXMWuYxLewsTUAav2QKXyFDlnpx2EdFrbAXvgb8eXHxUgGPAWW3dWYp9zd_Ln7wCeRDbMyVS4ziLFyUNzo9DxkHID5w0IK7Ln44keT9XrWThryKLpLsxP5_cVDmuNxKotg4ppU-oO9HTow-4u9KaTk-R9fUqguPerBFek4tlcyli1J5i_G-NPPqizIDDk9U15Zr5-NkXxg6c53K0xWquKoJAAJh-Hm3U2xMtf6Bv_6SNuwU4Tb7KkNpDbcM2Ve7Db1nJgzdbeg5vHW_7W1R2YT_w_--T8dEml7Q7qm40vWMJ8DM5MadmcyKpPkZliTiKLTwyrEb0f9E-V-IrRzZWqv3BfKq0FQW-WpLvcrBhhU-_C9PDVu4Mxb0oycPSZmebWuCjXQRyFLjO5jmjLK4kjjSaLROCc9hklWudEFqOV2mdzaA0KgRGRgYnRPeiWy9LdByZtbm0chugUKpvlxsXogtg9F9YEMQZ9CNpFSrHhK6eyGUXaAtM-pH5aU5rWlEppSt2Hp1uVs5qs4yph1a582kQbdRSR-uW7Su2xt5Lt8MTOPU7eptTn7XBEdIEXog_Ptkb09zd58F_S-3CDWgSpEfIhdNfnG_fIB0brbACd4TcxgF5y9GY88a2j2ctBs02-Azg2Cms
linkProvider Unpaywall
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3db9MwED_t42HwwNhgWtkAa-IJFJqkiZfwVlVMBdpqEpu0N8s5O22nkFZry8fL_nbunKQDaRoSb5FzZ1m-851Pd_4dwJvExDmriiezJPLYQ3s6QuvFHBtYUiB0YM_DkexfRp-v4qsN6DVvYbissrb9lU131roeade72Z5Pp-2vnNQjbxqH_EFx1iZsR3F4yhHY-9u7Og-6kFQJS04BEHmT2nRFXktkyO7QdzCeDLBwv3PanHCV5M6qnOtfP3RR_OGCzp7Ck_ruKLrV8vZgw5b7sNv0ZRD1Md2Hx8M1FuviGYxHZH_Pb6YzblPXq14pfhBdQfdpoUsjxgw8PUWhizGTTL4JdDOST6MvR74Q_ArFjRf2p-OacBnNjHlnq4XgOtPncHn28aLX9-r2Ch5SlCU9o22SSz9NYpvpXCZ8fKMQOxJ1lgS-tZKiQzTWBlmKJpQUmaHRGASYMLBX0DmArXJW2kMQocmNSeMYbYSRyXJtU7R-ak8Do_0U_Rb4zb4qrLHHuQVGoZois2tFolAsCsVtMUPZgrdrlnkFvPEQcdQIS_2lPYocw0NsJyTY9fSMtN3vDhSPkbp0GPrve9CCd2u5_3slL_5vJa9hp38xHKjBp9GXI3jEf7hmJgiPYWt5s7Iv6eazzF45zf4NvbD_xw
linkToUnpaywall http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT-MwEB4t5QAc6PISZR-yECeQUeI6JtlbhRZVq23FgUpwipyx0wIhRbTl9evXk0e1i3aBvSXWjBXb48yM_PkbgL3QBCmZCldJKDl5aK4lWh5QbmCdAWFB9tzrq-5A_jgPziuyaLoL88f5fYHDmiKxaguvYNoUagEWVeDC7gYsDvqnnYvylEBy51cJrkjFs7kQkaxPMP_Wx7980MKIwJBLs_xWPz3oLPvN05w0S4zWpCAoJIDJ9eFsmhzi8wv6xncN4iOsVvEm65QGsgYfbL4OzbqWA6u29jqs9Ob8rZMNGPbdP_v07nJMpe2Oy5uN31iHuRic6dywIZFVXyLT2ZBERjcMix6dH3RPhfiE0c2Voj2zj4XWiKA3Y9IdzyaMsKmbMDj5fnbc5VVJBo4uM1PcaBumyovCwCY6VSFteSmwrVAnoe9Zq1xGicZaP4nQCOWyOTQafR9DIgPz21vQyMe53QYmTGpMFARoJUqTpNpGaL3IHvlGexF6LfDqRYqx4iunshlZXAPTrmI3rTFNa0ylNIVqwf5c5bYk63hNWNYrH1fRRhlFxG75XlPbdVYy757YubudnzG1OTtsE13gvd-Cg7kRvf0lO_8l_QmW6Y0gNb74DI3p3cx-cYHRNPlabYlfktkG2w
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=NextPriorityConcept%3A+A+new+and+generic+algorithm+computing+concepts+from+complex+and+heterogeneous+data&rft.jtitle=Theoretical+computer+science&rft.au=Demko%2C+Christophe&rft.au=Bertet%2C+Karell&rft.au=Faucher%2C+Cyril&rft.au=Viaud%2C+Jean-Fran%C3%A7ois&rft.date=2020-12-12&rft.pub=Elsevier&rft.issn=0304-3975&rft.eissn=1879-2294&rft.volume=845&rft.spage=1&rft.epage=20&rft_id=info:doi/10.1016%2Fj.tcs.2020.08.026&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai%3AHAL%3Ahal-03038671v1
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon