8000 GitHub - dimachine/DistributedTriclustering: Application for distrubuted triclustering based on Online version of prime OAC-triclustering
[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to content

dimachine/DistributedTriclustering

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

45 Commits
 
 
 
 
 
 
 
 

Repository files navigation

DistributedTriclustering

This is the archived code of a distributed triclustering algorithm implemented by Sergey Zudin under my supervision and Dmitry Gnatyshak guidance.

Abstract In our previous work an efficient one-pass online algorithm for triclustering of binary data (triadic formal contexts) was proposed. This algorithm is a modified version of the basic algorithm for OAC-triclustering approach; it has linear time and memory complexities. In this paper we parallelise it via map-reduce framework in order to make it suitable for big datasets. The results of computer experiments show the efficiency of the proposed algorithm; for example, it outperforms the online counterpart on Bibsonomy dataset with ≈ 800, 000 triples.

It is based on our previous work on a one-pass online algorithm for triclustering.

To acknowledge use of the code in publications, please cite the following papers and mention this repository.

References in BibTeX:

@inproceedings{Zudin:2015,
  author    = {Sergey Zudin and
               Dmitry V. Gnatyshak and
               Dmitry I. Ignatov},
  title     = {Putting OAC-triclustering on MapReduce},
  booktitle = {Proceedings of the Twelfth International Conference on Concept Lattices
               and Their Applications, Clermont-Ferrand, France, October 13-16, 2015},
  pages     = {47--58},
  year      = {2015},
  crossref  = {DBLP:conf/cla/2015},
  url       = {http://ceur-ws.org/Vol-1466/paper04.pdf}
}

@proceedings{DBLP:conf/cla/2015,
  editor    = {Sadok Ben Yahia and
               Jan Konecny},
  title     = {Proceedings of the Twelfth International Conference on Concept Lattices
               and Their Applications, Clermont-Ferrand, France, October 13-16, 2015},
  series    = {{CEUR} Workshop Proceedings},
  volume    = {1466},
  publisher = {CEUR-WS.org},
  year      = {2015}
}
@inproceedings{Gnatyshak:2014,
  author    = {Dmitry Gnatyshak and
               Dmitry I. Ignatov and
               Sergei O. Kuznetsov and
               Lhouari Nourine},
  title     = {A One-pass Triclustering Approach: Is There any Room for Big Data?},
  booktitle = {Proceedings of the Eleventh International Conference on Concept Lattices
               and Their Applications, Ko{\v{s}}ice, Slovakia, October 7-10, 2014},
  pages     = {231--242},
  year      = {2014},
  crossref  = {DBLP:conf/cla/2014},
  url       = {http://ceur-ws.org/Vol-1252/cla2014\_submission\_26.pdf},
  urn       = {urn:nbn:de:0074-1466-5}
}

@proceedings{DBLP:conf/cla/2014,
  editor    = {Karell Bertet and
               Sebastian Rudolph},
  title     = {Proceedings of the Eleventh International Conference on Concept Lattices
               and Their Applications, Ko{\v{s}}ice, Slovakia, October 7-10, 2014},
  series    = {{CEUR} Workshop Proceedings},
  volume    = {1252},
  publisher = {CEUR-WS.org},
  year      = {2014},
  url       = {http://ceur-ws.org/Vol-1252},
  urn       = {urn:nbn:de:0074-1252-0}
}

About

Application for distrubuted triclustering based on Online version of prime OAC-triclustering

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Java 100.0%
0