<?xml version="1.0" encoding="utf-8"?><feed xmlns="http://www.w3.org/2005/Atom" ><generator uri="https://jekyllrb.com/" version="4.1.1">Jekyll</generator><link href="http://localhost:4000/feed.xml" rel="self" type="application/atom+xml" /><link href="http://localhost:4000/" rel="alternate" type="text/html" /><updated>2020-08-23T20:56:01+02:00</updated><id>http://localhost:4000/feed.xml</id><title type="html">Semanticlab Weblog</title><subtitle>Summaries to literature related to big data, natural language processing and semantic technologies.</subtitle><author><name>Albert Weichselbraun</name></author><entry><title type="html">Big, Linked Geospatial Data and Its Application in Earth Observation</title><link href="http://localhost:4000/applications/big%20data/Big-Linked-GEsopatial-Data-and-its-Application/" rel="alternate" type="text/html" title="Big, Linked Geospatial Data and Its Application in Earth Observation" /><published>2018-03-09T00:00:00+01:00</published><updated>2018-03-09T00:00:00+01:00</updated><id>http://localhost:4000/applications/big%20data/Big-Linked-GEsopatial-Data-and-its-Application</id><content type="html" xml:base="http://localhost:4000/applications/big%20data/Big-Linked-GEsopatial-Data-and-its-Application/">&lt;p&gt;Integrating earth observation data with linked open data would pave the way for easy reuse and integration of these datasets.
The article discusses how knowledge discovery and data mining can be used to enrich image metadata and GIS data with domain concepts that have been formalized in domain ontologies. It then presents tools used to convert, store and visualize these data.&lt;/p&gt;

&lt;h2 id=&quot;tools&quot;&gt;Tools&lt;/h2&gt;

&lt;ul&gt;
  &lt;li&gt;&lt;a href=&quot;http://www.strabon.di.uoa.gr/&quot;&gt;Strabon&lt;/a&gt; is a geospatial database system build upon RDF4j supporting spatial and temporal features such as selects, joins, etc.&lt;/li&gt;
  &lt;li&gt;&lt;a href=&quot;https://github.com/LinkedEOData/GeoTriples&quot;&gt;GeoTriples&lt;/a&gt; provides means for publishing geospatial data in formats such as shapefiles, spatially enabled DBMS, KML and GeoJSON in RDF.&lt;/li&gt;
  &lt;li&gt;&lt;a href=&quot;http://sextant.di.uoa.gr/&quot;&gt;Sextant&lt;/a&gt; enables visualization, exploration and interaction with time-evolving linked geospatial data&lt;/li&gt;
&lt;/ul&gt;</content><author><name>Albert Weichselbraun</name></author><category term="Applications" /><category term="Big data" /><category term="linked open data" /><category term="geospatial" /><category term="application" /><summary type="html">Integrating earth observation data with linked open data would pave the way for easy reuse and integration of these datasets. The article discusses how knowledge discovery and data mining can be used to enrich image metadata and GIS data with domain concepts that have been formalized in domain ontologies. It then presents tools used to convert, store and visualize these data.</summary></entry><entry><title type="html">Employment relations: a data driven analysis of job markets using online job boards and online professional networks</title><link href="http://localhost:4000/applications/big%20data/employment-relations/" rel="alternate" type="text/html" title="Employment relations: a data driven analysis of job markets using online job boards and online professional networks" /><published>2017-11-21T00:00:00+01:00</published><updated>2017-11-21T00:00:00+01:00</updated><id>http://localhost:4000/applications/big%20data/employment-relations</id><content type="html" xml:base="http://localhost:4000/applications/big%20data/employment-relations/">&lt;p&gt;Career websites contain valuable data on employees, their skill sets and, employment history. This article uses &lt;em&gt;k-means clustering&lt;/em&gt; on keywords describing skill sets that have been transformed using either&lt;/p&gt;
&lt;ol&gt;
  &lt;li&gt;term frequency inverse document frequency (TF-IDF) or&lt;/li&gt;
  &lt;li&gt;t-distributed stochastic neighbor embedding (TSNE).&lt;/li&gt;
&lt;/ol&gt;

&lt;p&gt;A third experiment performs the clustering after 20 keywords have been selected using Latent Dirichlet Allocation.&lt;/p&gt;

&lt;p&gt;In addition the authors extract the chronological information about positions to visualize potential career paths.&lt;/p&gt;

&lt;h2 id=&quot;insights&quot;&gt;Insights&lt;/h2&gt;

&lt;ol&gt;
  &lt;li&gt;clustering jobs per title yields job titles commonly used for different kind of work (e.g. web developer, business intelligence, oracle development, etc.)&lt;/li&gt;
  &lt;li&gt;the network generated from the chronological information shows (i) typical career paths and (ii) identifies positions with high in- and out-degrees.&lt;/li&gt;
&lt;/ol&gt;</content><author><name>Albert Weichselbraun</name></author><category term="Applications" /><category term="Big data" /><category term="project" /><category term="clustering" /><category term="latent dirichlet allocation" /><summary type="html">Career websites contain valuable data on employees, their skill sets and, employment history. This article uses k-means clustering on keywords describing skill sets that have been transformed using either term frequency inverse document frequency (TF-IDF) or t-distributed stochastic neighbor embedding (TSNE).</summary></entry><entry><title type="html">Suffix array</title><link href="http://localhost:4000/big%20data/Suffix-array/" rel="alternate" type="text/html" title="Suffix array" /><published>2017-11-20T00:00:00+01:00</published><updated>2017-11-20T00:00:00+01:00</updated><id>http://localhost:4000/big%20data/Suffix-array</id><content type="html" xml:base="http://localhost:4000/big%20data/Suffix-array/">&lt;p&gt;The suffix array is a memory-efficient alternative to the suffix tree which provides a sorted list of string indices indicating the string’s suffixes.&lt;/p&gt;

&lt;h2 id=&quot;creation&quot;&gt;Creation&lt;/h2&gt;

&lt;p&gt;Provided that the sentinel character &lt;code class=&quot;language-plaintext highlighter-rouge&quot;&gt;$&lt;/code&gt; has the smallest value the suffix array for the string &lt;code class=&quot;language-plaintext highlighter-rouge&quot;&gt;barbapapa&lt;/code&gt; is determined as follows:&lt;/p&gt;

&lt;ol&gt;
  &lt;li&gt;
    &lt;p&gt;determine all possible suffixes and the corresponding start indices (the index one indicates the first position).&lt;/p&gt;

    &lt;table&gt;
      &lt;thead&gt;
        &lt;tr&gt;
          &lt;th&gt;suffix&lt;/th&gt;
          &lt;th style=&quot;text-align: right&quot;&gt;start position in string&lt;/th&gt;
        &lt;/tr&gt;
      &lt;/thead&gt;
      &lt;tbody&gt;
        &lt;tr&gt;
          &lt;td&gt;barbapapa$&lt;/td&gt;
          &lt;td style=&quot;text-align: right&quot;&gt;1&lt;/td&gt;
        &lt;/tr&gt;
        &lt;tr&gt;
          &lt;td&gt;arbapapa$&lt;/td&gt;
          &lt;td style=&quot;text-align: right&quot;&gt;2&lt;/td&gt;
        &lt;/tr&gt;
        &lt;tr&gt;
          &lt;td&gt;rbapapa$&lt;/td&gt;
          &lt;td style=&quot;text-align: right&quot;&gt;3&lt;/td&gt;
        &lt;/tr&gt;
        &lt;tr&gt;
          &lt;td&gt;bapapa$&lt;/td&gt;
          &lt;td style=&quot;text-align: right&quot;&gt;4&lt;/td&gt;
        &lt;/tr&gt;
        &lt;tr&gt;
          &lt;td&gt;apapa$&lt;/td&gt;
          &lt;td style=&quot;text-align: right&quot;&gt;5&lt;/td&gt;
        &lt;/tr&gt;
        &lt;tr&gt;
          &lt;td&gt;papa$&lt;/td&gt;
          &lt;td style=&quot;text-align: right&quot;&gt;6&lt;/td&gt;
        &lt;/tr&gt;
        &lt;tr&gt;
          &lt;td&gt;apa$&lt;/td&gt;
          &lt;td style=&quot;text-align: right&quot;&gt;7&lt;/td&gt;
        &lt;/tr&gt;
        &lt;tr&gt;
          &lt;td&gt;pa$&lt;/td&gt;
          &lt;td style=&quot;text-align: right&quot;&gt;8&lt;/td&gt;
        &lt;/tr&gt;
        &lt;tr&gt;
          &lt;td&gt;a$&lt;/td&gt;
          &lt;td style=&quot;text-align: right&quot;&gt;9&lt;/td&gt;
        &lt;/tr&gt;
        &lt;tr&gt;
          &lt;td&gt;$&lt;/td&gt;
          &lt;td style=&quot;text-align: right&quot;&gt;10&lt;/td&gt;
        &lt;/tr&gt;
      &lt;/tbody&gt;
    &lt;/table&gt;
  &lt;/li&gt;
  &lt;li&gt;
    &lt;p&gt;sort all suffixes&lt;/p&gt;

    &lt;table&gt;
      &lt;thead&gt;
        &lt;tr&gt;
          &lt;th&gt;suffix&lt;/th&gt;
          &lt;th style=&quot;text-align: right&quot;&gt;start position in string&lt;/th&gt;
        &lt;/tr&gt;
      &lt;/thead&gt;
      &lt;tbody&gt;
        &lt;tr&gt;
          &lt;td&gt;$&lt;/td&gt;
          &lt;td style=&quot;text-align: right&quot;&gt;10&lt;/td&gt;
        &lt;/tr&gt;
        &lt;tr&gt;
          &lt;td&gt;a$&lt;/td&gt;
          &lt;td style=&quot;text-align: right&quot;&gt;9&lt;/td&gt;
        &lt;/tr&gt;
        &lt;tr&gt;
          &lt;td&gt;apa$&lt;/td&gt;
          &lt;td style=&quot;text-align: right&quot;&gt;7&lt;/td&gt;
        &lt;/tr&gt;
        &lt;tr&gt;
          &lt;td&gt;apapa$&lt;/td&gt;
          &lt;td style=&quot;text-align: right&quot;&gt;5&lt;/td&gt;
        &lt;/tr&gt;
        &lt;tr&gt;
          &lt;td&gt;arbapapa$&lt;/td&gt;
          &lt;td style=&quot;text-align: right&quot;&gt;2&lt;/td&gt;
        &lt;/tr&gt;
        &lt;tr&gt;
          &lt;td&gt;barbapapa$&lt;/td&gt;
          &lt;td style=&quot;text-align: right&quot;&gt;1&lt;/td&gt;
        &lt;/tr&gt;
        &lt;tr&gt;
          &lt;td&gt;bapapa$&lt;/td&gt;
          &lt;td style=&quot;text-align: right&quot;&gt;4&lt;/td&gt;
        &lt;/tr&gt;
        &lt;tr&gt;
          &lt;td&gt;pa$&lt;/td&gt;
          &lt;td style=&quot;text-align: right&quot;&gt;8&lt;/td&gt;
        &lt;/tr&gt;
        &lt;tr&gt;
          &lt;td&gt;papa$&lt;/td&gt;
          &lt;td style=&quot;text-align: right&quot;&gt;6&lt;/td&gt;
        &lt;/tr&gt;
        &lt;tr&gt;
          &lt;td&gt;rbapapa$&lt;/td&gt;
          &lt;td style=&quot;text-align: right&quot;&gt;3&lt;/td&gt;
        &lt;/tr&gt;
      &lt;/tbody&gt;
    &lt;/table&gt;
  &lt;/li&gt;
  &lt;li&gt;
    &lt;p&gt;the suffix array only records the start positions, i.e. contains the values &lt;code class=&quot;language-plaintext highlighter-rouge&quot;&gt;[10, 9, 7, 5, 2, 1, 4, 8, 6, 3]&lt;/code&gt; in the example above.&lt;/p&gt;
  &lt;/li&gt;
&lt;/ol&gt;

&lt;p&gt;Suffix arrays can be derived from suffix trees in \(\mathcal{O}(n^2 log\quad n)\) although more efficient algorithms that are able to build the array in \(\mathcal{O}(n)\) exist.&lt;/p&gt;

&lt;h2 id=&quot;applications&quot;&gt;Applications:&lt;/h2&gt;

&lt;ol&gt;
  &lt;li&gt;searching: &lt;em&gt;e.g. does the suffix &lt;code class=&quot;language-plaintext highlighter-rouge&quot;&gt;papa&lt;/code&gt; occur in the string?&lt;/em&gt; Do a binary search in the array and lookup the corresponding string value to determine whether a suffix is present.&lt;/li&gt;
  &lt;li&gt;counting: &lt;em&gt;e.g. how often does the suffix &lt;code class=&quot;language-plaintext highlighter-rouge&quot;&gt;apa&lt;/code&gt; occur?&lt;/em&gt;. Do a binary search and count the neighboring suffixes starting with &lt;code class=&quot;language-plaintext highlighter-rouge&quot;&gt;apa&lt;/code&gt;.&lt;/li&gt;
  &lt;li&gt;K-mer counting: compute all substrings of up to size &lt;code class=&quot;language-plaintext highlighter-rouge&quot;&gt;k&lt;/code&gt; and the number of times they occur in the string.&lt;/li&gt;
&lt;/ol&gt;</content><author><name>Albert Weichselbraun</name></author><category term="Big data" /><category term="data structures" /><category term="text search" /><summary type="html">The suffix array is a memory-efficient alternative to the suffix tree which provides a sorted list of string indices indicating the string’s suffixes.</summary></entry><entry><title type="html">Dynamic feature scaling for online learning of binary classifiers</title><link href="http://localhost:4000/big%20data/Dynamic-feature-scaling-for-online-learning-of-binary-classifiers/" rel="alternate" type="text/html" title="Dynamic feature scaling for online learning of binary classifiers" /><published>2017-11-10T00:00:00+01:00</published><updated>2017-11-10T00:00:00+01:00</updated><id>http://localhost:4000/big%20data/Dynamic-feature-scaling-for-online-learning-of-binary-classifiers</id><content type="html" xml:base="http://localhost:4000/big%20data/Dynamic-feature-scaling-for-online-learning-of-binary-classifiers/">&lt;p&gt;This article describes and evaluates different online feature scaling approaches and their impact on the performance of binary classifiers.&lt;/p&gt;
&lt;ol&gt;
  &lt;li&gt;online feature scaling requires features to be adapted on the fly, i.e. &lt;em&gt;before&lt;/em&gt; all properties of the underlying distribution are known.&lt;/li&gt;
  &lt;li&gt;the evaluations in the article suggest, that the rather simple &lt;strong&gt;unsupervised dynamic scaling&lt;/strong&gt; approach performs exceptionally well when used with the average weight vector for training and testing, to reduce the impact of the last features encountered in the learning step.&lt;/li&gt;
&lt;/ol&gt;

&lt;h2 id=&quot;method&quot;&gt;Method&lt;/h2&gt;

&lt;ol&gt;
  &lt;li&gt;
    &lt;p&gt;The feature value \(x_j\) for feature \(j\) is transformed using the medium \(\mu_j\) and standard deviation \(\sigma_j\) to the scaled value \(x_j'\):&lt;/p&gt;

\[x_j' = \frac{x_j - \mu_j}{\sigma_j}\]
  &lt;/li&gt;
  &lt;li&gt;
    &lt;p&gt;estimations of the &lt;em&gt;k&lt;/em&gt;th update of the mean and standard deviation for the &lt;em&gt;j&lt;/em&gt;th feature are obtained from:&lt;/p&gt;

\[\begin{align}
        \mu^k_j &amp;amp;= \mu^{k-1}_j + \frac{x_j^k - \mu_j^{k-1}}{k} \\
          s^k_j &amp;amp;= s^{k-1}_j + (x^k_j - \mu_j^{k-1}) (x_j^k - \mu_j^k) \text{ with}\\
     \sigma^k_j &amp;amp;= \sqrt{s^k_j/(k-1)}
  \end{align}\]
  &lt;/li&gt;
&lt;/ol&gt;</content><author><name>Albert Weichselbraun</name></author><category term="Big data" /><category term="artificial intelligence" /><category term="machine learning" /><category term="feature scaling" /><category term="classification" /><summary type="html">This article describes and evaluates different online feature scaling approaches and their impact on the performance of binary classifiers. online feature scaling requires features to be adapted on the fly, i.e. before all properties of the underlying distribution are known. the evaluations in the article suggest, that the rather simple unsupervised dynamic scaling approach performs exceptionally well when used with the average weight vector for training and testing, to reduce the impact of the last features encountered in the learning step.</summary></entry><entry><title type="html">40 years of suffix trees</title><link href="http://localhost:4000/big%20data/40-years-of-suffix-trees/" rel="alternate" type="text/html" title="40 years of suffix trees" /><published>2017-11-03T00:00:00+01:00</published><updated>2017-11-03T00:00:00+01:00</updated><id>http://localhost:4000/big%20data/40-years-of-suffix-trees</id><content type="html" xml:base="http://localhost:4000/big%20data/40-years-of-suffix-trees/">&lt;p&gt;Suffix trees are used in text searching, indexing, statistics. This article describes the history, construction, current developments and applications of suffix trees.&lt;/p&gt;

&lt;p&gt;Of special interest are applications that use suffix tries in conjunction with the Burrows-Wheeler transformation for compression and structures such as the &lt;em&gt;succinct suffix tree&lt;/em&gt; and the &lt;em&gt;suffix array&lt;/em&gt; that aim at reducing the space requirements of the tree.&lt;/p&gt;</content><author><name>Albert Weichselbraun</name></author><category term="Big data" /><category term="data structures" /><category term="text search" /><summary type="html">Suffix trees are used in text searching, indexing, statistics. This article describes the history, construction, current developments and applications of suffix trees.</summary></entry><entry><title type="html">Data sketching</title><link href="http://localhost:4000/big%20data/Data-sketching/" rel="alternate" type="text/html" title="Data sketching" /><published>2017-10-27T00:00:00+02:00</published><updated>2017-10-27T00:00:00+02:00</updated><id>http://localhost:4000/big%20data/Data-sketching</id><content type="html" xml:base="http://localhost:4000/big%20data/Data-sketching/">&lt;p&gt;This article introduces three popular data structures that efficiently handle and summarize large data sets.&lt;/p&gt;

&lt;ol&gt;
  &lt;li&gt;
    &lt;p&gt;&lt;strong&gt;Bloom filters&lt;/strong&gt; are basically sets which answer the question of whether an item is part of the set (i.e. has been seen by the filter) with either (i) “the item is definitely not a part of the set”, or (ii) “the item &lt;em&gt;might&lt;/em&gt; be part of the set.&lt;/p&gt;
  &lt;/li&gt;
  &lt;li&gt;
    &lt;p&gt;The &lt;strong&gt;Count-Min Sketch&lt;/strong&gt; method is a probabilistic method for counting the number of times items of a certain type have been observed. When queried the structure returns an estimation which is considered an &lt;em&gt;upper bound&lt;/em&gt; for the corresponding count.&lt;/p&gt;
  &lt;/li&gt;
  &lt;li&gt;
    &lt;p&gt;The &lt;strong&gt;HyperLogLog&lt;/strong&gt; method counts the number of different items seen in a large set of individuals without keeping count of every single individual.&lt;/p&gt;
  &lt;/li&gt;
&lt;/ol&gt;</content><author><name>Albert Weichselbraun</name></author><category term="Big data" /><category term="data structures" /><summary type="html">This article introduces three popular data structures that efficiently handle and summarize large data sets.</summary></entry><entry><title type="html">Rich Data, Poor Fields</title><link href="http://localhost:4000/big%20data/rich-data-poor-fields/" rel="alternate" type="text/html" title="Rich Data, Poor Fields" /><published>2016-11-23T14:27:21+01:00</published><updated>2016-11-23T14:27:21+01:00</updated><id>http://localhost:4000/big%20data/rich-data-poor-fields</id><content type="html" xml:base="http://localhost:4000/big%20data/rich-data-poor-fields/">&lt;p&gt;This article shows how handheld devices and big data technology may multiply field yields and make farming more environmentally friendly.&lt;/p&gt;

&lt;ul&gt;
  &lt;li&gt;GPS enabled precision leveling techniques and soil sampling reduce water and fertilizer consumption while increasing the farmer’s yield.&lt;/li&gt;
  &lt;li&gt;&lt;em&gt;data mining&lt;/em&gt; and &lt;em&gt;maschine learning&lt;/em&gt; help in analyzing satelity data, ground surveys, and past data on the climate, relief, geology and vegetation, supporting farmers in deciding (i) what to grow on and (ii) how to treat the soil;&lt;/li&gt;
  &lt;li&gt;hyperspectral imaging using satellites, drones and handheld devices recognizes diseases at an early stage&lt;/li&gt;
  &lt;li&gt;hand-held analytics devices help analyzing irregularities with the crop&lt;/li&gt;
&lt;/ul&gt;</content><author><name>Albert Weichselbraun</name></author><category term="Big data" /><category term="applications" /><category term="Big data" /><category term="farming" /><summary type="html">This article shows how handheld devices and big data technology may multiply field yields and make farming more environmentally friendly.</summary></entry><entry><title type="html">Borg, Omega and Kubernetes</title><link href="http://localhost:4000/scalability/borg-omega-and-kubernetes/" rel="alternate" type="text/html" title="Borg, Omega and Kubernetes" /><published>2016-11-23T14:03:56+01:00</published><updated>2016-11-23T14:03:56+01:00</updated><id>http://localhost:4000/scalability/borg-omega-and-kubernetes</id><content type="html" xml:base="http://localhost:4000/scalability/borg-omega-and-kubernetes/">&lt;div class=&quot;csl-bib-body&quot;&gt;
&lt;div class=&quot;csl-entry&quot;&gt;Burns, B., Grant, B., Oppenheimer, D., Brewer, E., &amp;amp; Wilkes, J. (2016). Borg, Omega, and Kubernetes. &lt;i&gt;Commun. ACM&lt;/i&gt;, &lt;i&gt;59&lt;/i&gt;(5), 50&amp;mdash;57. https://doi.org/10.1145/2890784&lt;/div&gt;
&lt;/div&gt;&lt;/p&gt;
&lt;div class=&quot;csl-entry&quot;&gt;&lt;/div&gt;&lt;/p&gt;
&lt;h2 class=&quot;csl-entry&quot;&gt;Summary&lt;/h2&gt;&lt;/p&gt;
&lt;div class=&quot;csl-entry&quot;&gt;In this article five Google engineers discuss lessons learned from over a decade of container management at Google such as&lt;/div&gt;&lt;/p&gt;
&lt;ol&gt;
&lt;li class=&quot;csl-entry&quot;&gt;the transformation from machine-oriented to application oriented (machine and operation system agnostic) deployment
&lt;ul&gt;
&lt;li class=&quot;csl-entry&quot;&gt;containers are the only entity supported by Google's infrastructure&lt;/li&gt;
&lt;li class=&quot;csl-entry&quot;&gt;log collection, telemetry (&lt;a href=&quot;https://github.com/google/cadvisor&quot;&gt;cAdvisor&lt;/a&gt;) and configuration is done on a per application level&lt;/li&gt;
&lt;/ul&gt;
&lt;/li&gt;
&lt;li class=&quot;csl-entry&quot;&gt;bundling of application containers into pods. A pod may, for instance, contain containers for (i) the main application, (ii) log rotation, etc. This design increases modularity and allows multiple teams to develop different pieces of the service.&lt;/li&gt;
&lt;li class=&quot;csl-entry&quot;&gt;Reduction of complexity by standardizing APIs and metadata. Kubernetes for instance provide the following three fields for every object:
&lt;ul&gt;
&lt;li class=&quot;csl-entry&quot;&gt;ObjectMetadata: information on objects (name, UID, etc.)&lt;/li&gt;
&lt;li class=&quot;csl-entry&quot;&gt;Specification: the object's &lt;em&gt;desired &lt;/em&gt; state&lt;/li&gt;
&lt;li class=&quot;csl-entry&quot;&gt;Status: the object's &lt;em&gt;current&lt;/em&gt; state&lt;/li&gt;
&lt;/ul&gt;
&lt;/li&gt;
&lt;li class=&quot;csl-entry&quot;&gt;recommendations for best practices
&lt;ul&gt;
&lt;li class=&quot;csl-entry&quot;&gt;don't let the container system manage port numbers&lt;/li&gt;
&lt;li class=&quot;csl-entry&quot;&gt;provide labels and metadata with the containers&lt;/li&gt;
&lt;li class=&quot;csl-entry&quot;&gt;don't expose raw state (e.g. force service access through a centralized API that hides implementation details and provides services for object validation, defaulting and versioning).&lt;/li&gt;
&lt;/ul&gt;
&lt;/li&gt;
&lt;/ol&gt;</content><author><name>Albert Weichselbraun</name></author><category term="Scalability" /><category term="scalabiity" /><category term="docker" /><category term="container infrastructure" /><category term="deployment" /><category term="devops" /><summary type="html">Burns, B., Grant, B., Oppenheimer, D., Brewer, E., &amp;amp; Wilkes, J. (2016). Borg, Omega, and Kubernetes. Commun. ACM, 59(5), 50&amp;mdash;57. https://doi.org/10.1145/2890784 Summary In this article five Google engineers discuss lessons learned from over a decade of container management at Google such as the transformation from machine-oriented to application oriented (machine and operation system agnostic) deployment containers are the only entity supported by Google's infrastructure log collection, telemetry (cAdvisor) and configuration is done on a per application level bundling of application containers into pods. A pod may, for instance, contain containers for (i) the main application, (ii) log rotation, etc. This design increases modularity and allows multiple teams to develop different pieces of the service. Reduction of complexity by standardizing APIs and metadata. Kubernetes for instance provide the following three fields for every object: ObjectMetadata: information on objects (name, UID, etc.) Specification: the object's desired state Status: the object's current state recommendations for best practices don't let the container system manage port numbers provide labels and metadata with the containers don't expose raw state (e.g. force service access through a centralized API that hides implementation details and provides services for object validation, defaulting and versioning).</summary></entry><entry><title type="html">Social-media-based public policy informatics: Sentiment and network analyses of U.S. Immigration and border security</title><link href="http://localhost:4000/web%20intelligence/social-media-based-public-policy-informatics-sentiment-and-network-analyses-of-u-s-immigration-and-border-security/" rel="alternate" type="text/html" title="Social-media-based public policy informatics: Sentiment and network analyses of U.S. Immigration and border security" /><published>2016-08-15T08:48:03+02:00</published><updated>2016-08-15T08:48:03+02:00</updated><id>http://localhost:4000/web%20intelligence/social-media-based-public-policy-informatics-sentiment-and-network-analyses-of-u-s-immigration-and-border-security</id><content type="html" xml:base="http://localhost:4000/web%20intelligence/social-media-based-public-policy-informatics-sentiment-and-network-analyses-of-u-s-immigration-and-border-security/">&lt;div&gt;Chung, W., &amp;amp; Zeng, D. (2016). Social-media-based public policy informatics: Sentiment and network analyses of U.S. Immigration and border security. &lt;i&gt;Journal of the Association for Information Science and Technology&lt;/i&gt;, &lt;i&gt;67&lt;/i&gt;(7), 1588&amp;mdash;1606.&lt;/div&gt;&lt;/p&gt;
&lt;div&gt;&lt;/div&gt;&lt;/p&gt;
&lt;h2&gt;Summary&lt;/h2&gt;&lt;/p&gt;
&lt;div&gt;This article presents a case study from the domain of policy informatics - i.e. the field of finding effective ways to use information technology to understand and tackle complex problems of society - which describes how Web intelligence has been successfully applied to assess the public sentiment towards the U.S. immigration and border security.&lt;/div&gt;&lt;/p&gt;
&lt;div&gt;&lt;/div&gt;&lt;/p&gt;
&lt;h2&gt;Method&lt;/h2&gt;&lt;/p&gt;
&lt;div&gt;
&lt;ol&gt;
&lt;li&gt;a framework for collecting relevant Tweets from Twitter&lt;/li&gt;
&lt;li&gt;sentiment analysis using &lt;strong&gt;eight emotional categories&lt;/strong&gt; defined in Plutchik (1980): anger, disgust, fear, sadness, surprise, anticipation, joy and trust and the emotion lexicon developed by Mohammad &amp;amp; Turney 2013.&lt;/li&gt;
&lt;li&gt;social network analysis using different metrics such as m&lt;em&gt;ost followed users, most befriended users,&lt;/em&gt; and betweenness&lt;em&gt; centrality  &lt;/em&gt;for identifying key players&lt;/li&gt;
&lt;li&gt;examination of differences in emotion and network between three major phases of the discussion using the Welch two sample t-test.&lt;/li&gt;
&lt;/ol&gt;&lt;/p&gt;
&lt;h2&gt;Conclusions&lt;/h2&gt;&lt;/p&gt;
&lt;ol&gt;
&lt;li&gt;news often coincide with changes in public sentiment&lt;/li&gt;
&lt;li&gt;Tweet posters and their relationships change considerably over time&lt;/li&gt;
&lt;li&gt;different influence metrics yield significantly different rankings&lt;/li&gt;
&lt;/ol&gt;
&lt;/div&gt;&lt;/p&gt;</content><author><name>Albert Weichselbraun</name></author><category term="Web Intelligence" /><category term="sentiment analysis" /><category term="policy informatics" /><category term="emotional analysis" /><category term="social network analysis" /><summary type="html">Chung, W., &amp;amp; Zeng, D. (2016). Social-media-based public policy informatics: Sentiment and network analyses of U.S. Immigration and border security. Journal of the Association for Information Science and Technology, 67(7), 1588&amp;mdash;1606. Summary This article presents a case study from the domain of policy informatics - i.e. the field of finding effective ways to use information technology to understand and tackle complex problems of society - which describes how Web intelligence has been successfully applied to assess the public sentiment towards the U.S. immigration and border security. Method a framework for collecting relevant Tweets from Twitter sentiment analysis using eight emotional categories defined in Plutchik (1980): anger, disgust, fear, sadness, surprise, anticipation, joy and trust and the emotion lexicon developed by Mohammad &amp;amp; Turney 2013. social network analysis using different metrics such as most followed users, most befriended users, and betweenness centrality for identifying key players examination of differences in emotion and network between three major phases of the discussion using the Welch two sample t-test. Conclusions news often coincide with changes in public sentiment Tweet posters and their relationships change considerably over time different influence metrics yield significantly different rankings</summary></entry><entry><title type="html">Polarity Shift Detection, Elimination and Ensemble: A Three-Stage Model for Document-Level Sentiment Analysis</title><link href="http://localhost:4000/sentiment%20detection/polarity-shift-detection-elimination-and-ensemble-a-three-stage-model-for-document-level-sentiment-analysis/" rel="alternate" type="text/html" title="Polarity Shift Detection, Elimination and Ensemble: A Three-Stage Model for Document-Level Sentiment Analysis" /><published>2016-08-12T10:55:28+02:00</published><updated>2016-08-12T10:55:28+02:00</updated><id>http://localhost:4000/sentiment%20detection/polarity-shift-detection-elimination-and-ensemble-a-three-stage-model-for-document-level-sentiment-analysis</id><content type="html" xml:base="http://localhost:4000/sentiment%20detection/polarity-shift-detection-elimination-and-ensemble-a-three-stage-model-for-document-level-sentiment-analysis/">&lt;div&gt;
&lt;div&gt;Xia, Rui, Feng Xu, Jianfei Yu, Yong Qi, and Erik Cambria. Polarity Shift Detection, Elimination and Ensemble: A Three-Stage Model for Document-Level Sentiment Analysis. &lt;i&gt;Information Processing &amp;amp; Management&lt;/i&gt;, Emotion and Sentiment in Social and Expressive Media, 52, no. 1 (January 2016): 36&amp;mdash;45.&lt;/div&gt;&lt;/p&gt;
&lt;h2&gt;Introduction&lt;/h2&gt;
This article presents an approach for handling explicit polarity shifts due to (i) negation (I don't like this movie), and (ii) contrast (Fairly good, but not my style) as well as implicit shifts due to sentiment inconsistency that appears frequently if people express different opinions towards different aspects of a product or event.&lt;/p&gt;
&lt;ol&gt;
&lt;li&gt;&lt;strong&gt;Negation&lt;/strong&gt; usually shifts the sentiment of the affected parts, &lt;strong&gt;&lt;/strong&gt;&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Contrast&lt;/strong&gt; &lt;em&gt;can&lt;/em&gt; shift the polarity of neighboring sentences or subsentences. If the polarity shift is not considered, the impact of the shifted part should be decreased relatively to the unshifted part.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Sentiment inconsistency&lt;/strong&gt; can be viewed as a type of implicit contrast - i.e. the impact of the inconsistent parts should be weakened.&lt;/li&gt;
&lt;/ol&gt;&lt;/p&gt;
&lt;h2&gt;Method&lt;/h2&gt;&lt;/p&gt;
&lt;div&gt;The authors deploy a three stage model to address polarity shifts:&lt;/div&gt;&lt;/p&gt;
&lt;div&gt;
&lt;ol&gt;
&lt;li&gt;Rules &lt;strong&gt;identify &lt;/strong&gt;negation as well as forward and backward contrasts. A statistical method that draws upon the &lt;em&gt;weighted log-likelihood ratio (WLLR)&lt;/em&gt; detects statistical inconsistencies in reviews (i.e. cases where one sentence sentiment is inconsistent with the overall document sentiment).&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Negation polarity shift elimination&lt;/strong&gt; by replacing negated terms with their antonyms. The antonyms are, again, determined based on the WLLR metric obtained for terms in the training documents. For example, the most positive term would be replaced with the most negative term according to WLLR (these substitutions correspond to the relative sentiment strength rather than to the actual meaning of the term). The relevance of a term for positive/negative sentiment is computed as outlined below.
$$\text{relevance}(t_i, +) = p(t_i | +) log \frac{p(t_i |+)}{p(t_i | -)}$$
$$\text{relevance}(t_i, -) = p(t_i | -) log \frac{p(t_i |-)}{p(t_i | +)}$$&lt;/li&gt;&lt;/p&gt;
&lt;li&gt;The &lt;strong&gt;polarity shift ensemble model&lt;/strong&gt; is trained based on three components: (i) sentences for which negations have been eliminated, (ii) sentences containing contrast, and (iii) sentences with sentiment inconsistency as well as a base classifier for sentences without polarity shifts.&lt;/li&gt;
&lt;/ol&gt;&lt;/p&gt;
&lt;h2&gt;Evaluation&lt;/h2&gt;
The evaluation draws upon the Multi-domain sentiment datasets by Blitzer, Dredze and Pereira (2007) that contains four datasets of 1000 positive and negative Amazon reviews each. The authors use linear SVM (LibSVM), logistic regression (LibLinear) and Naive Bayes (OpenPR-NB) to evaluate their approach against the following four methods:&lt;/p&gt;
&lt;ol&gt;
&lt;li&gt;Baseline (bag of words without negation detection)&lt;/li&gt;
&lt;li&gt;Das (2001): negated words are marked with the suffix &quot;-NOT&quot; prior to training and classification.&lt;/li&gt;
&lt;li&gt;REV: sentiment words in the scope of negation are reversed to their antonyms.&lt;/li&gt;
&lt;li&gt;Li et al. (2010): text is separated into a polarity-shifted and polarity-unshifted fraction based on which two classifiers are trained.&lt;/li&gt;
&lt;li&gt;the presented approach&lt;/li&gt;
&lt;/ol&gt;
The evaluation demonstrates that the presented approach outperforms all methods used in the experiments.&lt;/p&gt;
&lt;p&gt;&lt;/div&gt;&lt;/p&gt;
&lt;div&gt;&lt;/div&gt;
&lt;/div&gt;&lt;/p&gt;</content><author><name>Albert Weichselbraun</name></author><category term="Sentiment Detection" /><category term="negation" /><category term="polarity shift" /><category term="word relevance" /><summary type="html">Xia, Rui, Feng Xu, Jianfei Yu, Yong Qi, and Erik Cambria. Polarity Shift Detection, Elimination and Ensemble: A Three-Stage Model for Document-Level Sentiment Analysis. Information Processing &amp;amp; Management, Emotion and Sentiment in Social and Expressive Media, 52, no. 1 (January 2016): 36&amp;mdash;45. Introduction This article presents an approach for handling explicit polarity shifts due to (i) negation (I don't like this movie), and (ii) contrast (Fairly good, but not my style) as well as implicit shifts due to sentiment inconsistency that appears frequently if people express different opinions towards different aspects of a product or event. Negation usually shifts the sentiment of the affected parts, Contrast can shift the polarity of neighboring sentences or subsentences. If the polarity shift is not considered, the impact of the shifted part should be decreased relatively to the unshifted part. Sentiment inconsistency can be viewed as a type of implicit contrast - i.e. the impact of the inconsistent parts should be weakened. Method The authors deploy a three stage model to address polarity shifts: Rules identify negation as well as forward and backward contrasts. A statistical method that draws upon the weighted log-likelihood ratio (WLLR) detects statistical inconsistencies in reviews (i.e. cases where one sentence sentiment is inconsistent with the overall document sentiment). Negation polarity shift elimination by replacing negated terms with their antonyms. The antonyms are, again, determined based on the WLLR metric obtained for terms in the training documents. For example, the most positive term would be replaced with the most negative term according to WLLR (these substitutions correspond to the relative sentiment strength rather than to the actual meaning of the term). The relevance of a term for positive/negative sentiment is computed as outlined below. $$\text{relevance}(t_i, +) = p(t_i | +) log \frac{p(t_i |+)}{p(t_i | -)}$$ $$\text{relevance}(t_i, -) = p(t_i | -) log \frac{p(t_i |-)}{p(t_i | +)}$$ The polarity shift ensemble model is trained based on three components: (i) sentences for which negations have been eliminated, (ii) sentences containing contrast, and (iii) sentences with sentiment inconsistency as well as a base classifier for sentences without polarity shifts. Evaluation The evaluation draws upon the Multi-domain sentiment datasets by Blitzer, Dredze and Pereira (2007) that contains four datasets of 1000 positive and negative Amazon reviews each. The authors use linear SVM (LibSVM), logistic regression (LibLinear) and Naive Bayes (OpenPR-NB) to evaluate their approach against the following four methods: Baseline (bag of words without negation detection) Das (2001): negated words are marked with the suffix &quot;-NOT&quot; prior to training and classification. REV: sentiment words in the scope of negation are reversed to their antonyms. Li et al. (2010): text is separated into a polarity-shifted and polarity-unshifted fraction based on which two classifiers are trained. the presented approach The evaluation demonstrates that the presented approach outperforms all methods used in the experiments.</summary></entry></feed>