ABSTRACT We propose a system for automatic detection of duplicate entries in a repository of semi... more ABSTRACT We propose a system for automatic detection of duplicate entries in a repository of semi-structured text documents. The proposed system employs text-entity recognition to extract information regarding time, location, names of persons and organizations, as well as events described within the document content. With structured representations of the content, called “metamodels”, we group the entries into clusters based on the similarity of the contents. Then we apply machine-learning algorithms to the clusters to carry out duplicate detection. We present results regarding precision, recall, and F-value of the proposed system.
Most graph-theoretical clustering algorithms require the complete adjacency relation of the graph... more Most graph-theoretical clustering algorithms require the complete adjacency relation of the graph representing the examined data. This is infeasible for very large graphs currently emerging in many application areas. We propose a local approach that computes clusters in graphs, one at a time, relying only on the neighborhoods of the vertices included in the current cluster candidate. This enables implementing a local and parameter-free algorithm. Approximate clusters may be identified quickly by heuristic methods. We report experimental results on clustering graphs using simulated annealing.
ABSTRACT We present a software tool created for human-computer interaction based on hand gestures... more ABSTRACT We present a software tool created for human-computer interaction based on hand gestures. The underlying algorithm utilizes computer vision techniques. The tool is able to recognize in real-time six different hand signals, captured using a web cam. Experiments conducted to evaluate the system performance are reported.
ABSTRACT We propose a system for automatic detection of duplicate entries in a repository of semi... more ABSTRACT We propose a system for automatic detection of duplicate entries in a repository of semi-structured text documents. The proposed system employs text-entity recognition to extract information regarding time, location, names of persons and organizations, as well as events described within the document content. With structured representations of the content, called “metamodels”, we group the entries into clusters based on the similarity of the contents. Then we apply machine-learning algorithms to the clusters to carry out duplicate detection. We present results regarding precision, recall, and F-value of the proposed system.
ABSTRACT In this work, a directional overcurrent relay coordination is carried out considering mo... more ABSTRACT In this work, a directional overcurrent relay coordination is carried out considering more than one level of short-circuit current and non-standardized inverse time curves. A genetic algorithm is proposed and shown capable of obtaining adequate protection settings in a reasonable time. The algorithm designs a specific time curve for each relay, improving the results of the coordination process without compromising the compatibility of the curves.
2010 XXIX International Conference of the Chilean Computer Science Society, 2010
In this work, we address the problem of locally estimating the size of a natural network using lo... more In this work, we address the problem of locally estimating the size of a natural network using local information: fitting the sum of new neighbors discovered at step of a breadth-first search (BFS) with a logarithmic function we determined as a ln(Γ(i))e + b. With rather little computation, we reach an estimation error of at most five percent, only allowing
ABSTRACT Social networks can be modeled and analyzed in terms of graph theory. This chapter provi... more ABSTRACT Social networks can be modeled and analyzed in terms of graph theory. This chapter provides an overview of the mathematical modeling of social networks with an overview of the metrics used to characterize them and the models used to artificially mimic the formation of such networks. We discuss metrics based on distances, degrees, and neighborhoods as well as the use of such metrics to detect change in the network structure. We also discuss the kind of structural differences that distinguish social networks from other types of natural networks together with the implications of these differences about the way in which these networks function.
Some Hybrid Packing Systems integrate several algorithms to solve the bin packing problem (BPP) b... more Some Hybrid Packing Systems integrate several algorithms to solve the bin packing problem (BPP) based on their past performance and the problem characterization. These systems relate BPP characteristics with the performance of the set of solution algorithms and allow us to estimate which algorithm is to yield the best performance for a previously unseen instance. The present paper focuses on the characterization of NP-hard problems. In related work, characterization metrics are traditionally oriented towards problem structure. In this ...
ABSTRACT We propose a system for automatic detection of duplicate entries in a repository of semi... more ABSTRACT We propose a system for automatic detection of duplicate entries in a repository of semi-structured text documents. The proposed system employs text-entity recognition to extract information regarding time, location, names of persons and organizations, as well as events described within the document content. With structured representations of the content, called “metamodels”, we group the entries into clusters based on the similarity of the contents. Then we apply machine-learning algorithms to the clusters to carry out duplicate detection. We present results regarding precision, recall, and F-value of the proposed system.
Most graph-theoretical clustering algorithms require the complete adjacency relation of the graph... more Most graph-theoretical clustering algorithms require the complete adjacency relation of the graph representing the examined data. This is infeasible for very large graphs currently emerging in many application areas. We propose a local approach that computes clusters in graphs, one at a time, relying only on the neighborhoods of the vertices included in the current cluster candidate. This enables implementing a local and parameter-free algorithm. Approximate clusters may be identified quickly by heuristic methods. We report experimental results on clustering graphs using simulated annealing.
ABSTRACT We present a software tool created for human-computer interaction based on hand gestures... more ABSTRACT We present a software tool created for human-computer interaction based on hand gestures. The underlying algorithm utilizes computer vision techniques. The tool is able to recognize in real-time six different hand signals, captured using a web cam. Experiments conducted to evaluate the system performance are reported.
ABSTRACT We propose a system for automatic detection of duplicate entries in a repository of semi... more ABSTRACT We propose a system for automatic detection of duplicate entries in a repository of semi-structured text documents. The proposed system employs text-entity recognition to extract information regarding time, location, names of persons and organizations, as well as events described within the document content. With structured representations of the content, called “metamodels”, we group the entries into clusters based on the similarity of the contents. Then we apply machine-learning algorithms to the clusters to carry out duplicate detection. We present results regarding precision, recall, and F-value of the proposed system.
ABSTRACT In this work, a directional overcurrent relay coordination is carried out considering mo... more ABSTRACT In this work, a directional overcurrent relay coordination is carried out considering more than one level of short-circuit current and non-standardized inverse time curves. A genetic algorithm is proposed and shown capable of obtaining adequate protection settings in a reasonable time. The algorithm designs a specific time curve for each relay, improving the results of the coordination process without compromising the compatibility of the curves.
2010 XXIX International Conference of the Chilean Computer Science Society, 2010
In this work, we address the problem of locally estimating the size of a natural network using lo... more In this work, we address the problem of locally estimating the size of a natural network using local information: fitting the sum of new neighbors discovered at step of a breadth-first search (BFS) with a logarithmic function we determined as a ln(Γ(i))e + b. With rather little computation, we reach an estimation error of at most five percent, only allowing
ABSTRACT Social networks can be modeled and analyzed in terms of graph theory. This chapter provi... more ABSTRACT Social networks can be modeled and analyzed in terms of graph theory. This chapter provides an overview of the mathematical modeling of social networks with an overview of the metrics used to characterize them and the models used to artificially mimic the formation of such networks. We discuss metrics based on distances, degrees, and neighborhoods as well as the use of such metrics to detect change in the network structure. We also discuss the kind of structural differences that distinguish social networks from other types of natural networks together with the implications of these differences about the way in which these networks function.
Some Hybrid Packing Systems integrate several algorithms to solve the bin packing problem (BPP) b... more Some Hybrid Packing Systems integrate several algorithms to solve the bin packing problem (BPP) based on their past performance and the problem characterization. These systems relate BPP characteristics with the performance of the set of solution algorithms and allow us to estimate which algorithm is to yield the best performance for a previously unseen instance. The present paper focuses on the characterization of NP-hard problems. In related work, characterization metrics are traditionally oriented towards problem structure. In this ...
Uploads
Papers by Satu Elisa Schaeffer