Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
S-truncated Functions and Rough Sets in Approximation and Classification of Bottleneck Polygons
Responsible organisation
2005 (English)Conference paper, (Refereed) Published
Abstract [en]

Some collections of two-dimensional points form very irregular shapes, which cannot be approximated by standard curves without making large errors. We approximate the sets of points to introduce formal mathematical expressions giving rise for future predictions for other points, which are not placed in data sets. To accomplish the thorough approximation of finite point sets we test parametric s-truncated functions piecewise, which warrants a high accuracy of approximating. By operating with the functions, which represent samples of points obtained during experiments carried out, and by adopting the rough set technique, we attempt a classification of curves. Even if the curves are stretched and shaped differently we will divide them in classes gathering similar objects. To confirm availability and correctitude of the approximation and the classification proposed, we consider an examination of Internet packet streams, especially a bottleneck distribution based on throughput values.

Place, publisher, year, edition, pages
Tsukuba, Japan: Consejo Superior de Investigaciones Cientificas , 2005.
Keyword [en]
s-functions, approximation of point sets by s-functions, rough sets, classification by rough sets
National Category
Mathematics Computer Science
Identifiers
URN: urn:nbn:se:bth-9418Local ID: oai:bth.se:forskinfoE87BD0E9F7ACA864C125705B00436646ISBN: 84-00-08306-7 (print)OAI: oai:DiVA.org:bth-9418DiVA: diva2:837259
Conference
Modeling Decisions for Artificial Intelligence - MDAI 2005
Available from: 2012-09-18 Created: 2005-08-12 Last updated: 2016-09-20Bibliographically approved

Open Access in DiVA

fulltext(518 kB)32 downloads
File information
File name FULLTEXT01.pdfFile size 518 kBChecksum SHA-512
b89a5724fe37cd1bddff65bc234ad58fed76af262ae42a3efe69376af7a5054ed5056a7a8cff9acdabe421d24d05c64cb8429ba008051e9f3ccb649db1ef6a2b
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Rakus-Andersson, Elisabeth
MathematicsComputer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 32 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 29 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf