About: Mining Biclusters of Similar Values with Triadic Concept Analysis     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • Biclustering numerical data became a popular data-mining task in the beginning of 2000's, especially for analysing gene expression data. A bicluster reflects a strong association between a subset of objects and a subset of attributes in a numerical object/attribute data-table. So called biclusters of similar values can be thought as maximal sub-tables with close values. Only few methods address a complete, correct and non redundant enumeration of such patterns, which is a well-known intractable problem, while no formal framework exists. In this paper, we introduce important links between biclustering and formal concept analysis. More specifically, we originally show that Triadic Concept Analysis (TCA), provides a nice mathematical framework for biclustering. Interestingly, existing algorithms of TCA, that usually apply on binary data, can be used (directly or with slight modifications) after a preprocessing step for extracting maximal biclusters of similar values.
  • Biclustering numerical data became a popular data-mining task in the beginning of 2000's, especially for analysing gene expression data. A bicluster reflects a strong association between a subset of objects and a subset of attributes in a numerical object/attribute data-table. So called biclusters of similar values can be thought as maximal sub-tables with close values. Only few methods address a complete, correct and non redundant enumeration of such patterns, which is a well-known intractable problem, while no formal framework exists. In this paper, we introduce important links between biclustering and formal concept analysis. More specifically, we originally show that Triadic Concept Analysis (TCA), provides a nice mathematical framework for biclustering. Interestingly, existing algorithms of TCA, that usually apply on binary data, can be used (directly or with slight modifications) after a preprocessing step for extracting maximal biclusters of similar values. (en)
Title
  • Mining Biclusters of Similar Values with Triadic Concept Analysis
  • Mining Biclusters of Similar Values with Triadic Concept Analysis (en)
skos:prefLabel
  • Mining Biclusters of Similar Values with Triadic Concept Analysis
  • Mining Biclusters of Similar Values with Triadic Concept Analysis (en)
skos:notation
  • RIV/61989592:15310/11:10225099!RIV12-GA0-15310___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GAP202/10/0262)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 212629
http://linked.open...ai/riv/idVysledku
  • RIV/61989592:15310/11:10225099
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Triadic concept analysis, numerical biclustering, scaling (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [6CBD6D3A28C9]
http://linked.open...v/mistoKonaniAkce
  • Nancy, Francie
http://linked.open...i/riv/mistoVydani
  • Nancy, France
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the 8th International Conference on Concept Lattices and Their Applications
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Kaytoue, Mehdi
  • Kuznetsov, Sergei O.
  • Macko, Juraj
  • Meira, Wagner
  • Napoli, Amedeo
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • INRIA Nancy ? Grand Est and LORIA, France
https://schema.org/isbn
  • 978-2-905267-78-8
http://localhost/t...ganizacniJednotka
  • 15310
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software