Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе: https://open.uns.ac.rs/handle/123456789/17744
Pоljе DC-аVrеdnоstЈеzik
dc.contributor.authorFodor Lidija-
dc.contributor.authorTešendić Danijela-
dc.contributor.authorKurbalija Vladimir-
dc.contributor.authorŠkrbić Srđan-
dc.date.accessioned2020-12-13T12:04:47Z-
dc.date.available2020-12-13T12:04:47Z-
dc.date.issued2017-
dc.identifier.isbn978-988-14048-3-1-
dc.identifier.issn20780958-
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/17744-
dc.description.abstractSince it became evident that domain-specific languages are able to follow the trends of language design evolving demands, they became increasingly popular. This is resulting in the need for a convenient host languages, that can satisfy and ease the aspects of DSL development. Scala is highly flexible, virtualised language, serving as a great ground for different DSLs. In this paper, we used some of the languages, developed on top of Scala, namely Lightweight Modular Staging, Delite and OptiML, to start the development of our own data-mining DSL. Our main aim is to develop a highly efficient DSL for some important data-mining algorithms. As a starting point, we implemented hierarchical clustering in OptiML, with Scala code generation. We also performed testing, based on experimental data, gained from a psychological experiment, related to human behavior analysis and artificial agent development. We compared the results of our hierarchical clustering, to results gained from R on the same data set. This algorithm serves as a starting point towards parallel code generation for a set of data-mining algorithms.-
dc.language.isoen-
dc.relation.ispartofLecture Notes in Engineering and Computer Science-
dc.sourceCRIS UNS-
dc.source.urihttp://cris.uns.ac.rs-
dc.titlePerforming hierarchical clustering on distance matrices in OptiML-
dc.typeConference Paper-
dc.identifier.scopus2-s2.0-85041215168-
dc.identifier.urlhttps://www.cris.uns.ac.rs/record.jsf?recordId=104850&source=BEOPEN&language=en-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85041215168-
dc.relation.lastpage617-
dc.relation.firstpage612-
dc.relation.volume2230-
dc.identifier.externalcrisreference(BISIS)104850-
item.fulltextNo Fulltext-
item.grantfulltextnone-
crisitem.author.deptDepartman za matematiku i informatiku-
crisitem.author.deptDepartman za matematiku i informatiku-
crisitem.author.deptDepartman za matematiku i informatiku-
crisitem.author.deptDepartman za matematiku i informatiku-
crisitem.author.orcid0000-0001-8710-7123-
crisitem.author.orcid0000-0002-9599-4495-
crisitem.author.orcid0000-0002-3993-4092-
crisitem.author.parentorgPrirodno-matematički fakultet-
crisitem.author.parentorgPrirodno-matematički fakultet-
crisitem.author.parentorgPrirodno-matematički fakultet-
crisitem.author.parentorgPrirodno-matematički fakultet-
Nаlаzi sе u kоlеkciјаmа:PMF Publikacije/Publications
Prikаzаti јеdnоstаvаn zаpis stаvki

Prеglеd/i stаnicа

23
Prоtеklа nеdеljа
7
Prоtеkli mеsеc
0
prоvеrеnо 10.05.2024.

Google ScholarTM

Prоvеritе

Аlt mеtrikа


Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.