his.sePublications
Change search
Link to record
Permanent link

Direct link
BETA
Publications (10 of 14) Show all publications
Torra, V., Navarro-Arribas, G. & Stokes, K. (2019). Data privacy. In: Alan Said, Vicenç Torra (Ed.), Data science in Practice: (pp. 121-132). Springer
Open this publication in new window or tab >>Data privacy
2019 (English)In: Data science in Practice / [ed] Alan Said, Vicenç Torra, Springer, 2019, p. 121-132Chapter in book (Refereed)
Abstract [en]

In this chapter we present an overview of the topic data privacy. We review privacy models and measures of disclosure risk. These models and measures provide computational definitions of what privacy means, and of how to evaluate the privacy level of a data set. Then, we give a summary of data protection mechanisms. We provide a classification of these methods according to three dimensions: whose privacy is being sought, the computations to be done, and the number of data sources. Finally, we describe masking methods. Such methods are the data protection mechanisms used for databases when the data use is undefined and the protected database is required to be useful for several data uses. We also provide a definition of information loss (or data utility) for this type of data protection mechanism. The chapter finishes with a summary.

Place, publisher, year, edition, pages
Springer, 2019
Series
Studies in Big Data, ISSN 2197-6503, E-ISSN 2197-6511 ; 46
National Category
Computer and Information Sciences Other Computer and Information Science Computer Sciences
Research subject
Skövde Artificial Intelligence Lab (SAIL); Physics and Mathematics
Identifiers
urn:nbn:se:his:diva-16766 (URN)10.1007/978-3-319-97556-6_7 (DOI)000464719500008 ()978-3-319-97556-6 (ISBN)978-3-319-97555-9 (ISBN)
Available from: 2019-04-11 Created: 2019-04-11 Last updated: 2019-08-19Bibliographically approved
Conder, M. & Stokes, K. (2019). New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces. Ars Mathematica Contemporanea, 17(1), 1-35
Open this publication in new window or tab >>New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces
2019 (English)In: Ars Mathematica Contemporanea, ISSN 1855-3966, Vol. 17, no 1, p. 1-35Article in journal (Refereed) Published
Abstract [en]

The question of how to find the smallest genus of all embeddings of a given finite connected graph on an orientable (or non-orientable) surface has a long and interesting history. In this paper we introduce four new approaches to help answer this question, in both the orientable and non-orientable cases. One approach involves taking orbits of subgroups of the automorphism group on cycles of particular lengths in the graph as candidates for subsets of the faces of an embedding. Another uses properties of an auxiliary graph defined in terms of compatibility of these cycles. We also present two methods that make use of integer linear programming, to help determine bounds for the minimum genus, and to find minimum genus embeddings. This work was motivated by the problem of finding the minimum genus of the Hoffman-Singleton graph, and succeeded not only in solving that problem but also in answering several other open questions.

Place, publisher, year, edition, pages
Drustvo Matematikov, Fizikov in Astronomov,Society of Mathematicians, Physicists and Astronomers, 2019
Keywords
Graph embedding, genus
National Category
Discrete Mathematics
Research subject
Physics and Mathematics
Identifiers
urn:nbn:se:his:diva-16767 (URN)10.26493/1855-3974.1800.40c (DOI)000477871200001 ()2-s2.0-85068328201 (Scopus ID)
Available from: 2019-04-11 Created: 2019-04-11 Last updated: 2019-11-18Bibliographically approved
Torra, V., Navarro-Arribas, G. & Stokes, K. (2016). An Overview of the Use of Clustering for Data Privacy. In: M. Emre Celebi, Kemal Aydin (Ed.), Unsupervised Learning Algorithms: (pp. 237-251). Springer
Open this publication in new window or tab >>An Overview of the Use of Clustering for Data Privacy
2016 (English)In: Unsupervised Learning Algorithms / [ed] M. Emre Celebi, Kemal Aydin, Springer, 2016, p. 237-251Chapter in book (Refereed)
Abstract [en]

In this chapter we review some of our results related to the use of clustering in the area of data privacy. The paper gives a brief overview of data privacy and, more specifically, on data driven methods for data privacy and discusses where clustering can be applied in this setting. We discuss the role of clustering in the definition of masking methods, and on the calculation of information loss and data utility.

Place, publisher, year, edition, pages
Springer, 2016
National Category
Computer Sciences
Research subject
Physics and Mathematics; Skövde Artificial Intelligence Lab (SAIL)
Identifiers
urn:nbn:se:his:diva-12344 (URN)10.1007/978-3-319-24211-8_10 (DOI)2-s2.0-84978289110 (Scopus ID)978-3-319-24209-5 (ISBN)978-3-319-24211-8 (ISBN)
Available from: 2016-06-08 Created: 2016-06-08 Last updated: 2018-01-10Bibliographically approved
Stokes, K. & Izquierdo, M. (2016). Geometric point-circle pentagonal geometries from Moore graphs. Ars Mathematica Contemporanea, 11(1), 215-229
Open this publication in new window or tab >>Geometric point-circle pentagonal geometries from Moore graphs
2016 (English)In: Ars Mathematica Contemporanea, ISSN 1855-3966, Vol. 11, no 1, p. 215-229Article in journal (Refereed) Published
Place, publisher, year, edition, pages
Drustvo Matematikov, Fizikov in Astronomov,Society of Mathematicians, Physicists and Astronomers, 2016
National Category
Mathematics
Research subject
Physics and Mathematics
Identifiers
urn:nbn:se:his:diva-11258 (URN)000373939900015 ()2-s2.0-84963787618 (Scopus ID)
Available from: 2015-06-30 Created: 2015-06-30 Last updated: 2019-11-18Bibliographically approved
Stokes, K. (2016). Irreducibility of configurations. Ars Mathematica Contemporanea, 10(1), 169-181
Open this publication in new window or tab >>Irreducibility of configurations
2016 (English)In: Ars Mathematica Contemporanea, ISSN 1855-3966, Vol. 10, no 1, p. 169-181Article in journal (Refereed) Published
Place, publisher, year, edition, pages
Drustvo Matematikov, Fizikov in Astronomov,Society of Mathematicians, Physicists and Astronomers, 2016
National Category
Mathematics
Research subject
Natural sciences; Physics and Mathematics
Identifiers
urn:nbn:se:his:diva-11256 (URN)000365759900013 ()2-s2.0-84983360035 (Scopus ID)
Available from: 2015-06-30 Created: 2015-06-30 Last updated: 2019-11-18Bibliographically approved
Izquierdo, M. & Stokes, K. (2016). Isometric point-circle configurations on surfaces from uniform maps. In: Jozef Širáň, Robert Jajcay (Ed.), Symmetries in Graphs, Maps, and Polytopes: 5th SIGMAP Workshop, West Malvern, UK, July 2014 (pp. 201-212). Springer
Open this publication in new window or tab >>Isometric point-circle configurations on surfaces from uniform maps
2016 (English)In: Symmetries in Graphs, Maps, and Polytopes: 5th SIGMAP Workshop, West Malvern, UK, July 2014 / [ed] Jozef Širáň, Robert Jajcay, Springer, 2016, p. 201-212Chapter in book (Refereed)
Abstract [en]

We embed neighborhood geometries of graphs on surfaces as point-circle configurations. We give examples coming from regular maps on surfaces with a maximum number of automorphisms for their genus, and survey geometric realization of pentagonal geometries coming from Moore graphs. An infinite family of point-circle v4 configurations on p-gonal surfaces with two p-gonal morphisms is given. The image of these configurations on the sphere under the two p-gonal morphisms is also described.

Place, publisher, year, edition, pages
Springer, 2016
Series
Springer Proceedings in Mathematics & Statistics, ISSN 2194-1009, E-ISSN 2194-1017 ; 159
National Category
Geometry
Research subject
Physics and Mathematics
Identifiers
urn:nbn:se:his:diva-12342 (URN)10.1007/978-3-319-30451-9_10 (DOI)2-s2.0-84962765299 (Scopus ID)978-3-319-30449-6 (ISBN)978-3-319-30451-9 (ISBN)
Available from: 2016-06-08 Created: 2016-06-08 Last updated: 2017-11-27Bibliographically approved
Griggs, T. & Stokes, K. (2016). On Pentagonal Geometries with Block Size 3, 4 or 5. In: Jozef Širáň, Robert Jajcay (Ed.), Symmetries in Graphs, Maps, and Polytopes: 5th SIGMAP Workshop, West Malvern, UK, July 2014 (pp. 147-157). Springer
Open this publication in new window or tab >>On Pentagonal Geometries with Block Size 3, 4 or 5
2016 (English)In: Symmetries in Graphs, Maps, and Polytopes: 5th SIGMAP Workshop, West Malvern, UK, July 2014 / [ed] Jozef Širáň, Robert Jajcay, Springer, 2016, p. 147-157Chapter in book (Refereed)
Place, publisher, year, edition, pages
Springer, 2016
Series
Springer Proceedings in Mathematics and Statistics, ISSN 2194-1009, E-ISSN 2194-1017 ; 159
Keywords
Topology, Cardinalities, Linear spaces, Geometry
National Category
Geometry
Research subject
Natural sciences; Physics and Mathematics
Identifiers
urn:nbn:se:his:diva-12341 (URN)10.1007/978-3-319-30451-9_7 (DOI)2-s2.0-84962642192 (Scopus ID)978-3-319-30449-6 (ISBN)978-3-319-30451-9 (ISBN)
Available from: 2016-06-08 Created: 2016-06-08 Last updated: 2017-11-27Bibliographically approved
Stokes, K. (2016). Patterns of ideals of numerical semigroups. Semigroup Forum, 93(1), 180-200
Open this publication in new window or tab >>Patterns of ideals of numerical semigroups
2016 (English)In: Semigroup Forum, ISSN 0037-1912, E-ISSN 1432-2137, Vol. 93, no 1, p. 180-200Article in journal (Refereed) Published
Place, publisher, year, edition, pages
Springer, 2016
Keywords
Numerical semigroup, Ideal, Pattern, Polynomia
National Category
Mathematics
Research subject
Natural sciences
Identifiers
urn:nbn:se:his:diva-11257 (URN)10.1007/s00233-015-9741-1 (DOI)000381095500011 ()2-s2.0-84939548214 (Scopus ID)
Available from: 2015-06-30 Created: 2015-06-30 Last updated: 2017-11-27Bibliographically approved
Stokes, K. & Bras-Amorós, M. (2015). A Survey on the Use of Combinatorial Configurations for Anonymous Database Search. In: Guillermo Navarro-Arribas, Vicenç Torra (Ed.), Advanced Research in Data Privacy: (pp. 407-419). Springer
Open this publication in new window or tab >>A Survey on the Use of Combinatorial Configurations for Anonymous Database Search
2015 (English)In: Advanced Research in Data Privacy / [ed] Guillermo Navarro-Arribas, Vicenç Torra, Springer, 2015, p. 407-419Chapter in book (Refereed)
Abstract [en]

The peer-to-peer user-private information retrieval (P2P UPIR) protocol is an anonymous database search protocol in which the users collaborate in order to protect their privacy. This collaboration can be modelled by a combinatorial configuration. This chapter surveys currently available results on how to choose combinatorial configurations for P2P UPIR.

Place, publisher, year, edition, pages
Springer, 2015
Series
Studies in Computational Intelligence, ISSN 1860-949X ; 567
National Category
Computer Sciences
Identifiers
urn:nbn:se:his:diva-12343 (URN)10.1007/978-3-319-09885-2_22 (DOI)2-s2.0-84927143062 (Scopus ID)978-3-319-09884-5 (ISBN)978-3-319-09885-2 (ISBN)
Available from: 2016-06-08 Created: 2016-06-08 Last updated: 2018-01-10Bibliographically approved
Torra, V., Stokes, K. & Narukawa, Y. (2012). An extension of fuzzy measures to multisets and its relation to distorted probabilities. IEEE transactions on fuzzy systems, 20(6), 1032-1045
Open this publication in new window or tab >>An extension of fuzzy measures to multisets and its relation to distorted probabilities
2012 (English)In: IEEE transactions on fuzzy systems, ISSN 1063-6706, E-ISSN 1941-0034, Vol. 20, no 6, p. 1032-1045Article in journal (Refereed) Published
Abstract [en]

Fuzzy measures are monotonic set functions on a reference set; they generalize probabilities replacing the additivity condition by monotonicity. The typical application of these measures is with fuzzy integrals. Fuzzy integrals integrate a function with respect to a fuzzy measure, and they can be used to aggregate information from a set of sources (opinions from experts or criteria in a multicriteria decision-making problem). In this context, background knowledge on the sources is represented by means of the fuzzy measures. For example, interactions between criteria are represented by means of nonadditive measures. In this paper, we introduce fuzzy measures on multisets. We propose a general definition, and we then introduce a family of fuzzy measures for multisets which we show to be equivalent to distorted probabilities when the multisets are restricted to proper sets

Place, publisher, year, edition, pages
IEEE, 2012
Keywords
prime, fuzzy measure, distorted probability, multiset
National Category
Other Mathematics
Identifiers
urn:nbn:se:his:diva-10682 (URN)10.1109/TFUZZ.2012.2191413 (DOI)000311853200004 ()2-s2.0-84870502598 (Scopus ID)
Available from: 2013-04-25 Created: 2015-02-12 Last updated: 2017-12-04Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0002-5040-2089

Search in DiVA

Show all publications