Search is not available for this dataset
id string | submitter string | authors string | title string | comments string | journal-ref string | doi string | report-no string | categories string | license string | abstract string | versions list | update_date timestamp[s] | authors_parsed list | prompt string |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1206.4611 | Pratik Jawanpuria | Pratik Jawanpuria (IIT Bombay), J. Saketha Nath (IIT Bombay) | A Convex Feature Learning Formulation for Latent Task Structure
Discovery | ICML2012 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper considers the multi-task learning problem and in the setting where
some relevant features could be shared across few related tasks. Most of the
existing methods assume the extent to which the given tasks are related or
share a common feature space to be known apriori. In real-world applications
however, it... | [
{
"version": "v1",
"created": "Mon, 18 Jun 2012 15:00:07 GMT"
}
] | 2012-06-22T00:00:00 | [
[
"Jawanpuria",
"Pratik",
"",
"IIT Bombay"
],
[
"Nath",
"J. Saketha",
"",
"IIT Bombay"
]
] | TITLE: A Convex Feature Learning Formulation for Latent Task Structure
Discovery
ABSTRACT: This paper considers the multi-task learning problem and in the setting where
some relevant features could be shared across few related tasks. Most of the
existing methods assume the extent to which the given tasks are rela... |
1206.4616 | Drausin Wulsin | Drausin Wulsin (University of Pennsylvania), Shane Jensen (University
of Pennsylvania), Brian Litt (University of Pennsylvania) | A Hierarchical Dirichlet Process Model with Multiple Levels of
Clustering for Human EEG Seizure Modeling | ICML2012 | null | null | null | stat.AP cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Driven by the multi-level structure of human intracranial
electroencephalogram (iEEG) recordings of epileptic seizures, we introduce a
new variant of a hierarchical Dirichlet Process---the multi-level clustering
hierarchical Dirichlet Process (MLC-HDP)---that simultaneously clusters
datasets on multiple levels. Our s... | [
{
"version": "v1",
"created": "Mon, 18 Jun 2012 15:02:12 GMT"
}
] | 2012-06-22T00:00:00 | [
[
"Wulsin",
"Drausin",
"",
"University of Pennsylvania"
],
[
"Jensen",
"Shane",
"",
"University\n of Pennsylvania"
],
[
"Litt",
"Brian",
"",
"University of Pennsylvania"
]
] | TITLE: A Hierarchical Dirichlet Process Model with Multiple Levels of
Clustering for Human EEG Seizure Modeling
ABSTRACT: Driven by the multi-level structure of human intracranial
electroencephalogram (iEEG) recordings of epileptic seizures, we introduce a
new variant of a hierarchical Dirichlet Process---the mul... |
1206.4618 | Wei Liu | Wei Liu (Columbia University), Jun Wang (IBM T. J. Watson Research
Center), Yadong Mu (Columbia University), Sanjiv Kumar (Google), Shih-Fu
Chang (Columbia University) | Compact Hyperplane Hashing with Bilinear Functions | ICML2012 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Hyperplane hashing aims at rapidly searching nearest points to a hyperplane,
and has shown practical impact in scaling up active learning with SVMs.
Unfortunately, the existing randomized methods need long hash codes to achieve
reasonable search accuracy and thus suffer from reduced search speed and large
memory over... | [
{
"version": "v1",
"created": "Mon, 18 Jun 2012 15:03:10 GMT"
}
] | 2012-06-22T00:00:00 | [
[
"Liu",
"Wei",
"",
"Columbia University"
],
[
"Wang",
"Jun",
"",
"IBM T. J. Watson Research\n Center"
],
[
"Mu",
"Yadong",
"",
"Columbia University"
],
[
"Kumar",
"Sanjiv",
"",
"Google"
],
[
"Chang",
"Shih-Fu",
"",
"Co... | TITLE: Compact Hyperplane Hashing with Bilinear Functions
ABSTRACT: Hyperplane hashing aims at rapidly searching nearest points to a hyperplane,
and has shown practical impact in scaling up active learning with SVMs.
Unfortunately, the existing randomized methods need long hash codes to achieve
reasonable search ac... |
1206.4622 | Aaron Defazio | Aaron Defazio (ANU), Tiberio Caetano (NICTA and Australian National
University) | A Graphical Model Formulation of Collaborative Filtering Neighbourhood
Methods with Fast Maximum Entropy Training | ICML2012 | null | null | null | cs.LG cs.IR stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Item neighbourhood methods for collaborative filtering learn a weighted graph
over the set of items, where each item is connected to those it is most similar
to. The prediction of a user's rating on an item is then given by that rating
of neighbouring items, weighted by their similarity. This paper presents a new
nei... | [
{
"version": "v1",
"created": "Mon, 18 Jun 2012 15:05:52 GMT"
}
] | 2012-06-22T00:00:00 | [
[
"Defazio",
"Aaron",
"",
"ANU"
],
[
"Caetano",
"Tiberio",
"",
"NICTA and Australian National\n University"
]
] | TITLE: A Graphical Model Formulation of Collaborative Filtering Neighbourhood
Methods with Fast Maximum Entropy Training
ABSTRACT: Item neighbourhood methods for collaborative filtering learn a weighted graph
over the set of items, where each item is connected to those it is most similar
to. The prediction of a u... |
1206.4625 | Ye Nan | Ye Nan (NUS), Kian Ming Chai (DSO National Laboratories), Wee Sun Lee
(NUS), Hai Leong Chieu (DSO National Laboratories) | Optimizing F-measure: A Tale of Two Approaches | ICML2012 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | F-measures are popular performance metrics, particularly for tasks with
imbalanced data sets. Algorithms for learning to maximize F-measures follow two
approaches: the empirical utility maximization (EUM) approach learns a
classifier having optimal performance on training data, while the
decision-theoretic approach l... | [
{
"version": "v1",
"created": "Mon, 18 Jun 2012 15:07:04 GMT"
}
] | 2012-06-22T00:00:00 | [
[
"Nan",
"Ye",
"",
"NUS"
],
[
"Chai",
"Kian Ming",
"",
"DSO National Laboratories"
],
[
"Lee",
"Wee Sun",
"",
"NUS"
],
[
"Chieu",
"Hai Leong",
"",
"DSO National Laboratories"
]
] | TITLE: Optimizing F-measure: A Tale of Two Approaches
ABSTRACT: F-measures are popular performance metrics, particularly for tasks with
imbalanced data sets. Algorithms for learning to maximize F-measures follow two
approaches: the empirical utility maximization (EUM) approach learns a
classifier having optimal per... |
1206.4626 | Steven C.H. Hoi | Bin Li (NTU), Steven C.H. Hoi (NTU) | On-Line Portfolio Selection with Moving Average Reversion | ICML2012 | null | null | null | cs.CE cs.LG q-fin.PM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | On-line portfolio selection has attracted increasing interests in machine
learning and AI communities recently. Empirical evidences show that stock's
high and low prices are temporary and stock price relatives are likely to
follow the mean reversion phenomenon. While the existing mean reversion
strategies are shown t... | [
{
"version": "v1",
"created": "Mon, 18 Jun 2012 15:07:23 GMT"
}
] | 2012-06-22T00:00:00 | [
[
"Li",
"Bin",
"",
"NTU"
],
[
"Hoi",
"Steven C. H.",
"",
"NTU"
]
] | TITLE: On-Line Portfolio Selection with Moving Average Reversion
ABSTRACT: On-line portfolio selection has attracted increasing interests in machine
learning and AI communities recently. Empirical evidences show that stock's
high and low prices are temporary and stock price relatives are likely to
follow the mean r... |
1206.4633 | Steven C.H. Hoi | Peilin Zhao (NTU), Jialei Wang (NTU), Pengcheng Wu (NTU), Rong Jin
(MSU), Steven C.H. Hoi (NTU) | Fast Bounded Online Gradient Descent Algorithms for Scalable
Kernel-Based Online Learning | ICML2012 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Kernel-based online learning has often shown state-of-the-art performance for
many online learning tasks. It, however, suffers from a major shortcoming, that
is, the unbounded number of support vectors, making it non-scalable and
unsuitable for applications with large-scale datasets. In this work, we study
the proble... | [
{
"version": "v1",
"created": "Mon, 18 Jun 2012 15:13:13 GMT"
}
] | 2012-06-22T00:00:00 | [
[
"Zhao",
"Peilin",
"",
"NTU"
],
[
"Wang",
"Jialei",
"",
"NTU"
],
[
"Wu",
"Pengcheng",
"",
"NTU"
],
[
"Jin",
"Rong",
"",
"MSU"
],
[
"Hoi",
"Steven C. H.",
"",
"NTU"
]
] | TITLE: Fast Bounded Online Gradient Descent Algorithms for Scalable
Kernel-Based Online Learning
ABSTRACT: Kernel-based online learning has often shown state-of-the-art performance for
many online learning tasks. It, however, suffers from a major shortcoming, that
is, the unbounded number of support vectors, maki... |
1206.4635 | Yichuan Tang | Yichuan Tang (University of Toronto), Ruslan Salakhutdinov (University
of Toronto), Geoffrey Hinton (University of Toronto) | Deep Mixtures of Factor Analysers | ICML2012 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An efficient way to learn deep density models that have many layers of latent
variables is to learn one layer at a time using a model that has only one layer
of latent variables. After learning each layer, samples from the posterior
distributions for that layer are used as training data for learning the next
layer. T... | [
{
"version": "v1",
"created": "Mon, 18 Jun 2012 15:14:57 GMT"
}
] | 2012-06-22T00:00:00 | [
[
"Tang",
"Yichuan",
"",
"University of Toronto"
],
[
"Salakhutdinov",
"Ruslan",
"",
"University\n of Toronto"
],
[
"Hinton",
"Geoffrey",
"",
"University of Toronto"
]
] | TITLE: Deep Mixtures of Factor Analysers
ABSTRACT: An efficient way to learn deep density models that have many layers of latent
variables is to learn one layer at a time using a model that has only one layer
of latent variables. After learning each layer, samples from the posterior
distributions for that layer are... |
1206.4636 | M. Pawan Kumar | M. Pawan Kumar (Ecole Centrale Paris), Ben Packer (Stanford
University), Daphne Koller (Stanford University) | Modeling Latent Variable Uncertainty for Loss-based Learning | ICML2012 | null | null | null | cs.LG cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of parameter estimation using weakly supervised
datasets, where a training sample consists of the input and a partially
specified annotation, which we refer to as the output. The missing information
in the annotation is modeled using latent variables. Previous methods
overburden a single distr... | [
{
"version": "v1",
"created": "Mon, 18 Jun 2012 15:15:13 GMT"
}
] | 2012-06-22T00:00:00 | [
[
"Kumar",
"M. Pawan",
"",
"Ecole Centrale Paris"
],
[
"Packer",
"Ben",
"",
"Stanford\n University"
],
[
"Koller",
"Daphne",
"",
"Stanford University"
]
] | TITLE: Modeling Latent Variable Uncertainty for Loss-based Learning
ABSTRACT: We consider the problem of parameter estimation using weakly supervised
datasets, where a training sample consists of the input and a partially
specified annotation, which we refer to as the output. The missing information
in the annotati... |
1206.4644 | Ruijiang Li | Ruijiang Li (Fudan University), Bin Li (University of Technology,
Sydney), Ke Zhang (Fudan Univ.), Cheng Jin (Fudan University), Xiangyang Xue
(Fudan University) | Groupwise Constrained Reconstruction for Subspace Clustering | ICML2012 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reconstruction based subspace clustering methods compute a self
reconstruction matrix over the samples and use it for spectral clustering to
obtain the final clustering result. Their success largely relies on the
assumption that the underlying subspaces are independent, which, however, does
not always hold in the app... | [
{
"version": "v1",
"created": "Mon, 18 Jun 2012 15:19:22 GMT"
}
] | 2012-06-22T00:00:00 | [
[
"Li",
"Ruijiang",
"",
"Fudan University"
],
[
"Li",
"Bin",
"",
"University of Technology,\n Sydney"
],
[
"Zhang",
"Ke",
"",
"Fudan Univ."
],
[
"Jin",
"Cheng",
"",
"Fudan University"
],
[
"Xue",
"Xiangyang",
"",
"Fudan... | TITLE: Groupwise Constrained Reconstruction for Subspace Clustering
ABSTRACT: Reconstruction based subspace clustering methods compute a self
reconstruction matrix over the samples and use it for spectral clustering to
obtain the final clustering result. Their success largely relies on the
assumption that the under... |
1206.4653 | Maya Gupta | Nathan Parrish (University of Washington), Maya Gupta (University of
Washington) | Dimensionality Reduction by Local Discriminative Gaussians | ICML2012 | null | null | null | cs.LG cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present local discriminative Gaussian (LDG) dimensionality reduction, a
supervised dimensionality reduction technique for classification. The LDG
objective function is an approximation to the leave-one-out training error of a
local quadratic discriminant analysis classifier, and thus acts locally to each
training ... | [
{
"version": "v1",
"created": "Mon, 18 Jun 2012 15:24:49 GMT"
}
] | 2012-06-22T00:00:00 | [
[
"Parrish",
"Nathan",
"",
"University of Washington"
],
[
"Gupta",
"Maya",
"",
"University of\n Washington"
]
] | TITLE: Dimensionality Reduction by Local Discriminative Gaussians
ABSTRACT: We present local discriminative Gaussian (LDG) dimensionality reduction, a
supervised dimensionality reduction technique for classification. The LDG
objective function is an approximation to the leave-one-out training error of a
local quadr... |
1206.4657 | Elad Hazan | Elad Hazan (Technion), Satyen Kale (IBM T.J. Watson Research Center) | Projection-free Online Learning | ICML2012 | null | null | null | cs.LG cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The computational bottleneck in applying online learning to massive data sets
is usually the projection step. We present efficient online learning algorithms
that eschew projections in favor of much more efficient linear optimization
steps using the Frank-Wolfe technique. We obtain a range of regret bounds for
online... | [
{
"version": "v1",
"created": "Mon, 18 Jun 2012 15:26:34 GMT"
}
] | 2012-06-22T00:00:00 | [
[
"Hazan",
"Elad",
"",
"Technion"
],
[
"Kale",
"Satyen",
"",
"IBM T.J. Watson Research Center"
]
] | TITLE: Projection-free Online Learning
ABSTRACT: The computational bottleneck in applying online learning to massive data sets
is usually the projection step. We present efficient online learning algorithms
that eschew projections in favor of much more efficient linear optimization
steps using the Frank-Wolfe techn... |
1206.4659 | Jun Zhu | Jun Zhu (Tsinghua University) | Max-Margin Nonparametric Latent Feature Models for Link Prediction | ICML2012 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a max-margin nonparametric latent feature model, which unites the
ideas of max-margin learning and Bayesian nonparametrics to discover
discriminative latent features for link prediction and automatically infer the
unknown latent social dimension. By minimizing a hinge-loss using the linear
expectation oper... | [
{
"version": "v1",
"created": "Mon, 18 Jun 2012 15:27:56 GMT"
}
] | 2012-06-22T00:00:00 | [
[
"Zhu",
"Jun",
"",
"Tsinghua University"
]
] | TITLE: Max-Margin Nonparametric Latent Feature Models for Link Prediction
ABSTRACT: We present a max-margin nonparametric latent feature model, which unites the
ideas of max-margin learning and Bayesian nonparametrics to discover
discriminative latent features for link prediction and automatically infer the
unknown... |
1206.4660 | Lixin Duan | Lixin Duan (Nanyang Technological University), Dong Xu (Nanyang
Technological University), Ivor Tsang (Nanyang Technological University) | Learning with Augmented Features for Heterogeneous Domain Adaptation | ICML2012 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a new learning method for heterogeneous domain adaptation (HDA),
in which the data from the source domain and the target domain are represented
by heterogeneous features with different dimensions. Using two different
projection matrices, we first transform the data from two domains into a common
subspace i... | [
{
"version": "v1",
"created": "Mon, 18 Jun 2012 15:28:12 GMT"
}
] | 2012-06-22T00:00:00 | [
[
"Duan",
"Lixin",
"",
"Nanyang Technological University"
],
[
"Xu",
"Dong",
"",
"Nanyang\n Technological University"
],
[
"Tsang",
"Ivor",
"",
"Nanyang Technological University"
]
] | TITLE: Learning with Augmented Features for Heterogeneous Domain Adaptation
ABSTRACT: We propose a new learning method for heterogeneous domain adaptation (HDA),
in which the data from the source domain and the target domain are represented
by heterogeneous features with different dimensions. Using two different
pr... |
1206.4672 | Akshay Krishnamurthy | Akshay Krishnamurthy (Carnegie Mellon University), Sivaraman
Balakrishnan (Carnegie Mellon University), Min Xu (Carnegie Mellon
University), Aarti Singh (Carnegie Mellon University) | Efficient Active Algorithms for Hierarchical Clustering | ICML2012 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Advances in sensing technologies and the growth of the internet have resulted
in an explosion in the size of modern datasets, while storage and processing
power continue to lag behind. This motivates the need for algorithms that are
efficient, both in terms of the number of measurements needed and running time.
To co... | [
{
"version": "v1",
"created": "Mon, 18 Jun 2012 15:35:20 GMT"
}
] | 2012-06-22T00:00:00 | [
[
"Krishnamurthy",
"Akshay",
"",
"Carnegie Mellon University"
],
[
"Balakrishnan",
"Sivaraman",
"",
"Carnegie Mellon University"
],
[
"Xu",
"Min",
"",
"Carnegie Mellon\n University"
],
[
"Singh",
"Aarti",
"",
"Carnegie Mellon University"
... | TITLE: Efficient Active Algorithms for Hierarchical Clustering
ABSTRACT: Advances in sensing technologies and the growth of the internet have resulted
in an explosion in the size of modern datasets, while storage and processing
power continue to lag behind. This motivates the need for algorithms that are
efficient,... |
1206.4673 | Junming Yin | Junming Yin (Carnegie Mellon University), Xi Chen (Carnegie Mellon
University), Eric Xing (Carnegie Mellon University) | Group Sparse Additive Models | ICML2012 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of sparse variable selection in nonparametric
additive models, with the prior knowledge of the structure among the covariates
to encourage those variables within a group to be selected jointly. Previous
works either study the group sparsity in the parametric setting (e.g., group
lasso), or add... | [
{
"version": "v1",
"created": "Mon, 18 Jun 2012 15:35:38 GMT"
}
] | 2012-06-22T00:00:00 | [
[
"Yin",
"Junming",
"",
"Carnegie Mellon University"
],
[
"Chen",
"Xi",
"",
"Carnegie Mellon\n University"
],
[
"Xing",
"Eric",
"",
"Carnegie Mellon University"
]
] | TITLE: Group Sparse Additive Models
ABSTRACT: We consider the problem of sparse variable selection in nonparametric
additive models, with the prior knowledge of the structure among the covariates
to encourage those variables within a group to be selected jointly. Previous
works either study the group sparsity in th... |
1206.4674 | Stratis Ioannidis | Amin Karbasi (EPFL), Stratis Ioannidis (Technicolor), laurent
Massoulie (Technicolor) | Comparison-Based Learning with Rank Nets | ICML2012 | null | null | null | cs.LG cs.DS stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of search through comparisons, where a user is
presented with two candidate objects and reveals which is closer to her
intended target. We study adaptive strategies for finding the target, that
require knowledge of rank relationships but not actual distances between
objects. We propose a new s... | [
{
"version": "v1",
"created": "Mon, 18 Jun 2012 15:36:16 GMT"
}
] | 2012-06-22T00:00:00 | [
[
"Karbasi",
"Amin",
"",
"EPFL"
],
[
"Ioannidis",
"Stratis",
"",
"Technicolor"
],
[
"Massoulie",
"laurent",
"",
"Technicolor"
]
] | TITLE: Comparison-Based Learning with Rank Nets
ABSTRACT: We consider the problem of search through comparisons, where a user is
presented with two candidate objects and reveals which is closer to her
intended target. We study adaptive strategies for finding the target, that
require knowledge of rank relationships ... |
1206.4676 | Zhirong Yang | Zhirong Yang (Aalto University), Erkki Oja (Aalto University) | Clustering by Low-Rank Doubly Stochastic Matrix Decomposition | ICML2012 | null | null | null | cs.LG cs.CV cs.NA stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Clustering analysis by nonnegative low-rank approximations has achieved
remarkable progress in the past decade. However, most approximation approaches
in this direction are still restricted to matrix factorization. We propose a
new low-rank learning method to improve the clustering performance, which is
beyond matrix... | [
{
"version": "v1",
"created": "Mon, 18 Jun 2012 15:36:49 GMT"
}
] | 2012-06-22T00:00:00 | [
[
"Yang",
"Zhirong",
"",
"Aalto University"
],
[
"Oja",
"Erkki",
"",
"Aalto University"
]
] | TITLE: Clustering by Low-Rank Doubly Stochastic Matrix Decomposition
ABSTRACT: Clustering analysis by nonnegative low-rank approximations has achieved
remarkable progress in the past decade. However, most approximation approaches
in this direction are still restricted to matrix factorization. We propose a
new low-r... |
1206.4677 | Marthinus Du Plessis | Marthinus Du Plessis (Tokyo Institute of Technology), Masashi Sugiyama
(Tokyo Institute of Technology) | Semi-Supervised Learning of Class Balance under Class-Prior Change by
Distribution Matching | ICML2012 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In real-world classification problems, the class balance in the training
dataset does not necessarily reflect that of the test dataset, which can cause
significant estimation bias. If the class ratio of the test dataset is known,
instance re-weighting or resampling allows systematical bias correction.
However, learni... | [
{
"version": "v1",
"created": "Mon, 18 Jun 2012 15:37:07 GMT"
}
] | 2012-06-22T00:00:00 | [
[
"Plessis",
"Marthinus Du",
"",
"Tokyo Institute of Technology"
],
[
"Sugiyama",
"Masashi",
"",
"Tokyo Institute of Technology"
]
] | TITLE: Semi-Supervised Learning of Class Balance under Class-Prior Change by
Distribution Matching
ABSTRACT: In real-world classification problems, the class balance in the training
dataset does not necessarily reflect that of the test dataset, which can cause
significant estimation bias. If the class ratio of th... |
1206.4680 | Mikhail Bilenko | Hoyt Koepke (University of Washington), Mikhail Bilenko (Microsoft
Research) | Fast Prediction of New Feature Utility | ICML2012 | null | null | null | cs.LG math.ST stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the new feature utility prediction problem: statistically testing
whether adding a new feature to the data representation can improve predictive
accuracy on a supervised learning task. In many applications, identifying new
informative features is the primary pathway for improving performance. However,
evalua... | [
{
"version": "v1",
"created": "Mon, 18 Jun 2012 15:38:18 GMT"
}
] | 2012-06-22T00:00:00 | [
[
"Koepke",
"Hoyt",
"",
"University of Washington"
],
[
"Bilenko",
"Mikhail",
"",
"Microsoft\n Research"
]
] | TITLE: Fast Prediction of New Feature Utility
ABSTRACT: We study the new feature utility prediction problem: statistically testing
whether adding a new feature to the data representation can improve predictive
accuracy on a supervised learning task. In many applications, identifying new
informative features is the ... |
1206.4684 | Sanjay Purushotham | Sanjay Purushotham (Univ. of Southern California), Yan Liu (Univ. of
Southern California), C.-C. Jay Kuo (Univ. of Southern California) | Collaborative Topic Regression with Social Matrix Factorization for
Recommendation Systems | ICML2012 | null | null | null | cs.IR cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Social network websites, such as Facebook, YouTube, Lastfm etc, have become a
popular platform for users to connect with each other and share content or
opinions. They provide rich information for us to study the influence of user's
social circle in their decision process. In this paper, we are interested in
examinin... | [
{
"version": "v1",
"created": "Mon, 18 Jun 2012 15:41:06 GMT"
}
] | 2012-06-22T00:00:00 | [
[
"Purushotham",
"Sanjay",
"",
"Univ. of Southern California"
],
[
"Liu",
"Yan",
"",
"Univ. of\n Southern California"
],
[
"Kuo",
"C. -C. Jay",
"",
"Univ. of Southern California"
]
] | TITLE: Collaborative Topic Regression with Social Matrix Factorization for
Recommendation Systems
ABSTRACT: Social network websites, such as Facebook, YouTube, Lastfm etc, have become a
popular platform for users to connect with each other and share content or
opinions. They provide rich information for us to stu... |
1206.4685 | Yan Liu | Yan Liu (USC), Taha Bahadori (USC), Hongfei Li (IBM T.J. Watson
Research Center) | Sparse-GEV: Sparse Latent Space Model for Multivariate Extreme Value
Time Serie Modeling | ICML2012 | null | null | null | stat.ME cs.LG stat.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In many applications of time series models, such as climate analysis and
social media analysis, we are often interested in extreme events, such as
heatwave, wind gust, and burst of topics. These time series data usually
exhibit a heavy-tailed distribution rather than a Gaussian distribution. This
poses great challeng... | [
{
"version": "v1",
"created": "Mon, 18 Jun 2012 15:42:15 GMT"
}
] | 2012-06-22T00:00:00 | [
[
"Liu",
"Yan",
"",
"USC"
],
[
"Bahadori",
"Taha",
"",
"USC"
],
[
"Li",
"Hongfei",
"",
"IBM T.J. Watson\n Research Center"
]
] | TITLE: Sparse-GEV: Sparse Latent Space Model for Multivariate Extreme Value
Time Serie Modeling
ABSTRACT: In many applications of time series models, such as climate analysis and
social media analysis, we are often interested in extreme events, such as
heatwave, wind gust, and burst of topics. These time series d... |
1206.4952 | Nesreen Ahmed | Nesreen K. Ahmed, Jennifer Neville, Ramana Kompella | Space-Efficient Sampling from Social Activity Streams | BigMine 2012 | null | null | null | cs.SI cs.DB physics.soc-ph stat.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In order to efficiently study the characteristics of network domains and
support development of network systems (e.g. algorithms, protocols that operate
on networks), it is often necessary to sample a representative subgraph from a
large complex network. Although recent subgraph sampling methods have been
shown to wo... | [
{
"version": "v1",
"created": "Wed, 20 Jun 2012 04:55:20 GMT"
}
] | 2012-06-22T00:00:00 | [
[
"Ahmed",
"Nesreen K.",
""
],
[
"Neville",
"Jennifer",
""
],
[
"Kompella",
"Ramana",
""
]
] | TITLE: Space-Efficient Sampling from Social Activity Streams
ABSTRACT: In order to efficiently study the characteristics of network domains and
support development of network systems (e.g. algorithms, protocols that operate
on networks), it is often necessary to sample a representative subgraph from a
large complex... |
1206.4110 | Duc Son Pham | Truyen T. Tran and Duc Son Pham | ConeRANK: Ranking as Learning Generalized Inequalities | null | null | null | null | cs.LG cs.IR | http://creativecommons.org/licenses/by/3.0/ | We propose a new data mining approach in ranking documents based on the
concept of cone-based generalized inequalities between vectors. A partial
ordering between two vectors is made with respect to a proper cone and thus
learning the preferences is formulated as learning proper cones. A pairwise
learning-to-rank alg... | [
{
"version": "v1",
"created": "Tue, 19 Jun 2012 02:24:55 GMT"
}
] | 2012-06-21T00:00:00 | [
[
"Tran",
"Truyen T.",
""
],
[
"Pham",
"Duc Son",
""
]
] | TITLE: ConeRANK: Ranking as Learning Generalized Inequalities
ABSTRACT: We propose a new data mining approach in ranking documents based on the
concept of cone-based generalized inequalities between vectors. A partial
ordering between two vectors is made with respect to a proper cone and thus
learning the preferenc... |
1206.4329 | Sudarshan Nandy | Sudarshan Nandy, Partha Pratim Sarkar and Achintya Das | An Improved Gauss-Newtons Method based Back-propagation Algorithm for
Fast Convergence | 7 pages, 6 figures,2 tables, Published with International Journal of
Computer Applications (IJCA) | International Journal of Computer Applications 39(8):1-7, February
2012. Published by Foundation of Computer Science, New York, USA | 10.5120/4837-7097 | null | cs.AI cs.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The present work deals with an improved back-propagation algorithm based on
Gauss-Newton numerical optimization method for fast convergence. The steepest
descent method is used for the back-propagation. The algorithm is tested using
various datasets and compared with the steepest descent back-propagation
algorithm. I... | [
{
"version": "v1",
"created": "Tue, 19 Jun 2012 20:20:56 GMT"
}
] | 2012-06-21T00:00:00 | [
[
"Nandy",
"Sudarshan",
""
],
[
"Sarkar",
"Partha Pratim",
""
],
[
"Das",
"Achintya",
""
]
] | TITLE: An Improved Gauss-Newtons Method based Back-propagation Algorithm for
Fast Convergence
ABSTRACT: The present work deals with an improved back-propagation algorithm based on
Gauss-Newton numerical optimization method for fast convergence. The steepest
descent method is used for the back-propagation. The alg... |
1206.4116 | Makoto Yamada | Makoto Yamada, Leonid Sigal, Michalis Raptis, Masashi Sugiyama | Dependence Maximizing Temporal Alignment via Squared-Loss Mutual
Information | 11 pages | null | null | null | stat.ML cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The goal of temporal alignment is to establish time correspondence between
two sequences, which has many applications in a variety of areas such as speech
processing, bioinformatics, computer vision, and computer graphics. In this
paper, we propose a novel temporal alignment method called least-squares
dynamic time w... | [
{
"version": "v1",
"created": "Tue, 19 Jun 2012 03:35:52 GMT"
}
] | 2012-06-20T00:00:00 | [
[
"Yamada",
"Makoto",
""
],
[
"Sigal",
"Leonid",
""
],
[
"Raptis",
"Michalis",
""
],
[
"Sugiyama",
"Masashi",
""
]
] | TITLE: Dependence Maximizing Temporal Alignment via Squared-Loss Mutual
Information
ABSTRACT: The goal of temporal alignment is to establish time correspondence between
two sequences, which has many applications in a variety of areas such as speech
processing, bioinformatics, computer vision, and computer graphic... |
1205.4378 | Yu Zheng | Yin Zhu, Yu Zheng, Liuhang Zhang, Darshan Santani, Xing Xie, Qiang
Yang | Inferring Taxi Status Using GPS Trajectories | null | null | null | null | cs.AI cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we infer the statuses of a taxi, consisting of occupied,
non-occupied and parked, in terms of its GPS trajectory. The status information
can enable urban computing for improving a city's transportation systems and
land use planning. In our solution, we first identify and extract a set of
effective feat... | [
{
"version": "v1",
"created": "Sun, 20 May 2012 03:24:25 GMT"
},
{
"version": "v2",
"created": "Mon, 18 Jun 2012 08:15:27 GMT"
}
] | 2012-06-19T00:00:00 | [
[
"Zhu",
"Yin",
""
],
[
"Zheng",
"Yu",
""
],
[
"Zhang",
"Liuhang",
""
],
[
"Santani",
"Darshan",
""
],
[
"Xie",
"Xing",
""
],
[
"Yang",
"Qiang",
""
]
] | TITLE: Inferring Taxi Status Using GPS Trajectories
ABSTRACT: In this paper, we infer the statuses of a taxi, consisting of occupied,
non-occupied and parked, in terms of its GPS trajectory. The status information
can enable urban computing for improving a city's transportation systems and
land use planning. In our... |
1206.3717 | Qingji Zheng | Qingji Zheng and Xinwen Zhang | Multiparty Cloud Computation | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the increasing popularity of the cloud, clients oursource their data to
clouds in order to take advantage of unlimited virtualized storage space and
the low management cost. Such trend prompts the privately oursourcing
computation, called \emph{multiparty cloud computation} (\MCC): Given $k$
clients storing thei... | [
{
"version": "v1",
"created": "Sun, 17 Jun 2012 02:33:22 GMT"
}
] | 2012-06-19T00:00:00 | [
[
"Zheng",
"Qingji",
""
],
[
"Zhang",
"Xinwen",
""
]
] | TITLE: Multiparty Cloud Computation
ABSTRACT: With the increasing popularity of the cloud, clients oursource their data to
clouds in order to take advantage of unlimited virtualized storage space and
the low management cost. Such trend prompts the privately oursourcing
computation, called \emph{multiparty cloud com... |
1206.3881 | Alessandro Rozza | Claudio Ceruti and Simone Bassis and Alessandro Rozza and Gabriele
Lombardi and Elena Casiraghi and Paola Campadelli | DANCo: Dimensionality from Angle and Norm Concentration | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the last decades the estimation of the intrinsic dimensionality of a
dataset has gained considerable importance. Despite the great deal of research
work devoted to this task, most of the proposed solutions prove to be
unreliable when the intrinsic dimensionality of the input dataset is high and
the manifold where ... | [
{
"version": "v1",
"created": "Mon, 18 Jun 2012 10:33:29 GMT"
}
] | 2012-06-19T00:00:00 | [
[
"Ceruti",
"Claudio",
""
],
[
"Bassis",
"Simone",
""
],
[
"Rozza",
"Alessandro",
""
],
[
"Lombardi",
"Gabriele",
""
],
[
"Casiraghi",
"Elena",
""
],
[
"Campadelli",
"Paola",
""
]
] | TITLE: DANCo: Dimensionality from Angle and Norm Concentration
ABSTRACT: In the last decades the estimation of the intrinsic dimensionality of a
dataset has gained considerable importance. Despite the great deal of research
work devoted to this task, most of the proposed solutions prove to be
unreliable when the in... |
1206.3204 | Pranjal Awasthi | Pranjal Awasthi, Or Sheffet | Improved Spectral-Norm Bounds for Clustering | null | null | null | null | cs.LG cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Aiming to unify known results about clustering mixtures of distributions
under separation conditions, Kumar and Kannan[2010] introduced a deterministic
condition for clustering datasets. They showed that this single deterministic
condition encompasses many previously studied clustering assumptions. More
specifically,... | [
{
"version": "v1",
"created": "Thu, 14 Jun 2012 18:23:46 GMT"
},
{
"version": "v2",
"created": "Fri, 15 Jun 2012 18:11:27 GMT"
}
] | 2012-06-18T00:00:00 | [
[
"Awasthi",
"Pranjal",
""
],
[
"Sheffet",
"Or",
""
]
] | TITLE: Improved Spectral-Norm Bounds for Clustering
ABSTRACT: Aiming to unify known results about clustering mixtures of distributions
under separation conditions, Kumar and Kannan[2010] introduced a deterministic
condition for clustering datasets. They showed that this single deterministic
condition encompasses ma... |
1206.3236 | Vincent Auvray | Vincent Auvray, Louis Wehenkel | Learning Inclusion-Optimal Chordal Graphs | Appears in Proceedings of the Twenty-Fourth Conference on Uncertainty
in Artificial Intelligence (UAI2008) | null | null | UAI-P-2008-PG-18-25 | cs.LG cs.DS stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Chordal graphs can be used to encode dependency models that are representable
by both directed acyclic and undirected graphs. This paper discusses a very
simple and efficient algorithm to learn the chordal structure of a
probabilistic model from data. The algorithm is a greedy hill-climbing search
algorithm that uses... | [
{
"version": "v1",
"created": "Wed, 13 Jun 2012 14:17:24 GMT"
}
] | 2012-06-18T00:00:00 | [
[
"Auvray",
"Vincent",
""
],
[
"Wehenkel",
"Louis",
""
]
] | TITLE: Learning Inclusion-Optimal Chordal Graphs
ABSTRACT: Chordal graphs can be used to encode dependency models that are representable
by both directed acyclic and undirected graphs. This paper discusses a very
simple and efficient algorithm to learn the chordal structure of a
probabilistic model from data. The a... |
1206.3238 | Liefeng Bo | Liefeng Bo, Cristian Sminchisescu | Greedy Block Coordinate Descent for Large Scale Gaussian Process
Regression | Appears in Proceedings of the Twenty-Fourth Conference on Uncertainty
in Artificial Intelligence (UAI2008) | null | null | UAI-P-2008-PG-43-52 | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a variable decomposition algorithm -greedy block coordinate
descent (GBCD)- in order to make dense Gaussian process regression practical
for large scale problems. GBCD breaks a large scale optimization into a series
of small sub-problems. The challenge in variable decomposition algorithms is
the identifica... | [
{
"version": "v1",
"created": "Wed, 13 Jun 2012 14:18:22 GMT"
}
] | 2012-06-18T00:00:00 | [
[
"Bo",
"Liefeng",
""
],
[
"Sminchisescu",
"Cristian",
""
]
] | TITLE: Greedy Block Coordinate Descent for Large Scale Gaussian Process
Regression
ABSTRACT: We propose a variable decomposition algorithm -greedy block coordinate
descent (GBCD)- in order to make dense Gaussian process regression practical
for large scale problems. GBCD breaks a large scale optimization into a s... |
1206.3244 | James Cussens | James Cussens | Bayesian network learning by compiling to weighted MAX-SAT | Appears in Proceedings of the Twenty-Fourth Conference on Uncertainty
in Artificial Intelligence (UAI2008) | null | null | UAI-P-2008-PG-105-112 | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The problem of learning discrete Bayesian networks from data is encoded as a
weighted MAX-SAT problem and the MaxWalkSat local search algorithm is used to
address it. For each dataset, the per-variable summands of the (BDeu) marginal
likelihood for different choices of parents ('family scores') are computed
prior to ... | [
{
"version": "v1",
"created": "Wed, 13 Jun 2012 15:06:22 GMT"
}
] | 2012-06-18T00:00:00 | [
[
"Cussens",
"James",
""
]
] | TITLE: Bayesian network learning by compiling to weighted MAX-SAT
ABSTRACT: The problem of learning discrete Bayesian networks from data is encoded as a
weighted MAX-SAT problem and the MaxWalkSat local search algorithm is used to
address it. For each dataset, the per-variable summands of the (BDeu) marginal
likeli... |
1206.3259 | Jim Huang | Jim Huang, Brendan J. Frey | Cumulative distribution networks and the derivative-sum-product
algorithm | Appears in Proceedings of the Twenty-Fourth Conference on Uncertainty
in Artificial Intelligence (UAI2008) | null | null | UAI-P-2008-PG-290-297 | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a new type of graphical model called a "cumulative distribution
network" (CDN), which expresses a joint cumulative distribution as a product of
local functions. Each local function can be viewed as providing evidence about
possible orderings, or rankings, of variables. Interestingly, we find that the
con... | [
{
"version": "v1",
"created": "Wed, 13 Jun 2012 15:33:06 GMT"
}
] | 2012-06-18T00:00:00 | [
[
"Huang",
"Jim",
""
],
[
"Frey",
"Brendan J.",
""
]
] | TITLE: Cumulative distribution networks and the derivative-sum-product
algorithm
ABSTRACT: We introduce a new type of graphical model called a "cumulative distribution
network" (CDN), which expresses a joint cumulative distribution as a product of
local functions. Each local function can be viewed as providing ev... |
1206.3269 | Tony S. Jebara | Tony S. Jebara | Bayesian Out-Trees | Appears in Proceedings of the Twenty-Fourth Conference on Uncertainty
in Artificial Intelligence (UAI2008) | null | null | UAI-P-2008-PG-315-324 | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A Bayesian treatment of latent directed graph structure for non-iid data is
provided where each child datum is sampled with a directed conditional
dependence on a single unknown parent datum. The latent graph structure is
assumed to lie in the family of directed out-tree graphs which leads to
efficient Bayesian infer... | [
{
"version": "v1",
"created": "Wed, 13 Jun 2012 15:37:30 GMT"
}
] | 2012-06-18T00:00:00 | [
[
"Jebara",
"Tony S.",
""
]
] | TITLE: Bayesian Out-Trees
ABSTRACT: A Bayesian treatment of latent directed graph structure for non-iid data is
provided where each child datum is sampled with a directed conditional
dependence on a single unknown parent datum. The latent graph structure is
assumed to lie in the family of directed out-tree graphs w... |
1206.3320 | Zi-Ke Zhang Mr. | Jinhu Liu, Chengcheng Yang, Zi-Ke Zhang | A two-step Recommendation Algorithm via Iterative Local Least Squares | null | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recommender systems can change our life a lot and help us select suitable and
favorite items much more conveniently and easily. As a consequence, various
kinds of algorithms have been proposed in last few years to improve the
performance. However, all of them face one critical problem: data sparsity. In
this paper, w... | [
{
"version": "v1",
"created": "Thu, 14 Jun 2012 20:23:24 GMT"
}
] | 2012-06-18T00:00:00 | [
[
"Liu",
"Jinhu",
""
],
[
"Yang",
"Chengcheng",
""
],
[
"Zhang",
"Zi-Ke",
""
]
] | TITLE: A two-step Recommendation Algorithm via Iterative Local Least Squares
ABSTRACT: Recommender systems can change our life a lot and help us select suitable and
favorite items much more conveniently and easily. As a consequence, various
kinds of algorithms have been proposed in last few years to improve the
per... |
1206.3334 | Pranjal Awasthi | Pranjal Awasthi, Avrim Blum, Jamie Morgenstern, Or Sheffet | Additive Approximation for Near-Perfect Phylogeny Construction | null | null | null | null | cs.DS cs.CE q-bio.PE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the problem of constructing phylogenetic trees for a given set of
species. The problem is formulated as that of finding a minimum Steiner tree on
$n$ points over the Boolean hypercube of dimension $d$. It is known that an
optimal tree can be found in linear time if the given dataset has a perfect
phylogeny, ... | [
{
"version": "v1",
"created": "Thu, 14 Jun 2012 21:38:01 GMT"
}
] | 2012-06-18T00:00:00 | [
[
"Awasthi",
"Pranjal",
""
],
[
"Blum",
"Avrim",
""
],
[
"Morgenstern",
"Jamie",
""
],
[
"Sheffet",
"Or",
""
]
] | TITLE: Additive Approximation for Near-Perfect Phylogeny Construction
ABSTRACT: We study the problem of constructing phylogenetic trees for a given set of
species. The problem is formulated as that of finding a minimum Steiner tree on
$n$ points over the Boolean hypercube of dimension $d$. It is known that an
optim... |
1206.3055 | {\O}yvind Breivik PhD | {\O}yvind Breivik, Yvonne Gusdal, Birgitte R. Furevik, Ole Johan
Aarnes and Magnar Reistad | Nearshore wave forecasting and hindcasting by dynamical and statistical
downscaling | 20 pages, 7 figures and 2 tables, MREA07 special issue on Marine
rapid environmental assessment | J Marine Syst, 78 (2009) pp S235-S243 | 10.1016/j.jmarsys.2009.01.025 | null | physics.ao-ph physics.geo-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A high-resolution nested WAM/SWAN wave model suite aimed at rapidly
establishing nearshore wave forecasts as well as a climatology and return
values of the local wave conditions with Rapid Enviromental Assessment (REA) in
mind is described. The system is targeted at regions where local wave growth
and partial exposur... | [
{
"version": "v1",
"created": "Thu, 14 Jun 2012 09:45:51 GMT"
}
] | 2012-06-15T00:00:00 | [
[
"Breivik",
"Øyvind",
""
],
[
"Gusdal",
"Yvonne",
""
],
[
"Furevik",
"Birgitte R.",
""
],
[
"Aarnes",
"Ole Johan",
""
],
[
"Reistad",
"Magnar",
""
]
] | TITLE: Nearshore wave forecasting and hindcasting by dynamical and statistical
downscaling
ABSTRACT: A high-resolution nested WAM/SWAN wave model suite aimed at rapidly
establishing nearshore wave forecasts as well as a climatology and return
values of the local wave conditions with Rapid Enviromental Assessment ... |
1206.1891 | Donghyuk Shin | Donghyuk Shin, Si Si, Inderjit S. Dhillon | Multi-Scale Link Prediction | 20 pages, 10 figures | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The automated analysis of social networks has become an important problem due
to the proliferation of social networks, such as LiveJournal, Flickr and
Facebook. The scale of these social networks is massive and continues to grow
rapidly. An important problem in social network analysis is proximity
estimation that inf... | [
{
"version": "v1",
"created": "Fri, 8 Jun 2012 23:49:13 GMT"
}
] | 2012-06-12T00:00:00 | [
[
"Shin",
"Donghyuk",
""
],
[
"Si",
"Si",
""
],
[
"Dhillon",
"Inderjit S.",
""
]
] | TITLE: Multi-Scale Link Prediction
ABSTRACT: The automated analysis of social networks has become an important problem due
to the proliferation of social networks, such as LiveJournal, Flickr and
Facebook. The scale of these social networks is massive and continues to grow
rapidly. An important problem in social ne... |
1206.2320 | YenFu Ou | Yen-Fu Ou, Yuanyi Xue, Yao Wang | Q-STAR:A Perceptual Video Quality Model Considering Impact of Spatial,
Temporal, and Amplitude Resolutions | 13 pages | null | null | null | cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we investigate the impact of spatial, temporal and amplitude
resolution (STAR) on the perceptual quality of a compressed video. Subjective
quality tests were carried out on a mobile device. Seven source sequences are
included in the tests and for each source sequence we have 27 test
configurations gene... | [
{
"version": "v1",
"created": "Mon, 11 Jun 2012 19:06:07 GMT"
}
] | 2012-06-12T00:00:00 | [
[
"Ou",
"Yen-Fu",
""
],
[
"Xue",
"Yuanyi",
""
],
[
"Wang",
"Yao",
""
]
] | TITLE: Q-STAR:A Perceptual Video Quality Model Considering Impact of Spatial,
Temporal, and Amplitude Resolutions
ABSTRACT: In this paper, we investigate the impact of spatial, temporal and amplitude
resolution (STAR) on the perceptual quality of a compressed video. Subjective
quality tests were carried out on a ... |
1202.0224 | James Bagrow | James P. Bagrow and Yu-Ru Lin | Mesoscopic structure and social aspects of human mobility | 7 pages, 5 figures (main text); 11 pages, 9 figures, 1 table
(supporting information) | PLoS ONE 7(5): e37676, 2012 | 10.1371/journal.pone.0037676 | null | physics.soc-ph cond-mat.stat-mech cs.SI physics.data-an | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The individual movements of large numbers of people are important in many
contexts, from urban planning to disease spreading. Datasets that capture human
mobility are now available and many interesting features have been discovered,
including the ultra-slow spatial growth of individual mobility. However, the
detailed... | [
{
"version": "v1",
"created": "Wed, 1 Feb 2012 17:18:02 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Jun 2012 20:00:04 GMT"
}
] | 2012-06-11T00:00:00 | [
[
"Bagrow",
"James P.",
""
],
[
"Lin",
"Yu-Ru",
""
]
] | TITLE: Mesoscopic structure and social aspects of human mobility
ABSTRACT: The individual movements of large numbers of people are important in many
contexts, from urban planning to disease spreading. Datasets that capture human
mobility are now available and many interesting features have been discovered,
includin... |
1206.1458 | Shervan Fekri ershad | Shervan Fekri Ershad and Sattar Hashemi | Dispelling Classes Gradually to Improve Quality of Feature Reduction
Approaches | 11 Pages, 5 Figure, 7 Tables; Advanced Computing: An International
Journal (ACIJ), Vol.3, No.3, May 2012 | null | 10.5121/acij.2012.3310 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Feature reduction is an important concept which is used for reducing
dimensions to decrease the computation complexity and time of classification.
Since now many approaches have been proposed for solving this problem, but
almost all of them just presented a fix output for each input dataset that some
of them aren't s... | [
{
"version": "v1",
"created": "Thu, 7 Jun 2012 11:52:21 GMT"
}
] | 2012-06-08T00:00:00 | [
[
"Ershad",
"Shervan Fekri",
""
],
[
"Hashemi",
"Sattar",
""
]
] | TITLE: Dispelling Classes Gradually to Improve Quality of Feature Reduction
Approaches
ABSTRACT: Feature reduction is an important concept which is used for reducing
dimensions to decrease the computation complexity and time of classification.
Since now many approaches have been proposed for solving this problem,... |
1206.1557 | Jay Gholap | Jay Gholap, Anurag Ingole, Jayesh Gohil, Shailesh Gargade and Vahida
Attar | Soil Data Analysis Using Classification Techniques and Soil Attribute
Prediction | 4 pages, published in International Journal of Computer Science
Issues, Volume 9, Issue 3 | null | null | null | cs.AI stat.AP stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Agricultural research has been profited by technical advances such as
automation, data mining. Today, data mining is used in a vast areas and many
off-the-shelf data mining system products and domain specific data mining
application soft wares are available, but data mining in agricultural soil
datasets is a relative... | [
{
"version": "v1",
"created": "Thu, 7 Jun 2012 17:28:20 GMT"
}
] | 2012-06-08T00:00:00 | [
[
"Gholap",
"Jay",
""
],
[
"Ingole",
"Anurag",
""
],
[
"Gohil",
"Jayesh",
""
],
[
"Gargade",
"Shailesh",
""
],
[
"Attar",
"Vahida",
""
]
] | TITLE: Soil Data Analysis Using Classification Techniques and Soil Attribute
Prediction
ABSTRACT: Agricultural research has been profited by technical advances such as
automation, data mining. Today, data mining is used in a vast areas and many
off-the-shelf data mining system products and domain specific data mi... |
1109.1396 | R\'obert Orm\'andi | R\'obert Orm\'andi, Istv\'an Heged\"us, M\'ark Jelasity | Gossip Learning with Linear Models on Fully Distributed Data | The paper was published in the journal Concurrency and Computation:
Practice and Experience
http://onlinelibrary.wiley.com/journal/10.1002/%28ISSN%291532-0634 (DOI:
http://dx.doi.org/10.1002/cpe.2858). The modifications are based on the
suggestions from the reviewers | null | 10.1002/cpe.2858 | null | cs.LG cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Machine learning over fully distributed data poses an important problem in
peer-to-peer (P2P) applications. In this model we have one data record at each
network node, but without the possibility to move raw data due to privacy
considerations. For example, user profiles, ratings, history, or sensor
readings can repre... | [
{
"version": "v1",
"created": "Wed, 7 Sep 2011 09:16:37 GMT"
},
{
"version": "v2",
"created": "Tue, 5 Jun 2012 09:55:07 GMT"
},
{
"version": "v3",
"created": "Wed, 6 Jun 2012 09:26:30 GMT"
}
] | 2012-06-07T00:00:00 | [
[
"Ormándi",
"Róbert",
""
],
[
"Hegedüs",
"István",
""
],
[
"Jelasity",
"Márk",
""
]
] | TITLE: Gossip Learning with Linear Models on Fully Distributed Data
ABSTRACT: Machine learning over fully distributed data poses an important problem in
peer-to-peer (P2P) applications. In this model we have one data record at each
network node, but without the possibility to move raw data due to privacy
considerat... |
1206.1134 | Rachit Agarwal | Rachit Agarwal, Matthew Caesar, P. Brighten Godfrey, Ben Y. Zhao | Shortest Paths in Less Than a Millisecond | 6 pages; to appear in SIGCOMM WOSN 2012 | null | null | null | cs.SI cs.DB physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of answering point-to-point shortest path queries on
massive social networks. The goal is to answer queries within tens of
milliseconds while minimizing the memory requirements. We present a technique
that achieves this goal for an extremely large fraction of path queries by
exploiting the str... | [
{
"version": "v1",
"created": "Wed, 6 Jun 2012 07:13:37 GMT"
}
] | 2012-06-07T00:00:00 | [
[
"Agarwal",
"Rachit",
""
],
[
"Caesar",
"Matthew",
""
],
[
"Godfrey",
"P. Brighten",
""
],
[
"Zhao",
"Ben Y.",
""
]
] | TITLE: Shortest Paths in Less Than a Millisecond
ABSTRACT: We consider the problem of answering point-to-point shortest path queries on
massive social networks. The goal is to answer queries within tens of
milliseconds while minimizing the memory requirements. We present a technique
that achieves this goal for an e... |
1206.0335 | Nima Hatami | Nima Hatami, Camelia Chira and Giuliano Armano | A Route Confidence Evaluation Method for Reliable Hierarchical Text
Categorization | null | null | null | null | cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Hierarchical Text Categorization (HTC) is becoming increasingly important
with the rapidly growing amount of text data available in the World Wide Web.
Among the different strategies proposed to cope with HTC, the Local Classifier
per Node (LCN) approach attains good performance by mirroring the underlying
class hier... | [
{
"version": "v1",
"created": "Sat, 2 Jun 2012 01:37:22 GMT"
}
] | 2012-06-05T00:00:00 | [
[
"Hatami",
"Nima",
""
],
[
"Chira",
"Camelia",
""
],
[
"Armano",
"Giuliano",
""
]
] | TITLE: A Route Confidence Evaluation Method for Reliable Hierarchical Text
Categorization
ABSTRACT: Hierarchical Text Categorization (HTC) is becoming increasingly important
with the rapidly growing amount of text data available in the World Wide Web.
Among the different strategies proposed to cope with HTC, the ... |
1206.0377 | Zoltan Szabo | Balazs Pinter, Gyula Voros, Zoltan Szabo, Andras Lorincz | Automated Word Puzzle Generation via Topic Dictionaries | 4 pages | International Conference on Machine Learning (ICML-2012) -
Sparsity, Dictionaries and Projections in Machine Learning and Signal
Processing Workshop, Edinburgh, Scotland, 30 June 2012 | null | null | cs.CL math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a general method for automated word puzzle generation. Contrary to
previous approaches in this novel field, the presented method does not rely on
highly structured datasets obtained with serious human annotation effort: it
only needs an unstructured and unannotated corpus (i.e., document collection)
as inp... | [
{
"version": "v1",
"created": "Sat, 2 Jun 2012 13:11:17 GMT"
}
] | 2012-06-05T00:00:00 | [
[
"Pinter",
"Balazs",
""
],
[
"Voros",
"Gyula",
""
],
[
"Szabo",
"Zoltan",
""
],
[
"Lorincz",
"Andras",
""
]
] | TITLE: Automated Word Puzzle Generation via Topic Dictionaries
ABSTRACT: We propose a general method for automated word puzzle generation. Contrary to
previous approaches in this novel field, the presented method does not rely on
highly structured datasets obtained with serious human annotation effort: it
only need... |
1205.5159 | Nicolas Dobigeon | Nicolas Dobigeon and Nathalie Brun | Spectral mixture analysis of EELS spectrum-images | Manuscript accepted for publication in Ultramicroscopy | null | null | null | cond-mat.mtrl-sci physics.data-an | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent advances in detectors and computer science have enabled the
acquisition and the processing of multidimensional datasets, in particular in
the field of spectral imaging. Benefiting from these new developments, earth
scientists try to recover the reflectance spectra of macroscopic materials
(e.g., water, grass, ... | [
{
"version": "v1",
"created": "Wed, 23 May 2012 11:56:33 GMT"
},
{
"version": "v2",
"created": "Fri, 1 Jun 2012 12:43:37 GMT"
}
] | 2012-06-04T00:00:00 | [
[
"Dobigeon",
"Nicolas",
""
],
[
"Brun",
"Nathalie",
""
]
] | TITLE: Spectral mixture analysis of EELS spectrum-images
ABSTRACT: Recent advances in detectors and computer science have enabled the
acquisition and the processing of multidimensional datasets, in particular in
the field of spectral imaging. Benefiting from these new developments, earth
scientists try to recover t... |
1205.6523 | Jana Gevertz | Chamont Wang, Jana Gevertz, Chaur-Chin Chen, Leonardo Auslender | Finding Important Genes from High-Dimensional Data: An Appraisal of
Statistical Tests and Machine-Learning Approaches | 36 pages, 9 figures | null | null | null | stat.ML cs.LG q-bio.QM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Over the past decades, statisticians and machine-learning researchers have
developed literally thousands of new tools for the reduction of
high-dimensional data in order to identify the variables most responsible for a
particular trait. These tools have applications in a plethora of settings,
including data analysis ... | [
{
"version": "v1",
"created": "Wed, 30 May 2012 01:23:01 GMT"
}
] | 2012-05-31T00:00:00 | [
[
"Wang",
"Chamont",
""
],
[
"Gevertz",
"Jana",
""
],
[
"Chen",
"Chaur-Chin",
""
],
[
"Auslender",
"Leonardo",
""
]
] | TITLE: Finding Important Genes from High-Dimensional Data: An Appraisal of
Statistical Tests and Machine-Learning Approaches
ABSTRACT: Over the past decades, statisticians and machine-learning researchers have
developed literally thousands of new tools for the reduction of
high-dimensional data in order to identi... |
1205.6605 | Jan Egger | Jan Egger, Bernd Freisleben, Christopher Nimsky, Tina Kapur | Template-Cut: A Pattern-Based Segmentation Paradigm | 8 pages, 6 figures, 3 tables, 6 equations, 51 references | J. Egger, B. Freisleben, C. Nimsky, T. Kapur. Template-Cut: A
Pattern-Based Segmentation Paradigm. Nature - Scientific Reports, Nature
Publishing Group (NPG), 2(420), 2012 | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/3.0/ | We present a scale-invariant, template-based segmentation paradigm that sets
up a graph and performs a graph cut to separate an object from the background.
Typically graph-based schemes distribute the nodes of the graph uniformly and
equidistantly on the image, and use a regularizer to bias the cut towards a
particul... | [
{
"version": "v1",
"created": "Wed, 30 May 2012 09:44:43 GMT"
}
] | 2012-05-31T00:00:00 | [
[
"Egger",
"Jan",
""
],
[
"Freisleben",
"Bernd",
""
],
[
"Nimsky",
"Christopher",
""
],
[
"Kapur",
"Tina",
""
]
] | TITLE: Template-Cut: A Pattern-Based Segmentation Paradigm
ABSTRACT: We present a scale-invariant, template-based segmentation paradigm that sets
up a graph and performs a graph cut to separate an object from the background.
Typically graph-based schemes distribute the nodes of the graph uniformly and
equidistantly... |
1205.6693 | Jia Wang | Jia Wang, James Cheng | Truss Decomposition in Massive Networks | VLDB2012 | Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 9, pp.
812-823 (2012) | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The k-truss is a type of cohesive subgraphs proposed recently for the study
of networks. While the problem of computing most cohesive subgraphs is NP-hard,
there exists a polynomial time algorithm for computing k-truss. Compared with
k-core which is also efficient to compute, k-truss represents the "core" of a
k-core... | [
{
"version": "v1",
"created": "Wed, 30 May 2012 14:32:46 GMT"
}
] | 2012-05-31T00:00:00 | [
[
"Wang",
"Jia",
""
],
[
"Cheng",
"James",
""
]
] | TITLE: Truss Decomposition in Massive Networks
ABSTRACT: The k-truss is a type of cohesive subgraphs proposed recently for the study
of networks. While the problem of computing most cohesive subgraphs is NP-hard,
there exists a polynomial time algorithm for computing k-truss. Compared with
k-core which is also effi... |
1205.6694 | Ju Fan | Ju Fan, Guoliang Li, Lizhu Zhou, Shanshan Chen, Jun Hu | SEAL: Spatio-Textual Similarity Search | VLDB2012 | Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 9, pp.
824-835 (2012) | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Location-based services (LBS) have become more and more ubiquitous recently.
Existing methods focus on finding relevant points-of-interest (POIs) based on
users' locations and query keywords. Nowadays, modern LBS applications generate
a new kind of spatio-textual data, regions-of-interest (ROIs), containing
region-ba... | [
{
"version": "v1",
"created": "Wed, 30 May 2012 14:32:51 GMT"
}
] | 2012-05-31T00:00:00 | [
[
"Fan",
"Ju",
""
],
[
"Li",
"Guoliang",
""
],
[
"Zhou",
"Lizhu",
""
],
[
"Chen",
"Shanshan",
""
],
[
"Hu",
"Jun",
""
]
] | TITLE: SEAL: Spatio-Textual Similarity Search
ABSTRACT: Location-based services (LBS) have become more and more ubiquitous recently.
Existing methods focus on finding relevant points-of-interest (POIs) based on
users' locations and query keywords. Nowadays, modern LBS applications generate
a new kind of spatio-text... |
1205.6695 | Theodoros Lappas | Theodoros Lappas, Marcos R. Vieira, Dimitrios Gunopulos, Vassilis J.
Tsotras | On The Spatiotemporal Burstiness of Terms | VLDB2012 | Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 9, pp.
836-847 (2012) | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Thousands of documents are made available to the users via the web on a daily
basis. One of the most extensively studied problems in the context of such
document streams is burst identification. Given a term t, a burst is generally
exhibited when an unusually high frequency is observed for t. While spatial and
tempor... | [
{
"version": "v1",
"created": "Wed, 30 May 2012 14:32:56 GMT"
}
] | 2012-05-31T00:00:00 | [
[
"Lappas",
"Theodoros",
""
],
[
"Vieira",
"Marcos R.",
""
],
[
"Gunopulos",
"Dimitrios",
""
],
[
"Tsotras",
"Vassilis J.",
""
]
] | TITLE: On The Spatiotemporal Burstiness of Terms
ABSTRACT: Thousands of documents are made available to the users via the web on a daily
basis. One of the most extensively studied problems in the context of such
document streams is burst identification. Given a term t, a burst is generally
exhibited when an unusual... |
1205.6696 | Houtan Shirani-Mehr | Houtan Shirani-Mehr, Farnoush Banaei Kashani, Cyrus Shahabi | Efficient Reachability Query Evaluation in Large Spatiotemporal Contact
Datasets | VLDB2012 | Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 9, pp.
848-859 (2012) | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the advent of reliable positioning technologies and prevalence of
location-based services, it is now feasible to accurately study the propagation
of items such as infectious viruses, sensitive information pieces, and malwares
through a population of moving objects, e.g., individuals, mobile devices, and
vehicles... | [
{
"version": "v1",
"created": "Wed, 30 May 2012 14:33:01 GMT"
}
] | 2012-05-31T00:00:00 | [
[
"Shirani-Mehr",
"Houtan",
""
],
[
"Kashani",
"Farnoush Banaei",
""
],
[
"Shahabi",
"Cyrus",
""
]
] | TITLE: Efficient Reachability Query Evaluation in Large Spatiotemporal Contact
Datasets
ABSTRACT: With the advent of reliable positioning technologies and prevalence of
location-based services, it is now feasible to accurately study the propagation
of items such as infectious viruses, sensitive information pieces... |
1205.6700 | Hongzhi Yin | Hongzhi Yin, Bin Cui, Jing Li, Junjie Yao, Chen Chen | Challenging the Long Tail Recommendation | VLDB2012 | Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 9, pp.
896-907 (2012) | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The success of "infinite-inventory" retailers such as Amazon.com and Netflix
has been largely attributed to a "long tail" phenomenon. Although the majority
of their inventory is not in high demand, these niche products, unavailable at
limited-inventory competitors, generate a significant fraction of total revenue
in ... | [
{
"version": "v1",
"created": "Wed, 30 May 2012 14:33:56 GMT"
}
] | 2012-05-31T00:00:00 | [
[
"Yin",
"Hongzhi",
""
],
[
"Cui",
"Bin",
""
],
[
"Li",
"Jing",
""
],
[
"Yao",
"Junjie",
""
],
[
"Chen",
"Chen",
""
]
] | TITLE: Challenging the Long Tail Recommendation
ABSTRACT: The success of "infinite-inventory" retailers such as Amazon.com and Netflix
has been largely attributed to a "long tail" phenomenon. Although the majority
of their inventory is not in high demand, these niche products, unavailable at
limited-inventory compe... |
1205.6278 | Bosiljka Tadic | Milovan \v{S}uvakov, David Garcia, Frank Schweitzer, Bosiljka Tadi\'c | Agent-based simulations of emotion spreading in online social networks | 21 pages, 13 figures | null | null | IJS-F1 preprint 12/08 | physics.soc-ph cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Quantitative analysis of empirical data from online social networks reveals
group dynamics in which emotions are involved (\v{S}uvakov et al). Full
understanding of the underlying mechanisms, however, remains a challenging
task. Using agent-based computer simulations, in this paper we study dynamics
of emotional comm... | [
{
"version": "v1",
"created": "Tue, 29 May 2012 07:10:15 GMT"
}
] | 2012-05-30T00:00:00 | [
[
"Šuvakov",
"Milovan",
""
],
[
"Garcia",
"David",
""
],
[
"Schweitzer",
"Frank",
""
],
[
"Tadić",
"Bosiljka",
""
]
] | TITLE: Agent-based simulations of emotion spreading in online social networks
ABSTRACT: Quantitative analysis of empirical data from online social networks reveals
group dynamics in which emotions are involved (\v{S}uvakov et al). Full
understanding of the underlying mechanisms, however, remains a challenging
task.... |
1205.6373 | Gerard Burnside | Gerard Burnside, Dohy Hong, Son Nguyen-Kim and Liang Liu | Publication Induced Research Analysis (PIRA) - Experiments on Real Data | null | null | null | null | cs.DL cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper describes the first results obtained by implementing a novel
approach to rank vertices in a heterogeneous graph, based on the PageRank
family of algorithms and applied here to the bipartite graph of papers and
authors as a first evaluation of its relevance on real data samples. With this
approach to evalua... | [
{
"version": "v1",
"created": "Tue, 29 May 2012 14:28:10 GMT"
}
] | 2012-05-30T00:00:00 | [
[
"Burnside",
"Gerard",
""
],
[
"Hong",
"Dohy",
""
],
[
"Nguyen-Kim",
"Son",
""
],
[
"Liu",
"Liang",
""
]
] | TITLE: Publication Induced Research Analysis (PIRA) - Experiments on Real Data
ABSTRACT: This paper describes the first results obtained by implementing a novel
approach to rank vertices in a heterogeneous graph, based on the PageRank
family of algorithms and applied here to the bipartite graph of papers and
author... |
1205.5353 | Ravindra Jain | Ravindra Jain | A hybrid clustering algorithm for data mining | null | null | null | null | cs.DB cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data clustering is a process of arranging similar data into groups. A
clustering algorithm partitions a data set into several groups such that the
similarity within a group is better than among groups. In this paper a hybrid
clustering algorithm based on K-mean and K-harmonic mean (KHM) is described.
The proposed alg... | [
{
"version": "v1",
"created": "Thu, 24 May 2012 07:37:28 GMT"
}
] | 2012-05-25T00:00:00 | [
[
"Jain",
"Ravindra",
""
]
] | TITLE: A hybrid clustering algorithm for data mining
ABSTRACT: Data clustering is a process of arranging similar data into groups. A
clustering algorithm partitions a data set into several groups such that the
similarity within a group is better than among groups. In this paper a hybrid
clustering algorithm based o... |
1205.5024 | A.K. Mishra Dr. | A.K. Mishra and H. Chandrasekharan | Analytical Study of Hexapod miRNAs using Phylogenetic Methods | null | null | null | null | cs.CE q-bio.GN | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | MicroRNAs (miRNAs) are a class of non-coding RNAs that regulate gene
expression. Identification of total number of miRNAs even in completely
sequenced organisms is still an open problem. However, researchers have been
using techniques that can predict limited number of miRNA in an organism. In
this paper, we have use... | [
{
"version": "v1",
"created": "Tue, 22 May 2012 10:28:29 GMT"
}
] | 2012-05-24T00:00:00 | [
[
"Mishra",
"A. K.",
""
],
[
"Chandrasekharan",
"H.",
""
]
] | TITLE: Analytical Study of Hexapod miRNAs using Phylogenetic Methods
ABSTRACT: MicroRNAs (miRNAs) are a class of non-coding RNAs that regulate gene
expression. Identification of total number of miRNAs even in completely
sequenced organisms is still an open problem. However, researchers have been
using techniques th... |
1205.5204 | Bruno Jobard | Bruno Jobard, Nicolas Ray and Dmitry Sokolov | Visualizing 2D Flows with Animated Arrow Plots | null | null | null | null | cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Flow fields are often represented by a set of static arrows to illustrate
scientific vulgarization, documentary film, meteorology, etc. This simple
schematic representation lets an observer intuitively interpret the main
properties of a flow: its orientation and velocity magnitude. We propose to
generate dynamic vers... | [
{
"version": "v1",
"created": "Wed, 23 May 2012 15:29:16 GMT"
}
] | 2012-05-24T00:00:00 | [
[
"Jobard",
"Bruno",
""
],
[
"Ray",
"Nicolas",
""
],
[
"Sokolov",
"Dmitry",
""
]
] | TITLE: Visualizing 2D Flows with Animated Arrow Plots
ABSTRACT: Flow fields are often represented by a set of static arrows to illustrate
scientific vulgarization, documentary film, meteorology, etc. This simple
schematic representation lets an observer intuitively interpret the main
properties of a flow: its orien... |
1205.4546 | Myunghwan Kim | Myunghwan Kim and Jure Leskovec | Latent Multi-group Membership Graph Model | 10 pages, 4 figures, 4 tables | null | null | null | cs.SI physics.soc-ph stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We develop the Latent Multi-group Membership Graph (LMMG) model, a model of
networks with rich node feature structure. In the LMMG model, each node belongs
to multiple groups and each latent group models the occurrence of links as well
as the node feature structure. The LMMG can be used to summarize the network
struc... | [
{
"version": "v1",
"created": "Mon, 21 May 2012 09:56:10 GMT"
}
] | 2012-05-22T00:00:00 | [
[
"Kim",
"Myunghwan",
""
],
[
"Leskovec",
"Jure",
""
]
] | TITLE: Latent Multi-group Membership Graph Model
ABSTRACT: We develop the Latent Multi-group Membership Graph (LMMG) model, a model of
networks with rich node feature structure. In the LMMG model, each node belongs
to multiple groups and each latent group models the occurrence of links as well
as the node feature s... |
1205.4013 | Xiaohan Zhao | Xiaohan Zhao, Alessandra Sala, Christo Wilson, Xiao Wang, Sabrina
Gaito, Haitao Zheng, Ben Y. Zhao | Multi-scale Dynamics in a Massive Online Social Network | null | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data confidentiality policies at major social network providers have severely
limited researchers' access to large-scale datasets. The biggest impact has
been on the study of network dynamics, where researchers have studied citation
graphs and content-sharing networks, but few have analyzed detailed dynamics in
the m... | [
{
"version": "v1",
"created": "Thu, 17 May 2012 19:21:56 GMT"
}
] | 2012-05-18T00:00:00 | [
[
"Zhao",
"Xiaohan",
""
],
[
"Sala",
"Alessandra",
""
],
[
"Wilson",
"Christo",
""
],
[
"Wang",
"Xiao",
""
],
[
"Gaito",
"Sabrina",
""
],
[
"Zheng",
"Haitao",
""
],
[
"Zhao",
"Ben Y.",
""
]
] | TITLE: Multi-scale Dynamics in a Massive Online Social Network
ABSTRACT: Data confidentiality policies at major social network providers have severely
limited researchers' access to large-scale datasets. The biggest impact has
been on the study of network dynamics, where researchers have studied citation
graphs and... |
1010.2198 | Akram Aldroubi | Akram Aldroubi and Ali Sekmen | Nearness to Local Subspace Algorithm for Subspace and Motion
Segmentation | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There is a growing interest in computer science, engineering, and mathematics
for modeling signals in terms of union of subspaces and manifolds. Subspace
segmentation and clustering of high dimensional data drawn from a union of
subspaces are especially important with many practical applications in computer
vision, i... | [
{
"version": "v1",
"created": "Mon, 11 Oct 2010 19:47:41 GMT"
},
{
"version": "v2",
"created": "Mon, 14 May 2012 22:57:33 GMT"
}
] | 2012-05-16T00:00:00 | [
[
"Aldroubi",
"Akram",
""
],
[
"Sekmen",
"Ali",
""
]
] | TITLE: Nearness to Local Subspace Algorithm for Subspace and Motion
Segmentation
ABSTRACT: There is a growing interest in computer science, engineering, and mathematics
for modeling signals in terms of union of subspaces and manifolds. Subspace
segmentation and clustering of high dimensional data drawn from a uni... |
1205.3441 | Romain Giot | Romain Giot (GREYC), Christophe Rosenberger (GREYC) | Genetic Programming for Multibiometrics | null | Expert Systems with Applications 39, 2 1837-1847 (2012) | 10.1016/j.eswa.2011.08.066 | null | cs.NE cs.CR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Biometric systems suffer from some drawbacks: a biometric system can provide
in general good performances except with some individuals as its performance
depends highly on the quality of the capture. One solution to solve some of
these problems is to use multibiometrics where different biometric systems are
combined ... | [
{
"version": "v1",
"created": "Mon, 20 Feb 2012 10:25:16 GMT"
}
] | 2012-05-16T00:00:00 | [
[
"Giot",
"Romain",
"",
"GREYC"
],
[
"Rosenberger",
"Christophe",
"",
"GREYC"
]
] | TITLE: Genetic Programming for Multibiometrics
ABSTRACT: Biometric systems suffer from some drawbacks: a biometric system can provide
in general good performances except with some individuals as its performance
depends highly on the quality of the capture. One solution to solve some of
these problems is to use mult... |
1205.2726 | David Leoni | David Leoni | Non-Interactive Differential Privacy: a Survey | Presented at the First International Workshop On Open Data, WOD-2012
(http://arxiv.org/abs/1204.3726) | null | null | WOD/2012/NANTES/12 | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | OpenData movement around the globe is demanding more access to information
which lies locked in public or private servers. As recently reported by a
McKinsey publication, this data has significant economic value, yet its release
has potential to blatantly conflict with people privacy. Recent UK government
inquires ha... | [
{
"version": "v1",
"created": "Fri, 11 May 2012 21:38:16 GMT"
}
] | 2012-05-15T00:00:00 | [
[
"Leoni",
"David",
""
]
] | TITLE: Non-Interactive Differential Privacy: a Survey
ABSTRACT: OpenData movement around the globe is demanding more access to information
which lies locked in public or private servers. As recently reported by a
McKinsey publication, this data has significant economic value, yet its release
has potential to blatan... |
1205.2821 | Odemir Bruno PhD | J. B. Florindo and O. M. Bruno | Texture Analysis And Characterization Using Probability Fractal
Descriptors | 6 pages, 5 figures | null | null | null | physics.data-an cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A gray-level image texture descriptors based on fractal dimension estimation
is proposed in this work. The proposed method estimates the fractal dimension
using probability (Voss) method. The descriptors are computed applying a
multiscale transform to the fractal dimension curves of the texture image. The
proposed te... | [
{
"version": "v1",
"created": "Sun, 13 May 2012 02:20:52 GMT"
}
] | 2012-05-15T00:00:00 | [
[
"Florindo",
"J. B.",
""
],
[
"Bruno",
"O. M.",
""
]
] | TITLE: Texture Analysis And Characterization Using Probability Fractal
Descriptors
ABSTRACT: A gray-level image texture descriptors based on fractal dimension estimation
is proposed in this work. The proposed method estimates the fractal dimension
using probability (Voss) method. The descriptors are computed appl... |
1205.2958 | Ping Li | Ping Li and Anshumali Shrivastava and Arnd Christian Konig | b-Bit Minwise Hashing in Practice: Large-Scale Batch and Online Learning
and Using GPUs for Fast Preprocessing with Simple Hash Functions | null | null | null | null | cs.IR cs.DB cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we study several critical issues which must be tackled before
one can apply b-bit minwise hashing to the volumes of data often used
industrial applications, especially in the context of search.
1. (b-bit) Minwise hashing requires an expensive preprocessing step that
computes k (e.g., 500) minimal val... | [
{
"version": "v1",
"created": "Mon, 14 May 2012 08:28:10 GMT"
}
] | 2012-05-15T00:00:00 | [
[
"Li",
"Ping",
""
],
[
"Shrivastava",
"Anshumali",
""
],
[
"Konig",
"Arnd Christian",
""
]
] | TITLE: b-Bit Minwise Hashing in Practice: Large-Scale Batch and Online Learning
and Using GPUs for Fast Preprocessing with Simple Hash Functions
ABSTRACT: In this paper, we study several critical issues which must be tackled before
one can apply b-bit minwise hashing to the volumes of data often used
industrial a... |
1205.3012 | Xavier Calbet | Xavier Calbet | Determination of the best optimal estimation parameters for validation
of infrared hyperspectral sounding retrievals | 38 pages, 14 figures, 1 table | null | null | null | physics.ao-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The availability of hyperspectral infrared remote sensing instruments, like
AIRS and IASI, on board of Earth observing satellites opens the possibility of
obtaining high vertical resolution atmospheric profiles. We present an
objective and simple technique to derive the parameters used in the optimal
estimation metho... | [
{
"version": "v1",
"created": "Mon, 14 May 2012 13:19:31 GMT"
}
] | 2012-05-15T00:00:00 | [
[
"Calbet",
"Xavier",
""
]
] | TITLE: Determination of the best optimal estimation parameters for validation
of infrared hyperspectral sounding retrievals
ABSTRACT: The availability of hyperspectral infrared remote sensing instruments, like
AIRS and IASI, on board of Earth observing satellites opens the possibility of
obtaining high vertical r... |
1205.2424 | Ping Zhou | Ping Zhou and Yongfeng Zhong | The citation-based indicator and combined impact indicator - New options
for measuring impact | null | null | null | null | cs.DL physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Metrics based on percentile ranks (PRs) for measuring scholarly impact
involves complex treatment because of various defects such as overvaluing or
devaluing an object caused by percentile ranking schemes, ignoring precise
citation variation among those ranked next to each other, and inconsistency
caused by additiona... | [
{
"version": "v1",
"created": "Fri, 11 May 2012 03:49:35 GMT"
}
] | 2012-05-14T00:00:00 | [
[
"Zhou",
"Ping",
""
],
[
"Zhong",
"Yongfeng",
""
]
] | TITLE: The citation-based indicator and combined impact indicator - New options
for measuring impact
ABSTRACT: Metrics based on percentile ranks (PRs) for measuring scholarly impact
involves complex treatment because of various defects such as overvaluing or
devaluing an object caused by percentile ranking scheme... |
1205.2470 | Hideaki Aoyama | Hideaki Aoyama, Hiroshi Iyetomi, and Hiroshi Yoshikawa | Equilibrium Distribution of Labor Productivity: A Theoretical Model | 11pages, 5 figures, and 1 table | null | null | KUNS-2400 | q-fin.ST physics.data-an physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We construct a theoretical model for equilibrium distribution of workers
across sectors with different labor productivity, assuming that a sector can
accommodate a limited number of workers which depends only on its productivity.
A general formula for such distribution of productivity is obtained, using the
detail-ba... | [
{
"version": "v1",
"created": "Fri, 11 May 2012 09:53:17 GMT"
}
] | 2012-05-14T00:00:00 | [
[
"Aoyama",
"Hideaki",
""
],
[
"Iyetomi",
"Hiroshi",
""
],
[
"Yoshikawa",
"Hiroshi",
""
]
] | TITLE: Equilibrium Distribution of Labor Productivity: A Theoretical Model
ABSTRACT: We construct a theoretical model for equilibrium distribution of workers
across sectors with different labor productivity, assuming that a sector can
accommodate a limited number of workers which depends only on its productivity.
A... |
1205.2650 | Finale Doshi-Velez | Finale Doshi-Velez, Zoubin Ghahramani | Correlated Non-Parametric Latent Feature Models | Appears in Proceedings of the Twenty-Fifth Conference on Uncertainty
in Artificial Intelligence (UAI2009) | null | null | UAI-P-2009-PG-143-150 | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We are often interested in explaining data through a set of hidden factors or
features. When the number of hidden features is unknown, the Indian Buffet
Process (IBP) is a nonparametric latent feature model that does not bound the
number of active features in dataset. However, the IBP assumes that all latent
features... | [
{
"version": "v1",
"created": "Wed, 9 May 2012 15:09:51 GMT"
}
] | 2012-05-14T00:00:00 | [
[
"Doshi-Velez",
"Finale",
""
],
[
"Ghahramani",
"Zoubin",
""
]
] | TITLE: Correlated Non-Parametric Latent Feature Models
ABSTRACT: We are often interested in explaining data through a set of hidden factors or
features. When the number of hidden features is unknown, the Indian Buffet
Process (IBP) is a nonparametric latent feature model that does not bound the
number of active fea... |
1205.2292 | George Papastefanatos Dr. | Yannis Stavrakas, George Papastefanatos, Theodore Dalamagas, Vassilis
Christophides | Diachronic Linked Data: Towards Long-Term Preservation of Structured
Interrelated Information | Presented at the First International Workshop On Open Data, WOD-2012
(http://arxiv.org/abs/1204.3726) | null | null | WOD/2012/NANTES/10 | cs.DB cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Linked Data Paradigm is one of the most promising technologies for
publishing, sharing, and connecting data on the Web, and offers a new way for
data integration and interoperability. However, the proliferation of
distributed, inter-connected sources of information and services on the Web
poses significant new ch... | [
{
"version": "v1",
"created": "Thu, 10 May 2012 15:28:30 GMT"
}
] | 2012-05-11T00:00:00 | [
[
"Stavrakas",
"Yannis",
""
],
[
"Papastefanatos",
"George",
""
],
[
"Dalamagas",
"Theodore",
""
],
[
"Christophides",
"Vassilis",
""
]
] | TITLE: Diachronic Linked Data: Towards Long-Term Preservation of Structured
Interrelated Information
ABSTRACT: The Linked Data Paradigm is one of the most promising technologies for
publishing, sharing, and connecting data on the Web, and offers a new way for
data integration and interoperability. However, the pr... |
1205.2345 | Salah A. Aly | Hossam Zawbaa and Salah A. Aly | Hajj and Umrah Event Recognition Datasets | 4 pages, 18 figures with 33 images | null | null | null | cs.CV cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this note, new Hajj and Umrah Event Recognition datasets (HUER) are
presented. The demonstrated datasets are based on videos and images taken
during 2011-2012 Hajj and Umrah seasons. HUER is the first collection of
datasets covering the six types of Hajj and Umrah ritual events (rotating in
Tawaf around Kabaa, per... | [
{
"version": "v1",
"created": "Thu, 10 May 2012 19:10:18 GMT"
}
] | 2012-05-11T00:00:00 | [
[
"Zawbaa",
"Hossam",
""
],
[
"Aly",
"Salah A.",
""
]
] | TITLE: Hajj and Umrah Event Recognition Datasets
ABSTRACT: In this note, new Hajj and Umrah Event Recognition datasets (HUER) are
presented. The demonstrated datasets are based on videos and images taken
during 2011-2012 Hajj and Umrah seasons. HUER is the first collection of
datasets covering the six types of Hajj... |
1205.2031 | Sreejini Ks | K. S. Sreejini, A. Lijiya and V. K. Govindan | M-FISH Karyotyping - A New Approach Based on Watershed Transform | 13 pages,7 figures | null | 10.5121/ijcseit.2012.2210 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Karyotyping is a process in which chromosomes in a dividing cell are properly
stained, identified and displayed in a standard format, which helps geneticist
to study and diagnose genetic factors behind various genetic diseases and for
studying cancer. M-FISH (Multiplex Fluorescent In-Situ Hybridization) provides
colo... | [
{
"version": "v1",
"created": "Wed, 9 May 2012 16:52:23 GMT"
}
] | 2012-05-10T00:00:00 | [
[
"Sreejini",
"K. S.",
""
],
[
"Lijiya",
"A.",
""
],
[
"Govindan",
"V. K.",
""
]
] | TITLE: M-FISH Karyotyping - A New Approach Based on Watershed Transform
ABSTRACT: Karyotyping is a process in which chromosomes in a dividing cell are properly
stained, identified and displayed in a standard format, which helps geneticist
to study and diagnose genetic factors behind various genetic diseases and for... |
1205.1645 | Fran\c{c}ois Scharffe | Julien Plu and Fran\c{c}ois Scharffe | Publishing and linking transport data on the Web | Presented at the First International Workshop On Open Data, WOD-2012
(http://arxiv.org/abs/1204.3726) | null | null | WOD/2012/NANTES/13 | cs.AI | http://creativecommons.org/licenses/by-nc-sa/3.0/ | Without Linked Data, transport data is limited to applications exclusively
around transport. In this paper, we present a workflow for publishing and
linking transport data on the Web. So we will be able to develop transport
applications and to add other features which will be created from other
datasets. This will be... | [
{
"version": "v1",
"created": "Tue, 8 May 2012 09:50:35 GMT"
}
] | 2012-05-09T00:00:00 | [
[
"Plu",
"Julien",
""
],
[
"Scharffe",
"François",
""
]
] | TITLE: Publishing and linking transport data on the Web
ABSTRACT: Without Linked Data, transport data is limited to applications exclusively
around transport. In this paper, we present a workflow for publishing and
linking transport data on the Web. So we will be able to develop transport
applications and to add ot... |
1103.2950 | Wentian Li | Wentian Li and Pedro Miramontes | Fitting Ranked English and Spanish Letter Frequency Distribution in U.S.
and Mexican Presidential Speeches | 7 figures | Journal of Quantitative Linguistics, 18(4):359-380 (2011) | 10.1080/09296174.2011.608606 | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The limited range in its abscissa of ranked letter frequency distributions
causes multiple functions to fit the observed distribution reasonably well. In
order to critically compare various functions, we apply the statistical model
selections on ten functions, using the texts of U.S. and Mexican presidential
speeches... | [
{
"version": "v1",
"created": "Tue, 15 Mar 2011 16:21:24 GMT"
}
] | 2012-05-07T00:00:00 | [
[
"Li",
"Wentian",
""
],
[
"Miramontes",
"Pedro",
""
]
] | TITLE: Fitting Ranked English and Spanish Letter Frequency Distribution in U.S.
and Mexican Presidential Speeches
ABSTRACT: The limited range in its abscissa of ranked letter frequency distributions
causes multiple functions to fit the observed distribution reasonably well. In
order to critically compare various ... |
1205.0837 | Sean Chester | Sean Chester, Alex Thomo, S. Venkatesh, Sue Whitesides | Indexing Reverse Top-k Queries | null | null | null | null | cs.DB cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the recently introduced monochromatic reverse top-k queries which
ask for, given a new tuple q and a dataset D, all possible top-k queries on D
union {q} for which q is in the result. Towards this problem, we focus on
designing indexes in two dimensions for repeated (or batch) querying, a novel
but practi... | [
{
"version": "v1",
"created": "Fri, 4 May 2012 00:03:18 GMT"
}
] | 2012-05-07T00:00:00 | [
[
"Chester",
"Sean",
""
],
[
"Thomo",
"Alex",
""
],
[
"Venkatesh",
"S.",
""
],
[
"Whitesides",
"Sue",
""
]
] | TITLE: Indexing Reverse Top-k Queries
ABSTRACT: We consider the recently introduced monochromatic reverse top-k queries which
ask for, given a new tuple q and a dataset D, all possible top-k queries on D
union {q} for which q is in the result. Towards this problem, we focus on
designing indexes in two dimensions fo... |
1205.0917 | Omri Mohamed Nazih | Radhouane Boughamoura, Lobna Hlaoua and Mohamed Nazih Omri | VIQI: A New Approach for Visual Interpretation of Deep Web Query
Interfaces | 8th NCM: 2012 International Conference on Networked Computing and
Advanced Information Management | null | null | null | cs.IR cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep Web databases contain more than 90% of pertinent information of the Web.
Despite their importance, users don't profit of this treasury. Many deep web
services are offering competitive services in term of prices, quality of
service, and facilities. As the number of services is growing rapidly, users
have difficul... | [
{
"version": "v1",
"created": "Fri, 4 May 2012 11:01:42 GMT"
}
] | 2012-05-07T00:00:00 | [
[
"Boughamoura",
"Radhouane",
""
],
[
"Hlaoua",
"Lobna",
""
],
[
"Omri",
"Mohamed Nazih",
""
]
] | TITLE: VIQI: A New Approach for Visual Interpretation of Deep Web Query
Interfaces
ABSTRACT: Deep Web databases contain more than 90% of pertinent information of the Web.
Despite their importance, users don't profit of this treasury. Many deep web
services are offering competitive services in term of prices, qual... |
1205.0919 | Omri Mohamed Nazih | Radhouane Boughammoura Lobna Hlaoua and Mohamed Nazih Omri | ViQIE: A New Approach for Visual Query Interpretation and Extraction | ICITES 2012 - 2nd International Conference on Information Technology
and e-Services | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Web services are accessed via query interfaces which hide databases
containing thousands of relevant information. User's side, distant database is
a black box which accepts query and returns results, there is no way to access
database schema which reflect data and query meanings. Hence, web services are
very autonomo... | [
{
"version": "v1",
"created": "Fri, 4 May 2012 11:08:31 GMT"
}
] | 2012-05-07T00:00:00 | [
[
"Hlaoua",
"Radhouane Boughammoura Lobna",
""
],
[
"Omri",
"Mohamed Nazih",
""
]
] | TITLE: ViQIE: A New Approach for Visual Query Interpretation and Extraction
ABSTRACT: Web services are accessed via query interfaces which hide databases
containing thousands of relevant information. User's side, distant database is
a black box which accepts query and returns results, there is no way to access
data... |
1205.0610 | Gang Chen | Gang Chen and Jason Corso | Greedy Multiple Instance Learning via Codebook Learning and Nearest
Neighbor Voting | 12 pages | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-sa/3.0/ | Multiple instance learning (MIL) has attracted great attention recently in
machine learning community. However, most MIL algorithms are very slow and
cannot be applied to large datasets. In this paper, we propose a greedy
strategy to speed up the multiple instance learning process. Our contribution
is two fold. First... | [
{
"version": "v1",
"created": "Thu, 3 May 2012 04:09:19 GMT"
}
] | 2012-05-04T00:00:00 | [
[
"Chen",
"Gang",
""
],
[
"Corso",
"Jason",
""
]
] | TITLE: Greedy Multiple Instance Learning via Codebook Learning and Nearest
Neighbor Voting
ABSTRACT: Multiple instance learning (MIL) has attracted great attention recently in
machine learning community. However, most MIL algorithms are very slow and
cannot be applied to large datasets. In this paper, we propose ... |
1204.6385 | Yankui Sun | Yankui Sun, Tian Zhang | A 3D Segmentation Method for Retinal Optical Coherence Tomography Volume
Data | 4 pages, 9 figures | China Patent Application (201110247341.5), 2011 | null | null | cs.CV physics.optics | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the introduction of spectral-domain optical coherence tomography (OCT),
much larger image datasets are routinely acquired compared to what was possible
using the previous generation of time-domain OCT. Thus, the need for 3-D
segmentation methods for processing such data is becoming increasingly
important. We pre... | [
{
"version": "v1",
"created": "Sat, 28 Apr 2012 09:05:56 GMT"
}
] | 2012-05-03T00:00:00 | [
[
"Sun",
"Yankui",
""
],
[
"Zhang",
"Tian",
""
]
] | TITLE: A 3D Segmentation Method for Retinal Optical Coherence Tomography Volume
Data
ABSTRACT: With the introduction of spectral-domain optical coherence tomography (OCT),
much larger image datasets are routinely acquired compared to what was possible
using the previous generation of time-domain OCT. Thus, the ne... |
1204.6563 | Prabhu Kaliamoorthi Mr | Prabhu Kaliamoorthi and Ramakrishna Kakarala | Parametric annealing: a stochastic search method for human pose tracking | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Model based methods to marker-free motion capture have a very high
computational overhead that make them unattractive. In this paper we describe a
method that improves on existing global optimization techniques to tracking
articulated objects. Our method improves on the state-of-the-art Annealed
Particle Filter (APF)... | [
{
"version": "v1",
"created": "Mon, 30 Apr 2012 07:04:08 GMT"
},
{
"version": "v2",
"created": "Wed, 2 May 2012 04:37:03 GMT"
}
] | 2012-05-03T00:00:00 | [
[
"Kaliamoorthi",
"Prabhu",
""
],
[
"Kakarala",
"Ramakrishna",
""
]
] | TITLE: Parametric annealing: a stochastic search method for human pose tracking
ABSTRACT: Model based methods to marker-free motion capture have a very high
computational overhead that make them unattractive. In this paper we describe a
method that improves on existing global optimization techniques to tracking
art... |
1205.0038 | Fergal Reid | Fergal Reid, Aaron McDaid, Neil Hurley | Percolation Computation in Complex Networks | 12 pages, 8 figures. Supporting source code available:
http://sites.google.com/site/cliqueperccomp | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | K-clique percolation is an overlapping community finding algorithm which
extracts particular structures, comprised of overlapping cliques, from complex
networks. While it is conceptually straightforward, and can be elegantly
expressed using clique graphs, certain aspects of k-clique percolation are
computationally ch... | [
{
"version": "v1",
"created": "Mon, 30 Apr 2012 21:40:37 GMT"
}
] | 2012-05-02T00:00:00 | [
[
"Reid",
"Fergal",
""
],
[
"McDaid",
"Aaron",
""
],
[
"Hurley",
"Neil",
""
]
] | TITLE: Percolation Computation in Complex Networks
ABSTRACT: K-clique percolation is an overlapping community finding algorithm which
extracts particular structures, comprised of overlapping cliques, from complex
networks. While it is conceptually straightforward, and can be elegantly
expressed using clique graphs,... |
1204.6396 | Roheet Bhatnagar | Roheet Bhatnagar and Mrinal Kanti Ghose | Comparing Soft Computing Techniques For Early Stage Software Development
Effort Estimations | 09 PAGES | International Journal of Software Engineering & Applications
(IJSEA), Vol.3, No.2, March 2012 | null | null | cs.SE | http://creativecommons.org/licenses/publicdomain/ | Accurately estimating the software size, cost, effort and schedule is
probably the biggest challenge facing software developers today. It has major
implications for the management of software development because both the
overestimates and underestimates have direct impact for causing damage to
software companies. Lot... | [
{
"version": "v1",
"created": "Sat, 28 Apr 2012 10:48:19 GMT"
}
] | 2012-05-01T00:00:00 | [
[
"Bhatnagar",
"Roheet",
""
],
[
"Ghose",
"Mrinal Kanti",
""
]
] | TITLE: Comparing Soft Computing Techniques For Early Stage Software Development
Effort Estimations
ABSTRACT: Accurately estimating the software size, cost, effort and schedule is
probably the biggest challenge facing software developers today. It has major
implications for the management of software development b... |
1204.6077 | Ahmed Metwally | Ahmed Metwally, Christos Faloutsos | V-SMART-Join: A Scalable MapReduce Framework for All-Pair Similarity
Joins of Multisets and Vectors | VLDB2012 | Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 8, pp.
704-715 (2012) | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work proposes V-SMART-Join, a scalable MapReduce-based framework for
discovering all pairs of similar entities. The V-SMART-Join framework is
applicable to sets, multisets, and vectors. V-SMART-Join is motivated by the
observed skew in the underlying distributions of Internet traffic, and is a
family of 2-stage ... | [
{
"version": "v1",
"created": "Thu, 26 Apr 2012 23:25:14 GMT"
}
] | 2012-04-30T00:00:00 | [
[
"Metwally",
"Ahmed",
""
],
[
"Faloutsos",
"Christos",
""
]
] | TITLE: V-SMART-Join: A Scalable MapReduce Framework for All-Pair Similarity
Joins of Multisets and Vectors
ABSTRACT: This work proposes V-SMART-Join, a scalable MapReduce-based framework for
discovering all pairs of similar entities. The V-SMART-Join framework is
applicable to sets, multisets, and vectors. V-SMAR... |
1201.5722 | Vasyl Palchykov | Vasyl Palchykov, Kimmo Kaski, J\'anos Kert\'esz, Albert-L\'aszl\'o
Barab\'asi and Robin I. M. Dunbar | Sex differences in intimate relationships | 5 pages, 3 figures, contains electronic supplementary material | Sci. Rep. 2, 370 (2012) | 10.1038/srep00370 | null | physics.soc-ph cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Social networks have turned out to be of fundamental importance both for our
understanding human sociality and for the design of digital communication
technology. However, social networks are themselves based on dyadic
relationships and we have little understanding of the dynamics of close
relationships and how these... | [
{
"version": "v1",
"created": "Fri, 27 Jan 2012 08:42:10 GMT"
},
{
"version": "v2",
"created": "Wed, 25 Apr 2012 10:48:20 GMT"
}
] | 2012-04-26T00:00:00 | [
[
"Palchykov",
"Vasyl",
""
],
[
"Kaski",
"Kimmo",
""
],
[
"Kertész",
"János",
""
],
[
"Barabási",
"Albert-László",
""
],
[
"Dunbar",
"Robin I. M.",
""
]
] | TITLE: Sex differences in intimate relationships
ABSTRACT: Social networks have turned out to be of fundamental importance both for our
understanding human sociality and for the design of digital communication
technology. However, social networks are themselves based on dyadic
relationships and we have little under... |
1204.5592 | Dr Brij Gupta | B. B. Gupta, R. C. Joshi, Manoj Misra | Dynamic and Auto Responsive Solution for Distributed Denial-of-Service
Attacks Detection in ISP Network | arXiv admin note: substantial text overlap with arXiv:1203.2400 | International Journal of Computer Theory and Engineering, Vol. 1,
No. 1, April 2009 1793-821X | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Denial of service (DoS) attacks and more particularly the distributed ones
(DDoS) are one of the latest threat and pose a grave danger to users,
organizations and infrastructures of the Internet. Several schemes have been
proposed on how to detect some of these attacks, but they suffer from a range
of problems, some ... | [
{
"version": "v1",
"created": "Wed, 25 Apr 2012 08:56:12 GMT"
}
] | 2012-04-26T00:00:00 | [
[
"Gupta",
"B. B.",
""
],
[
"Joshi",
"R. C.",
""
],
[
"Misra",
"Manoj",
""
]
] | TITLE: Dynamic and Auto Responsive Solution for Distributed Denial-of-Service
Attacks Detection in ISP Network
ABSTRACT: Denial of service (DoS) attacks and more particularly the distributed ones
(DDoS) are one of the latest threat and pose a grave danger to users,
organizations and infrastructures of the Interne... |
1204.5086 | Christoph Lange | Christoph Lange and Patrick Ion and Anastasia Dimou and Charalampos
Bratsas and Joseph Corneli and Wolfram Sperber and Michael Kohlhase and
Ioannis Antoniou | Reimplementing the Mathematical Subject Classification (MSC) as a Linked
Open Dataset | Conference on Intelligent Computer Mathematics, July 9-14, Bremen,
Germany. Published as number 7362 in Lecture Notes in Artificial
Intelligence, Springer | null | null | null | cs.DL cs.MS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Mathematics Subject Classification (MSC) is a widely used scheme for
classifying documents in mathematics by subject. Its traditional, idiosyncratic
conceptualization and representation makes the scheme hard to maintain and
requires custom implementations of search, query and annotation support. This
limits uptak... | [
{
"version": "v1",
"created": "Mon, 23 Apr 2012 15:29:30 GMT"
}
] | 2012-04-24T00:00:00 | [
[
"Lange",
"Christoph",
""
],
[
"Ion",
"Patrick",
""
],
[
"Dimou",
"Anastasia",
""
],
[
"Bratsas",
"Charalampos",
""
],
[
"Corneli",
"Joseph",
""
],
[
"Sperber",
"Wolfram",
""
],
[
"Kohlhase",
"Michael",
""
... | TITLE: Reimplementing the Mathematical Subject Classification (MSC) as a Linked
Open Dataset
ABSTRACT: The Mathematics Subject Classification (MSC) is a widely used scheme for
classifying documents in mathematics by subject. Its traditional, idiosyncratic
conceptualization and representation makes the scheme hard... |
1006.5235 | Matteo Riondato | Andrea Pietracaprina, Matteo Riondato, Eli Upfal, Fabio Vandin | Mining Top-K Frequent Itemsets Through Progressive Sampling | 16 pages, 2 figures, accepted for presentation at ECML PKDD 2010 and
publication in the ECML PKDD 2010 special issue of the Data Mining and
Knowledge Discovery journal | null | 10.1007/s10618-010-0185-7 | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the use of sampling for efficiently mining the top-K frequent
itemsets of cardinality at most w. To this purpose, we define an approximation
to the top-K frequent itemsets to be a family of itemsets which includes
(resp., excludes) all very frequent (resp., very infrequent) itemsets, together
with an estimat... | [
{
"version": "v1",
"created": "Sun, 27 Jun 2010 20:38:39 GMT"
}
] | 2012-04-23T00:00:00 | [
[
"Pietracaprina",
"Andrea",
""
],
[
"Riondato",
"Matteo",
""
],
[
"Upfal",
"Eli",
""
],
[
"Vandin",
"Fabio",
""
]
] | TITLE: Mining Top-K Frequent Itemsets Through Progressive Sampling
ABSTRACT: We study the use of sampling for efficiently mining the top-K frequent
itemsets of cardinality at most w. To this purpose, we define an approximation
to the top-K frequent itemsets to be a family of itemsets which includes
(resp., excludes... |
1204.4541 | Patrick Taillandier | Patrick Taillandier (UMMISCO), Julien Gaffuri (COGIT) | Automatic Sampling of Geographic objects | null | GIScience, Zurich : Switzerland (2010) | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Today, one's disposes of large datasets composed of thousands of geographic
objects. However, for many processes, which require the appraisal of an expert
or much computational time, only a small part of these objects can be taken
into account. In this context, robust sampling methods become necessary. In
this paper,... | [
{
"version": "v1",
"created": "Fri, 20 Apr 2012 06:35:41 GMT"
}
] | 2012-04-23T00:00:00 | [
[
"Taillandier",
"Patrick",
"",
"UMMISCO"
],
[
"Gaffuri",
"Julien",
"",
"COGIT"
]
] | TITLE: Automatic Sampling of Geographic objects
ABSTRACT: Today, one's disposes of large datasets composed of thousands of geographic
objects. However, for many processes, which require the appraisal of an expert
or much computational time, only a small part of these objects can be taken
into account. In this conte... |
1105.2470 | Bertrand Georgeot | Bertrand Georgeot and Olivier Giraud | The game of go as a complex network | 6 pages, 9 figures, final version | Europhysics Letters 97, 68002 (2012) | 10.1209/0295-5075/97/68002 | null | cs.GT cond-mat.stat-mech cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the game of go from a complex network perspective. We construct a
directed network using a suitable definition of tactical moves including local
patterns, and study this network for different datasets of professional
tournaments and amateur games. The move distribution follows Zipf's law and the
network is s... | [
{
"version": "v1",
"created": "Thu, 12 May 2011 13:36:09 GMT"
},
{
"version": "v2",
"created": "Wed, 18 Apr 2012 11:03:07 GMT"
}
] | 2012-04-20T00:00:00 | [
[
"Georgeot",
"Bertrand",
""
],
[
"Giraud",
"Olivier",
""
]
] | TITLE: The game of go as a complex network
ABSTRACT: We study the game of go from a complex network perspective. We construct a
directed network using a suitable definition of tactical moves including local
patterns, and study this network for different datasets of professional
tournaments and amateur games. The mo... |
1204.3921 | Javier Esteban Zarza | Javier Esteban, Antonio Ortega, Sean McPherson and Maheswaran
Sathiamoorthy | Analysis of Twitter Traffic based on Renewal Densities | null | null | null | null | cs.CY cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we propose a novel approach for Twitter traffic analysis based
on renewal theory. Even though twitter datasets are of increasing interest to
researchers, extracting information from message timing remains somewhat
unexplored. Our approach, extending our prior work on anomaly detection, makes
it possible... | [
{
"version": "v1",
"created": "Tue, 17 Apr 2012 21:26:19 GMT"
}
] | 2012-04-19T00:00:00 | [
[
"Esteban",
"Javier",
""
],
[
"Ortega",
"Antonio",
""
],
[
"McPherson",
"Sean",
""
],
[
"Sathiamoorthy",
"Maheswaran",
""
]
] | TITLE: Analysis of Twitter Traffic based on Renewal Densities
ABSTRACT: In this paper we propose a novel approach for Twitter traffic analysis based
on renewal theory. Even though twitter datasets are of increasing interest to
researchers, extracting information from message timing remains somewhat
unexplored. Our ... |
1204.3968 | Pierre Sermanet | Pierre Sermanet, Soumith Chintala, Yann LeCun | Convolutional Neural Networks Applied to House Numbers Digit
Classification | 4 pages, 6 figures, 2 tables | null | null | null | cs.CV cs.LG cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We classify digits of real-world house numbers using convolutional neural
networks (ConvNets). ConvNets are hierarchical feature learning neural networks
whose structure is biologically inspired. Unlike many popular vision approaches
that are hand-designed, ConvNets can automatically learn a unique set of
features op... | [
{
"version": "v1",
"created": "Wed, 18 Apr 2012 03:48:38 GMT"
}
] | 2012-04-19T00:00:00 | [
[
"Sermanet",
"Pierre",
""
],
[
"Chintala",
"Soumith",
""
],
[
"LeCun",
"Yann",
""
]
] | TITLE: Convolutional Neural Networks Applied to House Numbers Digit
Classification
ABSTRACT: We classify digits of real-world house numbers using convolutional neural
networks (ConvNets). ConvNets are hierarchical feature learning neural networks
whose structure is biologically inspired. Unlike many popular visio... |
1204.3498 | Vahed Qazvinian | Vahed Qazvinian and Dragomir R. Radev | A Computational Analysis of Collective Discourse | Presented at Collective Intelligence conference, 2012
(arXiv:1204.2991) | null | null | CollectiveIntelligence/2012/59 | cs.SI cs.CL physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper is focused on the computational analysis of collective discourse,
a collective behavior seen in non-expert content contributions in online social
media. We collect and analyze a wide range of real-world collective discourse
datasets from movie user reviews to microblogs and news headlines to scientific
cit... | [
{
"version": "v1",
"created": "Mon, 16 Apr 2012 14:27:39 GMT"
},
{
"version": "v2",
"created": "Tue, 17 Apr 2012 17:17:28 GMT"
}
] | 2012-04-18T00:00:00 | [
[
"Qazvinian",
"Vahed",
""
],
[
"Radev",
"Dragomir R.",
""
]
] | TITLE: A Computational Analysis of Collective Discourse
ABSTRACT: This paper is focused on the computational analysis of collective discourse,
a collective behavior seen in non-expert content contributions in online social
media. We collect and analyze a wide range of real-world collective discourse
datasets from m... |
1204.3200 | Andrea Scharnhorst | Andrea Scharnhorst, Olav ten Bosch, Peter Doorn | Looking at a digital research data archive - Visual interfaces to EASY | Submitted to the TPDL 2012 | null | null | null | cs.DL physics.soc-ph | http://creativecommons.org/licenses/by/3.0/ | In this paper we explore visually the structure of the collection of a
digital research data archive in terms of metadata for deposited datasets. We
look into the distribution of datasets over different scientific fields; the
role of main depositors (persons and institutions) in different fields, and
main access choi... | [
{
"version": "v1",
"created": "Sat, 14 Apr 2012 19:49:02 GMT"
}
] | 2012-04-17T00:00:00 | [
[
"Scharnhorst",
"Andrea",
""
],
[
"Bosch",
"Olav ten",
""
],
[
"Doorn",
"Peter",
""
]
] | TITLE: Looking at a digital research data archive - Visual interfaces to EASY
ABSTRACT: In this paper we explore visually the structure of the collection of a
digital research data archive in terms of metadata for deposited datasets. We
look into the distribution of datasets over different scientific fields; the
ro... |
1204.3511 | Nicol\'as Della Penna | Nicol\'as Della Penna, Mark D. Reid | Crowd & Prejudice: An Impossibility Theorem for Crowd Labelling without
a Gold Standard | Presented at Collective Intelligence conference, 2012
(arXiv:1204.2991) | null | null | CollectiveIntelligence/2012/33 | cs.SI cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A common use of crowd sourcing is to obtain labels for a dataset. Several
algorithms have been proposed to identify uninformative members of the crowd so
that their labels can be disregarded and the cost of paying them avoided. One
common motivation of these algorithms is to try and do without any initial set
of trus... | [
{
"version": "v1",
"created": "Mon, 16 Apr 2012 15:07:56 GMT"
}
] | 2012-04-17T00:00:00 | [
[
"Della Penna",
"Nicolás",
""
],
[
"Reid",
"Mark D.",
""
]
] | TITLE: Crowd & Prejudice: An Impossibility Theorem for Crowd Labelling without
a Gold Standard
ABSTRACT: A common use of crowd sourcing is to obtain labels for a dataset. Several
algorithms have been proposed to identify uninformative members of the crowd so
that their labels can be disregarded and the cost of pa... |
1109.3841 | Han-I Su | Han-I Su and Abbas El Gamal | Limits on the Benefits of Energy Storage for Renewable Integration | 45 pages, 17 figures | null | null | null | math.OC cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The high variability of renewable energy resources presents significant
challenges to the operation of the electric power grid. Conventional generators
can be used to mitigate this variability but are costly to operate and produce
carbon emissions. Energy storage provides a more environmentally friendly
alternative, ... | [
{
"version": "v1",
"created": "Sun, 18 Sep 2011 04:12:04 GMT"
},
{
"version": "v2",
"created": "Thu, 12 Apr 2012 17:32:27 GMT"
}
] | 2012-04-13T00:00:00 | [
[
"Su",
"Han-I",
""
],
[
"Gamal",
"Abbas El",
""
]
] | TITLE: Limits on the Benefits of Energy Storage for Renewable Integration
ABSTRACT: The high variability of renewable energy resources presents significant
challenges to the operation of the electric power grid. Conventional generators
can be used to mitigate this variability but are costly to operate and produce
c... |
1204.2581 | Sheng Gao | Sheng Gao and Ludovic Denoyer and Patrick Gallinari | Modeling Relational Data via Latent Factor Blockmodel | 10 pages, 12 figures | null | null | null | cs.DS cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we address the problem of modeling relational data, which
appear in many applications such as social network analysis, recommender
systems and bioinformatics. Previous studies either consider latent feature
based models but disregarding local structure in the network, or focus
exclusively on capturing l... | [
{
"version": "v1",
"created": "Wed, 11 Apr 2012 22:14:05 GMT"
}
] | 2012-04-13T00:00:00 | [
[
"Gao",
"Sheng",
""
],
[
"Denoyer",
"Ludovic",
""
],
[
"Gallinari",
"Patrick",
""
]
] | TITLE: Modeling Relational Data via Latent Factor Blockmodel
ABSTRACT: In this paper we address the problem of modeling relational data, which
appear in many applications such as social network analysis, recommender
systems and bioinformatics. Previous studies either consider latent feature
based models but disrega... |
1204.2588 | Sheng Gao | Sheng Gao and Ludovic Denoyer and Patrick Gallinari | Probabilistic Latent Tensor Factorization Model for Link Pattern
Prediction in Multi-relational Networks | 19pages, 5 figures | null | null | null | cs.SI cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper aims at the problem of link pattern prediction in collections of
objects connected by multiple relation types, where each type may play a
distinct role. While common link analysis models are limited to single-type
link prediction, we attempt here to capture the correlations among different
relation types a... | [
{
"version": "v1",
"created": "Wed, 11 Apr 2012 22:58:46 GMT"
}
] | 2012-04-13T00:00:00 | [
[
"Gao",
"Sheng",
""
],
[
"Denoyer",
"Ludovic",
""
],
[
"Gallinari",
"Patrick",
""
]
] | TITLE: Probabilistic Latent Tensor Factorization Model for Link Pattern
Prediction in Multi-relational Networks
ABSTRACT: This paper aims at the problem of link pattern prediction in collections of
objects connected by multiple relation types, where each type may play a
distinct role. While common link analysis m... |
1204.2715 | David Vallet David Vallet | Magnus Knuth, Johannes Hercher and Harald Sack | Collaboratively Patching Linked Data | 2nd International Workshop on Usage Analysis and the Web of Data
(USEWOD2012) in the 21st International World Wide Web Conference (WWW2012),
Lyon, France, April 17th, 2012 | null | null | WWW2012USEWOD/2012/knhesa | cs.IR cs.DL cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Today's Web of Data is noisy. Linked Data often needs extensive preprocessing
to enable efficient use of heterogeneous resources. While consistent and valid
data provides the key to efficient data processing and aggregation we are
facing two main challenges: (1st) Identification of erroneous facts and
tracking their ... | [
{
"version": "v1",
"created": "Thu, 12 Apr 2012 13:27:08 GMT"
}
] | 2012-04-13T00:00:00 | [
[
"Knuth",
"Magnus",
""
],
[
"Hercher",
"Johannes",
""
],
[
"Sack",
"Harald",
""
]
] | TITLE: Collaboratively Patching Linked Data
ABSTRACT: Today's Web of Data is noisy. Linked Data often needs extensive preprocessing
to enable efficient use of heterogeneous resources. While consistent and valid
data provides the key to efficient data processing and aggregation we are
facing two main challenges: (1s... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.