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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0903.0682 | Raymond Chi-Wing Wong | Raymond Chi-Wing Wong, Ada Wai-Chee Fu, Jia Liu, Ke Wang and Yabo Xu | Preserving Individual Privacy in Serial Data Publishing | null | null | null | null | cs.DB cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While previous works on privacy-preserving serial data publishing consider
the scenario where sensitive values may persist over multiple data releases, we
find that no previous work has sufficient protection provided for sensitive
values that can change over time, which should be the more common case. In this
work we... | [
{
"version": "v1",
"created": "Wed, 4 Mar 2009 09:36:29 GMT"
}
] | 2009-03-05T00:00:00 | [
[
"Wong",
"Raymond Chi-Wing",
""
],
[
"Fu",
"Ada Wai-Chee",
""
],
[
"Liu",
"Jia",
""
],
[
"Wang",
"Ke",
""
],
[
"Xu",
"Yabo",
""
]
] | TITLE: Preserving Individual Privacy in Serial Data Publishing
ABSTRACT: While previous works on privacy-preserving serial data publishing consider
the scenario where sensitive values may persist over multiple data releases, we
find that no previous work has sufficient protection provided for sensitive
values that ... |
0903.0041 | Vit Niennattrakul | Vit Niennattrakul and Chotirat Ann Ratanamahatana | Learning DTW Global Constraint for Time Series Classification | The first runner up of Workshop and Challenge on Time Series
Classification held in conjunction with SIGKDD 2007. 8 pages, 5 figures | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 1-Nearest Neighbor with the Dynamic Time Warping (DTW) distance is one of the
most effective classifiers on time series domain. Since the global constraint
has been introduced in speech community, many global constraint models have
been proposed including Sakoe-Chiba (S-C) band, Itakura Parallelogram, and
Ratanamahat... | [
{
"version": "v1",
"created": "Sat, 28 Feb 2009 05:46:31 GMT"
}
] | 2009-03-03T00:00:00 | [
[
"Niennattrakul",
"Vit",
""
],
[
"Ratanamahatana",
"Chotirat Ann",
""
]
] | TITLE: Learning DTW Global Constraint for Time Series Classification
ABSTRACT: 1-Nearest Neighbor with the Dynamic Time Warping (DTW) distance is one of the
most effective classifiers on time series domain. Since the global constraint
has been introduced in speech community, many global constraint models have
been ... |
0801.2405 | Katrin Heitmann | Steve Haroz, Kwan-Liu Ma, Katrin Heitmann | Multiple Uncertainties in Time-Variant Cosmological Particle Data | 8 pages, 8 figures, published in Pacific Vis 2008, project website at
http://steveharoz.com/research/cosmology/ | Haroz, S; Ma, K-L; Heitmann, K, "Multiple Uncertainties in
Time-Variant Cosmological Particle Data" IEEE PacificVIS '08, pp.207-214, 5-7
March 2008 | 10.1109/PACIFICVIS.2008.4475478 | LAUR-08-0052 | astro-ph cs.GR cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Though the mediums for visualization are limited, the potential dimensions of
a dataset are not. In many areas of scientific study, understanding the
correlations between those dimensions and their uncertainties is pivotal to
mining useful information from a dataset. Obtaining this insight can
necessitate visualizing... | [
{
"version": "v1",
"created": "Tue, 15 Jan 2008 22:57:41 GMT"
},
{
"version": "v2",
"created": "Wed, 25 Feb 2009 08:09:24 GMT"
}
] | 2009-02-25T00:00:00 | [
[
"Haroz",
"Steve",
""
],
[
"Ma",
"Kwan-Liu",
""
],
[
"Heitmann",
"Katrin",
""
]
] | TITLE: Multiple Uncertainties in Time-Variant Cosmological Particle Data
ABSTRACT: Though the mediums for visualization are limited, the potential dimensions of
a dataset are not. In many areas of scientific study, understanding the
correlations between those dimensions and their uncertainties is pivotal to
mining ... |
0902.4228 | Vamsi Potluru | Vamsi K. Potluru, Sergey M. Plis, Morten Morup, Vince D. Calhoun,
Terran Lane | Multiplicative updates For Non-Negative Kernel SVM | 4 pages, 1 figure, 1 table | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present multiplicative updates for solving hard and soft margin support
vector machines (SVM) with non-negative kernels. They follow as a natural
extension of the updates for non-negative matrix factorization. No additional
param- eter setting, such as choosing learning, rate is required. Ex- periments
demonstrate... | [
{
"version": "v1",
"created": "Tue, 24 Feb 2009 20:38:32 GMT"
}
] | 2009-02-25T00:00:00 | [
[
"Potluru",
"Vamsi K.",
""
],
[
"Plis",
"Sergey M.",
""
],
[
"Morup",
"Morten",
""
],
[
"Calhoun",
"Vince D.",
""
],
[
"Lane",
"Terran",
""
]
] | TITLE: Multiplicative updates For Non-Negative Kernel SVM
ABSTRACT: We present multiplicative updates for solving hard and soft margin support
vector machines (SVM) with non-negative kernels. They follow as a natural
extension of the updates for non-negative matrix factorization. No additional
param- eter setting, ... |
0812.2318 | Fabrice Ardhuin | Fabrice Collard, Fabrice Ardhuin (SHOM), Bertrand Chapron (LOS) | Routine monitoring and analysis of ocean swell fields using a spaceborne
SAR | 14 pages. Submitted to Journal of Geophysical Research (revised) | null | null | null | physics.ao-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Satellite Synthetic Aperture Radar (SAR) observations can provide a global
view of ocean swell fields when using a specific "wave mode" sampling. A
methodology is presented to routinely derive integral properties of the longer
wavelength (swell) portion of the wave spectrum from SAR Level 2 products, and
both monitor... | [
{
"version": "v1",
"created": "Fri, 12 Dec 2008 08:55:00 GMT"
},
{
"version": "v2",
"created": "Fri, 9 Jan 2009 09:25:02 GMT"
},
{
"version": "v3",
"created": "Mon, 23 Feb 2009 15:13:16 GMT"
}
] | 2009-02-23T00:00:00 | [
[
"Collard",
"Fabrice",
"",
"SHOM"
],
[
"Ardhuin",
"Fabrice",
"",
"SHOM"
],
[
"Chapron",
"Bertrand",
"",
"LOS"
]
] | TITLE: Routine monitoring and analysis of ocean swell fields using a spaceborne
SAR
ABSTRACT: Satellite Synthetic Aperture Radar (SAR) observations can provide a global
view of ocean swell fields when using a specific "wave mode" sampling. A
methodology is presented to routinely derive integral properties of the ... |
0804.1441 | Ratthachat Chatpatanasiri | Ratthachat Chatpatanasiri, Teesid Korsrilabutr, Pasakorn
Tangchanachaianan and Boonserm Kijsirikul | On Kernelization of Supervised Mahalanobis Distance Learners | 23 pages, 5 figures. There is a seriously wrong formula in derivation
of a gradient formula of the "kernel NCA" in the two previous versions. In
this new version, a new theoretical result is provided to properly account
kernel NCA | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper focuses on the problem of kernelizing an existing supervised
Mahalanobis distance learner. The following features are included in the paper.
Firstly, three popular learners, namely, "neighborhood component analysis",
"large margin nearest neighbors" and "discriminant neighborhood embedding",
which do not h... | [
{
"version": "v1",
"created": "Wed, 9 Apr 2008 09:40:51 GMT"
},
{
"version": "v2",
"created": "Sat, 20 Dec 2008 09:51:46 GMT"
},
{
"version": "v3",
"created": "Fri, 30 Jan 2009 02:19:27 GMT"
}
] | 2009-01-30T00:00:00 | [
[
"Chatpatanasiri",
"Ratthachat",
""
],
[
"Korsrilabutr",
"Teesid",
""
],
[
"Tangchanachaianan",
"Pasakorn",
""
],
[
"Kijsirikul",
"Boonserm",
""
]
] | TITLE: On Kernelization of Supervised Mahalanobis Distance Learners
ABSTRACT: This paper focuses on the problem of kernelizing an existing supervised
Mahalanobis distance learner. The following features are included in the paper.
Firstly, three popular learners, namely, "neighborhood component analysis",
"large mar... |
0809.1181 | Robert Grossman | Yunhong Gu and Robert L Grossman | Sector and Sphere: Towards Simplified Storage and Processing of Large
Scale Distributed Data | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cloud computing has demonstrated that processing very large datasets over
commodity clusters can be done simply given the right programming model and
infrastructure. In this paper, we describe the design and implementation of the
Sector storage cloud and the Sphere compute cloud. In contrast to existing
storage and c... | [
{
"version": "v1",
"created": "Sat, 6 Sep 2008 18:37:51 GMT"
},
{
"version": "v2",
"created": "Sat, 17 Jan 2009 00:34:47 GMT"
}
] | 2009-01-17T00:00:00 | [
[
"Gu",
"Yunhong",
""
],
[
"Grossman",
"Robert L",
""
]
] | TITLE: Sector and Sphere: Towards Simplified Storage and Processing of Large
Scale Distributed Data
ABSTRACT: Cloud computing has demonstrated that processing very large datasets over
commodity clusters can be done simply given the right programming model and
infrastructure. In this paper, we describe the design ... |
0901.0489 | Pascal Pernot | Pascal Pernot (LCPO) | Scaling factors for ab initio vibrational frequencies: comparison of
uncertainty models for quantified prediction | null | null | null | null | physics.data-an physics.chem-ph physics.class-ph stat.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Bayesian Model Calibration is used to revisit the problem of scaling factor
calibration for semi-empirical correction of ab initio calculations. A
particular attention is devoted to uncertainty evaluation for scaling factors,
and to their effect on prediction of observables involving scaled properties.
We argue that ... | [
{
"version": "v1",
"created": "Mon, 5 Jan 2009 14:35:30 GMT"
}
] | 2009-01-12T00:00:00 | [
[
"Pernot",
"Pascal",
"",
"LCPO"
]
] | TITLE: Scaling factors for ab initio vibrational frequencies: comparison of
uncertainty models for quantified prediction
ABSTRACT: Bayesian Model Calibration is used to revisit the problem of scaling factor
calibration for semi-empirical correction of ab initio calculations. A
particular attention is devoted to u... |
0901.0537 | Ian Ross | Ian Ross (University of Bristol) | Nonlinear Dimensionality Reduction Methods in Climate Data Analysis | 273 pages, 76 figures; University of Bristol Ph.D. thesis; version
with high-resolution figures available from
http://www.skybluetrades.net/thesis/ian-ross-thesis.pdf (52Mb download) | null | null | null | physics.ao-ph physics.data-an | http://creativecommons.org/licenses/by/3.0/ | Linear dimensionality reduction techniques, notably principal component
analysis, are widely used in climate data analysis as a means to aid in the
interpretation of datasets of high dimensionality. These linear methods may not
be appropriate for the analysis of data arising from nonlinear processes
occurring in the ... | [
{
"version": "v1",
"created": "Fri, 2 Jan 2009 16:33:30 GMT"
}
] | 2009-01-06T00:00:00 | [
[
"Ross",
"Ian",
"",
"University of Bristol"
]
] | TITLE: Nonlinear Dimensionality Reduction Methods in Climate Data Analysis
ABSTRACT: Linear dimensionality reduction techniques, notably principal component
analysis, are widely used in climate data analysis as a means to aid in the
interpretation of datasets of high dimensionality. These linear methods may not
be ... |
0812.5032 | Qiang Li | Qiang Li, Yan He, Jing-ping Jiang | A New Clustering Algorithm Based Upon Flocking On Complex Network | 18 pages, 4 figures, 3 tables | null | null | null | cs.LG cs.AI cs.CV physics.soc-ph | http://creativecommons.org/licenses/by-nc-sa/3.0/ | We have proposed a model based upon flocking on a complex network, and then
developed two clustering algorithms on the basis of it. In the algorithms,
firstly a \textit{k}-nearest neighbor (knn) graph as a weighted and directed
graph is produced among all data points in a dataset each of which is regarded
as an agent... | [
{
"version": "v1",
"created": "Tue, 30 Dec 2008 08:30:27 GMT"
}
] | 2008-12-31T00:00:00 | [
[
"Li",
"Qiang",
""
],
[
"He",
"Yan",
""
],
[
"Jiang",
"Jing-ping",
""
]
] | TITLE: A New Clustering Algorithm Based Upon Flocking On Complex Network
ABSTRACT: We have proposed a model based upon flocking on a complex network, and then
developed two clustering algorithms on the basis of it. In the algorithms,
firstly a \textit{k}-nearest neighbor (knn) graph as a weighted and directed
graph... |
0812.4460 | Ernesto Diaz-Aviles | Ernesto Diaz-Aviles, Lars Schmidt-Thieme and Cai-Nicolas Ziegler | Emergence of Spontaneous Order Through Neighborhood Formation in
Peer-to-Peer Recommender Systems | WWW '05 International Workshop on Innovations in Web Infrastructure
(IWI '05) May 10, 2005, Chiba, Japan | WWW '05 International Workshop on Innovations in Web
Infrastructure (IWI '05) May 10, 2005, Chiba, Japan | null | null | cs.AI cs.IR cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The advent of the Semantic Web necessitates paradigm shifts away from
centralized client/server architectures towards decentralization and
peer-to-peer computation, making the existence of central authorities
superfluous and even impossible. At the same time, recommender systems are
gaining considerable impact in e-c... | [
{
"version": "v1",
"created": "Tue, 23 Dec 2008 23:26:27 GMT"
}
] | 2008-12-25T00:00:00 | [
[
"Diaz-Aviles",
"Ernesto",
""
],
[
"Schmidt-Thieme",
"Lars",
""
],
[
"Ziegler",
"Cai-Nicolas",
""
]
] | TITLE: Emergence of Spontaneous Order Through Neighborhood Formation in
Peer-to-Peer Recommender Systems
ABSTRACT: The advent of the Semantic Web necessitates paradigm shifts away from
centralized client/server architectures towards decentralization and
peer-to-peer computation, making the existence of central au... |
0802.1430 | Francis Bach | Jacob Abernethy, Francis Bach (INRIA Rocquencourt), Theodoros
Evgeniou, Jean-Philippe Vert (CB) | A New Approach to Collaborative Filtering: Operator Estimation with
Spectral Regularization | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a general approach for collaborative filtering (CF) using spectral
regularization to learn linear operators from "users" to the "objects" they
rate. Recent low-rank type matrix completion approaches to CF are shown to be
special cases. However, unlike existing regularization based CF methods, our
approach ... | [
{
"version": "v1",
"created": "Mon, 11 Feb 2008 12:55:34 GMT"
},
{
"version": "v2",
"created": "Fri, 19 Dec 2008 14:05:14 GMT"
}
] | 2008-12-19T00:00:00 | [
[
"Abernethy",
"Jacob",
"",
"INRIA Rocquencourt"
],
[
"Bach",
"Francis",
"",
"INRIA Rocquencourt"
],
[
"Evgeniou",
"Theodoros",
"",
"CB"
],
[
"Vert",
"Jean-Philippe",
"",
"CB"
]
] | TITLE: A New Approach to Collaborative Filtering: Operator Estimation with
Spectral Regularization
ABSTRACT: We present a general approach for collaborative filtering (CF) using spectral
regularization to learn linear operators from "users" to the "objects" they
rate. Recent low-rank type matrix completion approa... |
0804.1302 | Francis Bach | Francis Bach (INRIA Rocquencourt) | Bolasso: model consistent Lasso estimation through the bootstrap | null | null | null | null | cs.LG math.ST stat.ML stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the least-square linear regression problem with regularization by
the l1-norm, a problem usually referred to as the Lasso. In this paper, we
present a detailed asymptotic analysis of model consistency of the Lasso. For
various decays of the regularization parameter, we compute asymptotic
equivalents of th... | [
{
"version": "v1",
"created": "Tue, 8 Apr 2008 15:40:03 GMT"
}
] | 2008-12-18T00:00:00 | [
[
"Bach",
"Francis",
"",
"INRIA Rocquencourt"
]
] | TITLE: Bolasso: model consistent Lasso estimation through the bootstrap
ABSTRACT: We consider the least-square linear regression problem with regularization by
the l1-norm, a problem usually referred to as the Lasso. In this paper, we
present a detailed asymptotic analysis of model consistency of the Lasso. For
var... |
0806.3708 | Jocelyne Troccaz | S\'ebastien Martin (TIMC), Vincent Daanen (TIMC), Jocelyne Troccaz
(TIMC) | Atlas-Based Prostate Segmentation Using an Hybrid Registration | International Journal of Computer Assisted Radiology and Surgery
(2008) 000-999 | null | null | null | cs.OH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Purpose: This paper presents the preliminary results of a semi-automatic
method for prostate segmentation of Magnetic Resonance Images (MRI) which aims
to be incorporated in a navigation system for prostate brachytherapy. Methods:
The method is based on the registration of an anatomical atlas computed from a
populati... | [
{
"version": "v1",
"created": "Mon, 23 Jun 2008 15:43:28 GMT"
}
] | 2008-12-18T00:00:00 | [
[
"Martin",
"Sébastien",
"",
"TIMC"
],
[
"Daanen",
"Vincent",
"",
"TIMC"
],
[
"Troccaz",
"Jocelyne",
"",
"TIMC"
]
] | TITLE: Atlas-Based Prostate Segmentation Using an Hybrid Registration
ABSTRACT: Purpose: This paper presents the preliminary results of a semi-automatic
method for prostate segmentation of Magnetic Resonance Images (MRI) which aims
to be incorporated in a navigation system for prostate brachytherapy. Methods:
The m... |
0812.1357 | Qiang Li | Qiang Li, Yan He, Jing-ping Jiang | A Novel Clustering Algorithm Based on Quantum Random Walk | 14 pages, 6 figures, 3 tables | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-sa/3.0/ | The enormous successes have been made by quantum algorithms during the last
decade. In this paper, we combine the quantum random walk (QRW) with the
problem of data clustering, and develop two clustering algorithms based on the
one dimensional QRW. Then, the probability distributions on the positions
induced by QRW i... | [
{
"version": "v1",
"created": "Sun, 7 Dec 2008 15:22:27 GMT"
}
] | 2008-12-09T00:00:00 | [
[
"Li",
"Qiang",
""
],
[
"He",
"Yan",
""
],
[
"Jiang",
"Jing-ping",
""
]
] | TITLE: A Novel Clustering Algorithm Based on Quantum Random Walk
ABSTRACT: The enormous successes have been made by quantum algorithms during the last
decade. In this paper, we combine the quantum random walk (QRW) with the
problem of data clustering, and develop two clustering algorithms based on the
one dimension... |
0801.3263 | Rosane Freire Riera | A.A.G. Cortines, R. Riera, C. Anteneodo | From short to fat tails in financial markets: A unified description | 11 pages, 5 figures | European Journal of Physics B, volume 60, p. 385, 2007 | null | null | q-fin.ST cond-mat.stat-mech physics.soc-ph | null | In complex systems such as turbulent flows and financial markets, the
dynamics in long and short time-lags, signaled by Gaussian and fat-tailed
statistics, respectively, calls for a unified description. To address this
issue we analyze a real dataset, namely, price fluctuations, in a wide range of
temporal scales to ... | [
{
"version": "v1",
"created": "Mon, 21 Jan 2008 19:30:12 GMT"
}
] | 2008-12-02T00:00:00 | [
[
"Cortines",
"A. A. G.",
""
],
[
"Riera",
"R.",
""
],
[
"Anteneodo",
"C.",
""
]
] | TITLE: From short to fat tails in financial markets: A unified description
ABSTRACT: In complex systems such as turbulent flows and financial markets, the
dynamics in long and short time-lags, signaled by Gaussian and fat-tailed
statistics, respectively, calls for a unified description. To address this
issue we ana... |
physics/0511101 | Fengzhong Wang | Fengzhong Wang, Kazuko Yamasaki, Shlomo Havlin and H. Eugene Stanley | Scaling and memory of intraday volatility return intervals in stock
market | 19 pages, 8 figures | Phys. Rev. E 73, 026117 (2006) | 10.1103/PhysRevE.73.026117 | null | physics.soc-ph q-fin.ST | null | We study the return interval $\tau$ between price volatilities that are above
a certain threshold $q$ for 31 intraday datasets, including the Standard &
Poor's 500 index and the 30 stocks that form the Dow Jones Industrial index.
For different threshold $q$, the probability density function $P_q(\tau)$
scales with th... | [
{
"version": "v1",
"created": "Fri, 11 Nov 2005 15:56:02 GMT"
}
] | 2008-12-02T00:00:00 | [
[
"Wang",
"Fengzhong",
""
],
[
"Yamasaki",
"Kazuko",
""
],
[
"Havlin",
"Shlomo",
""
],
[
"Stanley",
"H. Eugene",
""
]
] | TITLE: Scaling and memory of intraday volatility return intervals in stock
market
ABSTRACT: We study the return interval $\tau$ between price volatilities that are above
a certain threshold $q$ for 31 intraday datasets, including the Standard &
Poor's 500 index and the 30 stocks that form the Dow Jones Industrial... |
astro-ph/0012539 | John Webb | J.K. Webb, M.T. Murphy, V.V. Flambaum, V.A. Dzuba, J.D. Barrow, C.W.
Churchill, J.X. Prochaska, A.M. Wolfe | Further Evidence for Cosmological Evolution of the Fine Structure
Constant | 5 pages, 1 figure. Published in Phys. Rev. Lett. Small changes to
discussion, added an acknowledgement and a reference | Phys.Rev.Lett.87:091301,2001 | 10.1103/PhysRevLett.87.091301 | null | astro-ph gr-qc hep-ph hep-th physics.atom-ph | null | We describe the results of a search for time variability of the fine
structure constant, alpha, using absorption systems in the spectra of distant
quasars. Three large optical datasets and two 21cm/mm absorption systems
provide four independent samples, spanning 23% to 87% of the age of the
universe. Each sample yiel... | [
{
"version": "v1",
"created": "Fri, 29 Dec 2000 16:22:11 GMT"
},
{
"version": "v2",
"created": "Fri, 19 Jan 2001 02:17:52 GMT"
},
{
"version": "v3",
"created": "Tue, 4 Sep 2001 05:50:36 GMT"
}
] | 2008-11-26T00:00:00 | [
[
"Webb",
"J. K.",
""
],
[
"Murphy",
"M. T.",
""
],
[
"Flambaum",
"V. V.",
""
],
[
"Dzuba",
"V. A.",
""
],
[
"Barrow",
"J. D.",
""
],
[
"Churchill",
"C. W.",
""
],
[
"Prochaska",
"J. X.",
""
],
[
"Wol... | TITLE: Further Evidence for Cosmological Evolution of the Fine Structure
Constant
ABSTRACT: We describe the results of a search for time variability of the fine
structure constant, alpha, using absorption systems in the spectra of distant
quasars. Three large optical datasets and two 21cm/mm absorption systems
pr... |
0811.2055 | Tamas Szalay | Tamas Szalay, Volker Springel, Gerard Lemson | GPU-Based Interactive Visualization of Billion Point Cosmological
Simulations | 2008 Microsoft eScience conference | null | null | null | cs.GR astro-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite the recent advances in graphics hardware capabilities, a brute force
approach is incapable of interactively displaying terabytes of data. We have
implemented a system that uses hierarchical level-of-detailing for the results
of cosmological simulations, in order to display visually accurate results
without lo... | [
{
"version": "v1",
"created": "Thu, 13 Nov 2008 09:34:42 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Nov 2008 20:31:15 GMT"
}
] | 2008-11-18T00:00:00 | [
[
"Szalay",
"Tamas",
""
],
[
"Springel",
"Volker",
""
],
[
"Lemson",
"Gerard",
""
]
] | TITLE: GPU-Based Interactive Visualization of Billion Point Cosmological
Simulations
ABSTRACT: Despite the recent advances in graphics hardware capabilities, a brute force
approach is incapable of interactively displaying terabytes of data. We have
implemented a system that uses hierarchical level-of-detailing fo... |
0810.1648 | Danny Bickson | Danny Bickson, Elad Yom-Tov and Danny Dolev | A Gaussian Belief Propagation Solver for Large Scale Support Vector
Machines | 12 pages, 1 figure, appeared in the 5th European Complex Systems
Conference, Jerusalem, Sept. 2008 | The 5th European Complex Systems Conference (ECCS 2008),
Jerusalem, Sept. 2008 | null | null | cs.LG cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Support vector machines (SVMs) are an extremely successful type of
classification and regression algorithms. Building an SVM entails solving a
constrained convex quadratic programming problem, which is quadratic in the
number of training samples. We introduce an efficient parallel implementation
of an support vector ... | [
{
"version": "v1",
"created": "Thu, 9 Oct 2008 12:56:43 GMT"
}
] | 2008-11-15T00:00:00 | [
[
"Bickson",
"Danny",
""
],
[
"Yom-Tov",
"Elad",
""
],
[
"Dolev",
"Danny",
""
]
] | TITLE: A Gaussian Belief Propagation Solver for Large Scale Support Vector
Machines
ABSTRACT: Support vector machines (SVMs) are an extremely successful type of
classification and regression algorithms. Building an SVM entails solving a
constrained convex quadratic programming problem, which is quadratic in the
n... |
0811.1711 | Tshilidzi Marwala | Sarah Wright and Tshilidzi Marwala | Artificial Intelligence Techniques for Steam Generator Modelling | 23 pages | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper investigates the use of different Artificial Intelligence methods
to predict the values of several continuous variables from a Steam Generator.
The objective was to determine how the different artificial intelligence
methods performed in making predictions on the given dataset. The artificial
intelligence ... | [
{
"version": "v1",
"created": "Tue, 11 Nov 2008 14:09:36 GMT"
}
] | 2008-11-12T00:00:00 | [
[
"Wright",
"Sarah",
""
],
[
"Marwala",
"Tshilidzi",
""
]
] | TITLE: Artificial Intelligence Techniques for Steam Generator Modelling
ABSTRACT: This paper investigates the use of different Artificial Intelligence methods
to predict the values of several continuous variables from a Steam Generator.
The objective was to determine how the different artificial intelligence
method... |
0810.5582 | Shubha Nabar | Rajeev Motwani, Shubha U. Nabar | Anonymizing Unstructured Data | 9 pages, 1 figure | null | null | null | cs.DB cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we consider the problem of anonymizing datasets in which each
individual is associated with a set of items that constitute private
information about the individual. Illustrative datasets include market-basket
datasets and search engine query logs. We formalize the notion of k-anonymity
for set-valued da... | [
{
"version": "v1",
"created": "Fri, 31 Oct 2008 19:25:02 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Nov 2008 23:33:20 GMT"
}
] | 2008-11-04T00:00:00 | [
[
"Motwani",
"Rajeev",
""
],
[
"Nabar",
"Shubha U.",
""
]
] | TITLE: Anonymizing Unstructured Data
ABSTRACT: In this paper we consider the problem of anonymizing datasets in which each
individual is associated with a set of items that constitute private
information about the individual. Illustrative datasets include market-basket
datasets and search engine query logs. We form... |
0810.5758 | Renat Nuriyev | Renat Nuriyev | Non procedural language for parallel programs | 20 pages, will be printed in "Programming" magazine of RAS | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Probably building non procedural languages is the most prospective way for
parallel programming just because non procedural means no fixed way for
execution. The article consists of 3 parts. In first part we consider formal
systems for definition a named datasets and studying an expression power of
different subclass... | [
{
"version": "v1",
"created": "Fri, 31 Oct 2008 18:44:38 GMT"
}
] | 2008-11-03T00:00:00 | [
[
"Nuriyev",
"Renat",
""
]
] | TITLE: Non procedural language for parallel programs
ABSTRACT: Probably building non procedural languages is the most prospective way for
parallel programming just because non procedural means no fixed way for
execution. The article consists of 3 parts. In first part we consider formal
systems for definition a name... |
0810.5407 | Aleksandar Stojmirovi\'c | Aleksandar Stojmirovic | Quasi-metrics, Similarities and Searches: aspects of geometry of protein
datasets | 299 pages, 44 figures, 10 tables, 9 algorithms. PhD thesis in
mathematics defended in May 2005 at the Victoria University of Wellington,
Wellington, New Zealand (supervisors: Prof. Vladimir Pestov and Dr. Bill
Jordan) | null | null | null | cs.IR math.GN q-bio.QM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A quasi-metric is a distance function which satisfies the triangle inequality
but is not symmetric: it can be thought of as an asymmetric metric. The central
result of this thesis, developed in Chapter 3, is that a natural correspondence
exists between similarity measures between biological (nucleotide or protein)
se... | [
{
"version": "v1",
"created": "Thu, 30 Oct 2008 03:14:17 GMT"
}
] | 2008-10-31T00:00:00 | [
[
"Stojmirovic",
"Aleksandar",
""
]
] | TITLE: Quasi-metrics, Similarities and Searches: aspects of geometry of protein
datasets
ABSTRACT: A quasi-metric is a distance function which satisfies the triangle inequality
but is not symmetric: it can be thought of as an asymmetric metric. The central
result of this thesis, developed in Chapter 3, is that a ... |
0810.5484 | Qiang Li | Qiang Li, Yan He, Jing-ping Jiang | A Novel Clustering Algorithm Based on a Modified Model of Random Walk | 21 pages, 13 figures | null | null | null | cs.LG cs.AI cs.MA | http://creativecommons.org/licenses/by-nc-sa/3.0/ | We introduce a modified model of random walk, and then develop two novel
clustering algorithms based on it. In the algorithms, each data point in a
dataset is considered as a particle which can move at random in space according
to the preset rules in the modified model. Further, this data point may be also
viewed as ... | [
{
"version": "v1",
"created": "Thu, 30 Oct 2008 13:26:31 GMT"
}
] | 2008-10-31T00:00:00 | [
[
"Li",
"Qiang",
""
],
[
"He",
"Yan",
""
],
[
"Jiang",
"Jing-ping",
""
]
] | TITLE: A Novel Clustering Algorithm Based on a Modified Model of Random Walk
ABSTRACT: We introduce a modified model of random walk, and then develop two novel
clustering algorithms based on it. In the algorithms, each data point in a
dataset is considered as a particle which can move at random in space according
t... |
0801.3654 | Mikhail Zaslavskiy | Mikhail Zaslavskiy, Francis Bach, and Jean-Philippe Vert | A path following algorithm for the graph matching problem | 23 pages, 13 figures,typo correction, new results in sections 4,5,6 | null | null | null | cs.CV cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a convex-concave programming approach for the labeled weighted
graph matching problem. The convex-concave programming formulation is obtained
by rewriting the weighted graph matching problem as a least-square problem on
the set of permutation matrices and relaxing it to two different optimization
problems:... | [
{
"version": "v1",
"created": "Wed, 23 Jan 2008 20:20:32 GMT"
},
{
"version": "v2",
"created": "Mon, 27 Oct 2008 14:16:01 GMT"
}
] | 2008-10-27T00:00:00 | [
[
"Zaslavskiy",
"Mikhail",
""
],
[
"Bach",
"Francis",
""
],
[
"Vert",
"Jean-Philippe",
""
]
] | TITLE: A path following algorithm for the graph matching problem
ABSTRACT: We propose a convex-concave programming approach for the labeled weighted
graph matching problem. The convex-concave programming formulation is obtained
by rewriting the weighted graph matching problem as a least-square problem on
the set of... |
0810.2764 | Nir Ailon | Nir Ailon | A Simple Linear Ranking Algorithm Using Query Dependent Intercept
Variables | 5 pages | null | null | null | cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The LETOR website contains three information retrieval datasets used as a
benchmark for testing machine learning ideas for ranking. Algorithms
participating in the challenge are required to assign score values to search
results for a collection of queries, and are measured using standard IR ranking
measures (NDCG, pr... | [
{
"version": "v1",
"created": "Wed, 15 Oct 2008 19:03:10 GMT"
}
] | 2008-10-16T00:00:00 | [
[
"Ailon",
"Nir",
""
]
] | TITLE: A Simple Linear Ranking Algorithm Using Query Dependent Intercept
Variables
ABSTRACT: The LETOR website contains three information retrieval datasets used as a
benchmark for testing machine learning ideas for ranking. Algorithms
participating in the challenge are required to assign score values to search
r... |
0810.1355 | Michael Mahoney | Jure Leskovec, Kevin J. Lang, Anirban Dasgupta, and Michael W. Mahoney | Community Structure in Large Networks: Natural Cluster Sizes and the
Absence of Large Well-Defined Clusters | 66 pages, a much expanded version of our WWW 2008 paper | null | null | null | cs.DS physics.data-an physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A large body of work has been devoted to defining and identifying clusters or
communities in social and information networks. We explore from a novel
perspective several questions related to identifying meaningful communities in
large social and information networks, and we come to several striking
conclusions. We em... | [
{
"version": "v1",
"created": "Wed, 8 Oct 2008 05:42:43 GMT"
}
] | 2008-10-13T00:00:00 | [
[
"Leskovec",
"Jure",
""
],
[
"Lang",
"Kevin J.",
""
],
[
"Dasgupta",
"Anirban",
""
],
[
"Mahoney",
"Michael W.",
""
]
] | TITLE: Community Structure in Large Networks: Natural Cluster Sizes and the
Absence of Large Well-Defined Clusters
ABSTRACT: A large body of work has been devoted to defining and identifying clusters or
communities in social and information networks. We explore from a novel
perspective several questions related t... |
0810.1426 | Matthew Wallace | Matthew L. Wallace, Vincent Larivi\`ere, Yves Gingras | Modeling a Century of Citation Distributions | 20 pages, 5 figures | null | null | null | physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Changes in citation distributions over 100 years can reveal much about the
evolution of the scientific communities or disciplines. The prevalence of
uncited papers or of highly-cited papers, with respect to the bulk of
publications, provides important clues as to the dynamics of scientific
research. Using 25 million ... | [
{
"version": "v1",
"created": "Wed, 8 Oct 2008 13:14:22 GMT"
}
] | 2008-10-09T00:00:00 | [
[
"Wallace",
"Matthew L.",
""
],
[
"Larivière",
"Vincent",
""
],
[
"Gingras",
"Yves",
""
]
] | TITLE: Modeling a Century of Citation Distributions
ABSTRACT: Changes in citation distributions over 100 years can reveal much about the
evolution of the scientific communities or disciplines. The prevalence of
uncited papers or of highly-cited papers, with respect to the bulk of
publications, provides important cl... |
0809.3618 | Julian McAuley | Julian J. McAuley, Tiberio S. Caetano, Alexander J. Smola | Robust Near-Isometric Matching via Structured Learning of Graphical
Models | 11 pages, 9 figures | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Models for near-rigid shape matching are typically based on distance-related
features, in order to infer matches that are consistent with the isometric
assumption. However, real shapes from image datasets, even when expected to be
related by "almost isometric" transformations, are actually subject not only to
noise b... | [
{
"version": "v1",
"created": "Sun, 21 Sep 2008 23:23:26 GMT"
}
] | 2008-09-23T00:00:00 | [
[
"McAuley",
"Julian J.",
""
],
[
"Caetano",
"Tiberio S.",
""
],
[
"Smola",
"Alexander J.",
""
]
] | TITLE: Robust Near-Isometric Matching via Structured Learning of Graphical
Models
ABSTRACT: Models for near-rigid shape matching are typically based on distance-related
features, in order to infer matches that are consistent with the isometric
assumption. However, real shapes from image datasets, even when expect... |
0809.3415 | Cl\'emence Magnien | Frederic Aidouni, Matthieu Latapy and Clemence Magnien | Ten weeks in the life of an eDonkey server | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a capture of the queries managed by an eDonkey server
during almost 10 weeks, leading to the observation of almost 9 billion messages
involving almost 90 million users and more than 275 million distinct files.
Acquisition and management of such data raises several challenges, which we
discuss as w... | [
{
"version": "v1",
"created": "Fri, 19 Sep 2008 16:45:26 GMT"
}
] | 2008-09-22T00:00:00 | [
[
"Aidouni",
"Frederic",
""
],
[
"Latapy",
"Matthieu",
""
],
[
"Magnien",
"Clemence",
""
]
] | TITLE: Ten weeks in the life of an eDonkey server
ABSTRACT: This paper presents a capture of the queries managed by an eDonkey server
during almost 10 weeks, leading to the observation of almost 9 billion messages
involving almost 90 million users and more than 275 million distinct files.
Acquisition and management... |
0809.2085 | Laurent Jacob | Laurent Jacob, Francis Bach (INRIA Rocquencourt), Jean-Philippe Vert | Clustered Multi-Task Learning: A Convex Formulation | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In multi-task learning several related tasks are considered simultaneously,
with the hope that by an appropriate sharing of information across tasks, each
task may benefit from the others. In the context of learning linear functions
for supervised classification or regression, this can be achieved by including
a prio... | [
{
"version": "v1",
"created": "Thu, 11 Sep 2008 19:01:39 GMT"
}
] | 2008-09-12T00:00:00 | [
[
"Jacob",
"Laurent",
"",
"INRIA Rocquencourt"
],
[
"Bach",
"Francis",
"",
"INRIA Rocquencourt"
],
[
"Vert",
"Jean-Philippe",
""
]
] | TITLE: Clustered Multi-Task Learning: A Convex Formulation
ABSTRACT: In multi-task learning several related tasks are considered simultaneously,
with the hope that by an appropriate sharing of information across tasks, each
task may benefit from the others. In the context of learning linear functions
for supervised... |
0809.1493 | Francis Bach | Francis Bach (INRIA Rocquencourt) | Exploring Large Feature Spaces with Hierarchical Multiple Kernel
Learning | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For supervised and unsupervised learning, positive definite kernels allow to
use large and potentially infinite dimensional feature spaces with a
computational cost that only depends on the number of observations. This is
usually done through the penalization of predictor functions by Euclidean or
Hilbertian norms. I... | [
{
"version": "v1",
"created": "Tue, 9 Sep 2008 06:48:10 GMT"
}
] | 2008-09-10T00:00:00 | [
[
"Bach",
"Francis",
"",
"INRIA Rocquencourt"
]
] | TITLE: Exploring Large Feature Spaces with Hierarchical Multiple Kernel
Learning
ABSTRACT: For supervised and unsupervised learning, positive definite kernels allow to
use large and potentially infinite dimensional feature spaces with a
computational cost that only depends on the number of observations. This is
u... |
0808.3535 | Ioan Raicu | Ioan Raicu, Yong Zhao, Ian Foster, Alex Szalay | Data Diffusion: Dynamic Resource Provision and Data-Aware Scheduling for
Data Intensive Applications | 16 pages, 15 figures | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data intensive applications often involve the analysis of large datasets that
require large amounts of compute and storage resources. While dedicated compute
and/or storage farms offer good task/data throughput, they suffer low resource
utilization problem under varying workloads conditions. If we instead move such
d... | [
{
"version": "v1",
"created": "Tue, 26 Aug 2008 15:19:44 GMT"
}
] | 2008-08-27T00:00:00 | [
[
"Raicu",
"Ioan",
""
],
[
"Zhao",
"Yong",
""
],
[
"Foster",
"Ian",
""
],
[
"Szalay",
"Alex",
""
]
] | TITLE: Data Diffusion: Dynamic Resource Provision and Data-Aware Scheduling for
Data Intensive Applications
ABSTRACT: Data intensive applications often involve the analysis of large datasets that
require large amounts of compute and storage resources. While dedicated compute
and/or storage farms offer good task/d... |
0807.3755 | Martin Klein | Martin Klein, Michael L. Nelson | Approximating Document Frequency with Term Count Values | 11 pages, 6 figures, 4 tables | null | null | null | cs.IR cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For bounded datasets such as the TREC Web Track (WT10g) the computation of
term frequency (TF) and inverse document frequency (IDF) is not difficult.
However, when the corpus is the entire web, direct IDF calculation is
impossible and values must instead be estimated. Most available datasets
provide values for term c... | [
{
"version": "v1",
"created": "Wed, 23 Jul 2008 21:44:46 GMT"
}
] | 2008-07-25T00:00:00 | [
[
"Klein",
"Martin",
""
],
[
"Nelson",
"Michael L.",
""
]
] | TITLE: Approximating Document Frequency with Term Count Values
ABSTRACT: For bounded datasets such as the TREC Web Track (WT10g) the computation of
term frequency (TF) and inverse document frequency (IDF) is not difficult.
However, when the corpus is the entire web, direct IDF calculation is
impossible and values m... |
0806.4703 | Feng Li | Feng Li and Shuigeng Zhou | Challenging More Updates: Towards Anonymous Re-publication of Fully
Dynamic Datasets | null | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most existing anonymization work has been done on static datasets, which have
no update and need only one-time publication. Recent studies consider
anonymizing dynamic datasets with external updates: the datasets are updated
with record insertions and/or deletions. This paper addresses a new problem:
anonymous re-pub... | [
{
"version": "v1",
"created": "Sat, 28 Jun 2008 16:24:03 GMT"
},
{
"version": "v2",
"created": "Thu, 24 Jul 2008 08:24:57 GMT"
}
] | 2008-07-24T00:00:00 | [
[
"Li",
"Feng",
""
],
[
"Zhou",
"Shuigeng",
""
]
] | TITLE: Challenging More Updates: Towards Anonymous Re-publication of Fully
Dynamic Datasets
ABSTRACT: Most existing anonymization work has been done on static datasets, which have
no update and need only one-time publication. Recent studies consider
anonymizing dynamic datasets with external updates: the datasets... |
0807.2097 | Seung Ki Baek | Seung Ki Baek, Tae Young Kim, Beom Jun Kim | Testing a priority-based queue model with Linux command histories | 17 pages, 17 figures | Physica A 387, 3660 (2008) | 10.1016/j.physa.2008.02.021 | null | physics.data-an physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study human dynamics by analyzing Linux history files. The goodness-of-fit
test shows that most of the collected datasets belong to the universality class
suggested in the literature by a variable-length queueing process based on
priority. In order to check the validity of this model, we design two tests
based on ... | [
{
"version": "v1",
"created": "Mon, 14 Jul 2008 07:26:54 GMT"
}
] | 2008-07-15T00:00:00 | [
[
"Baek",
"Seung Ki",
""
],
[
"Kim",
"Tae Young",
""
],
[
"Kim",
"Beom Jun",
""
]
] | TITLE: Testing a priority-based queue model with Linux command histories
ABSTRACT: We study human dynamics by analyzing Linux history files. The goodness-of-fit
test shows that most of the collected datasets belong to the universality class
suggested in the literature by a variable-length queueing process based on
... |
0806.4686 | Tong Zhang | John Langford, Lihong Li, Tong Zhang | Sparse Online Learning via Truncated Gradient | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a general method called truncated gradient to induce sparsity in
the weights of online learning algorithms with convex loss functions. This
method has several essential properties: The degree of sparsity is continuous
-- a parameter controls the rate of sparsification from no sparsification to
total sparsi... | [
{
"version": "v1",
"created": "Sat, 28 Jun 2008 14:19:50 GMT"
},
{
"version": "v2",
"created": "Fri, 4 Jul 2008 01:58:32 GMT"
}
] | 2008-07-04T00:00:00 | [
[
"Langford",
"John",
""
],
[
"Li",
"Lihong",
""
],
[
"Zhang",
"Tong",
""
]
] | TITLE: Sparse Online Learning via Truncated Gradient
ABSTRACT: We propose a general method called truncated gradient to induce sparsity in
the weights of online learning algorithms with convex loss functions. This
method has several essential properties: The degree of sparsity is continuous
-- a parameter controls ... |
0806.2833 | Robert Cameron | R. Cameron M. Sch\"ussler | A robust correlation between growth rate and amplitude of solar cycles:
consequences for prediction methods | ApJ accepted | null | null | null | astro-ph physics.space-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the statistical relationship between the growth rate of activity
in the early phase of a solar cycle with its subsequent amplitude on the basis
of four datasets of global activity indices (Wolf sunspot number, group sunspot
number, sunspot area, and 10.7-cm radio flux). In all cases, a significant
correla... | [
{
"version": "v1",
"created": "Tue, 17 Jun 2008 16:25:40 GMT"
}
] | 2008-06-18T00:00:00 | [
[
"Schüssler",
"R. Cameron M.",
""
]
] | TITLE: A robust correlation between growth rate and amplitude of solar cycles:
consequences for prediction methods
ABSTRACT: We consider the statistical relationship between the growth rate of activity
in the early phase of a solar cycle with its subsequent amplitude on the basis
of four datasets of global activi... |
0805.4508 | Hong Tang | Hong Tang, Nozha Boujemma, Yunhao Chen | Modeling Loosely Annotated Images with Imagined Annotations | 10 pages | null | null | null | cs.IR cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we present an approach to learning latent semantic analysis
models from loosely annotated images for automatic image annotation and
indexing. The given annotation in training images is loose due to: (1)
ambiguous correspondences between visual features and annotated keywords; (2)
incomplete lists of an... | [
{
"version": "v1",
"created": "Thu, 29 May 2008 10:35:29 GMT"
}
] | 2008-05-30T00:00:00 | [
[
"Tang",
"Hong",
""
],
[
"Boujemma",
"Nozha",
""
],
[
"Chen",
"Yunhao",
""
]
] | TITLE: Modeling Loosely Annotated Images with Imagined Annotations
ABSTRACT: In this paper, we present an approach to learning latent semantic analysis
models from loosely annotated images for automatic image annotation and
indexing. The given annotation in training images is loose due to: (1)
ambiguous corresponde... |
0803.0034 | Leonid Andreev V | Leonid Andreev | From a set of parts to an indivisible whole. Part I: Operations in a
closed mode | 28 pages, 10 figures; typos in equations (4) and (5) corrected | null | null | null | cs.OH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper provides a description of a new method for information processing
based on holistic approach wherein analysis is a direct product of synthesis.
The core of the method is iterative averaging of all the elements of a system
according to all the parameters describing the elements. Contrary to common
logic, th... | [
{
"version": "v1",
"created": "Sat, 1 Mar 2008 01:58:59 GMT"
},
{
"version": "v2",
"created": "Wed, 28 May 2008 04:43:14 GMT"
}
] | 2008-05-28T00:00:00 | [
[
"Andreev",
"Leonid",
""
]
] | TITLE: From a set of parts to an indivisible whole. Part I: Operations in a
closed mode
ABSTRACT: This paper provides a description of a new method for information processing
based on holistic approach wherein analysis is a direct product of synthesis.
The core of the method is iterative averaging of all the elem... |
0805.2045 | Ciro Cattuto | Ciro Cattuto, Dominik Benz, Andreas Hotho, Gerd Stumme | Semantic Analysis of Tag Similarity Measures in Collaborative Tagging
Systems | 5 pages, 2 figures | null | null | null | cs.DL cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Social bookmarking systems allow users to organise collections of resources
on the Web in a collaborative fashion. The increasing popularity of these
systems as well as first insights into their emergent semantics have made them
relevant to disciplines like knowledge extraction and ontology learning. The
problem of d... | [
{
"version": "v1",
"created": "Wed, 14 May 2008 14:10:02 GMT"
}
] | 2008-05-15T00:00:00 | [
[
"Cattuto",
"Ciro",
""
],
[
"Benz",
"Dominik",
""
],
[
"Hotho",
"Andreas",
""
],
[
"Stumme",
"Gerd",
""
]
] | TITLE: Semantic Analysis of Tag Similarity Measures in Collaborative Tagging
Systems
ABSTRACT: Social bookmarking systems allow users to organise collections of resources
on the Web in a collaborative fashion. The increasing popularity of these
systems as well as first insights into their emergent semantics have ... |
0805.0120 | Stephen Vavasis | Michael Biggs, Ali Ghodsi, Stephen Vavasis | Nonnegative Matrix Factorization via Rank-One Downdate | null | null | null | null | cs.IR cs.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Nonnegative matrix factorization (NMF) was popularized as a tool for data
mining by Lee and Seung in 1999. NMF attempts to approximate a matrix with
nonnegative entries by a product of two low-rank matrices, also with
nonnegative entries. We propose an algorithm called rank-one downdate (R1D) for
computing a NMF that... | [
{
"version": "v1",
"created": "Thu, 1 May 2008 17:59:44 GMT"
}
] | 2008-05-02T00:00:00 | [
[
"Biggs",
"Michael",
""
],
[
"Ghodsi",
"Ali",
""
],
[
"Vavasis",
"Stephen",
""
]
] | TITLE: Nonnegative Matrix Factorization via Rank-One Downdate
ABSTRACT: Nonnegative matrix factorization (NMF) was popularized as a tool for data
mining by Lee and Seung in 1999. NMF attempts to approximate a matrix with
nonnegative entries by a product of two low-rank matrices, also with
nonnegative entries. We pr... |
0804.3417 | Nicholas M. Ball | Nicholas M. Ball (1), Robert J. Brunner (1 and 2), Adam D. Myers (1)
((1) Department of Astronomy, University of Illinois at Urbana-Champaign, (2)
National Center for Supercomputing Applications, Urbana-Champaign) | Robust Machine Learning Applied to Terascale Astronomical Datasets | 11 pages, 2 figures, uses llncs.cls. To appear in the 9th LCI
International Conference on High-Performance Clustered Computing | null | null | Not arXiv:0710.4482 | astro-ph cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present recent results from the LCDM (Laboratory for Cosmological Data
Mining; http://lcdm.astro.uiuc.edu) collaboration between UIUC Astronomy and
NCSA to deploy supercomputing cluster resources and machine learning algorithms
for the mining of terascale astronomical datasets. This is a novel application
in the f... | [
{
"version": "v1",
"created": "Mon, 21 Apr 2008 21:58:18 GMT"
}
] | 2008-04-29T00:00:00 | [
[
"Ball",
"Nicholas M.",
"",
"1 and 2"
],
[
"Brunner",
"Robert J.",
"",
"1 and 2"
],
[
"Myers",
"Adam D.",
""
]
] | TITLE: Robust Machine Learning Applied to Terascale Astronomical Datasets
ABSTRACT: We present recent results from the LCDM (Laboratory for Cosmological Data
Mining; http://lcdm.astro.uiuc.edu) collaboration between UIUC Astronomy and
NCSA to deploy supercomputing cluster resources and machine learning algorithms
f... |
cs/0512095 | Dmitri Krioukov | Priya Mahadevan, Dmitri Krioukov, Marina Fomenkov, Bradley Huffaker,
Xenofontas Dimitropoulos, kc claffy, Amin Vahdat | The Internet AS-Level Topology: Three Data Sources and One Definitive
Metric | This paper is a revised journal version of cs.NI/0508033 | ACM SIGCOMM Computer Communication Review (CCR), v.36, n.1,
p.17-26, 2006 | 10.1145/1111322.1111328 | null | cs.NI physics.soc-ph | null | We calculate an extensive set of characteristics for Internet AS topologies
extracted from the three data sources most frequently used by the research
community: traceroutes, BGP, and WHOIS. We discover that traceroute and BGP
topologies are similar to one another but differ substantially from the WHOIS
topology. Amo... | [
{
"version": "v1",
"created": "Sat, 24 Dec 2005 03:19:24 GMT"
}
] | 2008-04-16T00:00:00 | [
[
"Mahadevan",
"Priya",
""
],
[
"Krioukov",
"Dmitri",
""
],
[
"Fomenkov",
"Marina",
""
],
[
"Huffaker",
"Bradley",
""
],
[
"Dimitropoulos",
"Xenofontas",
""
],
[
"claffy",
"kc",
""
],
[
"Vahdat",
"Amin",
""
... | TITLE: The Internet AS-Level Topology: Three Data Sources and One Definitive
Metric
ABSTRACT: We calculate an extensive set of characteristics for Internet AS topologies
extracted from the three data sources most frequently used by the research
community: traceroutes, BGP, and WHOIS. We discover that traceroute a... |
0803.1417 | Alessandra Retico | P. Delogu, M.E. Fantacci, P. Kasae, A. Retico | Characterization of mammographic masses using a gradient-based
segmentation algorithm and a neural classifier | 18 pages, 7 figures | Comput Biol Med. 2007 Oct;37(10):1479-91. Epub 2007 Mar 26 | 10.1016/j.compbiomed.2007.01.009 | null | physics.med-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The computer-aided diagnosis system we developed for the mass
characterization is mainly based on a segmentation algorithm and on the neural
classification of several features computed on the segmented mass. Mass
segmentation plays a key role in most computerized systems. Our technique is a
gradient-based one, showin... | [
{
"version": "v1",
"created": "Mon, 10 Mar 2008 13:46:28 GMT"
}
] | 2008-03-11T00:00:00 | [
[
"Delogu",
"P.",
""
],
[
"Fantacci",
"M. E.",
""
],
[
"Kasae",
"P.",
""
],
[
"Retico",
"A.",
""
]
] | TITLE: Characterization of mammographic masses using a gradient-based
segmentation algorithm and a neural classifier
ABSTRACT: The computer-aided diagnosis system we developed for the mass
characterization is mainly based on a segmentation algorithm and on the neural
classification of several features computed on... |
0803.0939 | Jure Leskovec | Jure Leskovec, Eric Horvitz | Planetary-Scale Views on an Instant-Messaging Network | null | null | null | null | physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a study of anonymized data capturing a month of high-level
communication activities within the whole of the Microsoft Messenger
instant-messaging system. We examine characteristics and patterns that emerge
from the collective dynamics of large numbers of people, rather than the
actions and characteristics ... | [
{
"version": "v1",
"created": "Thu, 6 Mar 2008 18:40:37 GMT"
}
] | 2008-03-07T00:00:00 | [
[
"Leskovec",
"Jure",
""
],
[
"Horvitz",
"Eric",
""
]
] | TITLE: Planetary-Scale Views on an Instant-Messaging Network
ABSTRACT: We present a study of anonymized data capturing a month of high-level
communication activities within the whole of the Microsoft Messenger
instant-messaging system. We examine characteristics and patterns that emerge
from the collective dynamics... |
0802.4126 | Alexei Botchkarev | Peter Andru, Alexei Botchkarev | Hospital Case Cost Estimates Modelling - Algorithm Comparison | null | null | null | null | cs.CE cs.DB | http://creativecommons.org/licenses/publicdomain/ | Ontario (Canada) Health System stakeholders support the idea and necessity of
the integrated source of data that would include both clinical (e.g. diagnosis,
intervention, length of stay, case mix group) and financial (e.g. cost per
weighted case, cost per diem) characteristics of the Ontario healthcare system
activi... | [
{
"version": "v1",
"created": "Thu, 28 Feb 2008 04:56:48 GMT"
}
] | 2008-02-29T00:00:00 | [
[
"Andru",
"Peter",
""
],
[
"Botchkarev",
"Alexei",
""
]
] | TITLE: Hospital Case Cost Estimates Modelling - Algorithm Comparison
ABSTRACT: Ontario (Canada) Health System stakeholders support the idea and necessity of
the integrated source of data that would include both clinical (e.g. diagnosis,
intervention, length of stay, case mix group) and financial (e.g. cost per
weig... |
0802.1026 | Benjamin Sach Mr | Benjamin Sach and Rapha\"el Clifford | An Empirical Study of Cache-Oblivious Priority Queues and their
Application to the Shortest Path Problem | null | null | null | null | cs.DS cs.SE | null | In recent years the Cache-Oblivious model of external memory computation has
provided an attractive theoretical basis for the analysis of algorithms on
massive datasets. Much progress has been made in discovering algorithms that
are asymptotically optimal or near optimal. However, to date there are still
relatively f... | [
{
"version": "v1",
"created": "Thu, 7 Feb 2008 18:02:11 GMT"
}
] | 2008-02-08T00:00:00 | [
[
"Sach",
"Benjamin",
""
],
[
"Clifford",
"Raphaël",
""
]
] | TITLE: An Empirical Study of Cache-Oblivious Priority Queues and their
Application to the Shortest Path Problem
ABSTRACT: In recent years the Cache-Oblivious model of external memory computation has
provided an attractive theoretical basis for the analysis of algorithms on
massive datasets. Much progress has been... |
bayes-an/9510001 | Hugh Chipman | Hugh Chipman (University of Chicago Graduate School of Business) | Bayesian Variable Selection with Related Predictors | uuencoded, gzipped postscript file, 24 pages including graphics and
tables. Revised version includes new example and improved plot. Paper also
available at http://gsbhac.uchicago.edu/techreports/ Author has web page at
http://www-gsb.uchicago.edu/ | null | null | STAT-94-13 (University of Waterloo) | bayes-an physics.data-an | null | In data sets with many predictors, algorithms for identifying a good subset
of predictors are often used. Most such algorithms do not account for any
relationships between predictors. For example, stepwise regression might select
a model containing an interaction AB but neither main effect A or B. This paper
develops... | [
{
"version": "v1",
"created": "Mon, 30 Oct 1995 18:32:07 GMT"
},
{
"version": "v2",
"created": "Tue, 31 Oct 1995 17:37:16 GMT"
}
] | 2008-02-03T00:00:00 | [
[
"Chipman",
"Hugh",
"",
"University of Chicago Graduate School of Business"
]
] | TITLE: Bayesian Variable Selection with Related Predictors
ABSTRACT: In data sets with many predictors, algorithms for identifying a good subset
of predictors are often used. Most such algorithms do not account for any
relationships between predictors. For example, stepwise regression might select
a model containin... |
cmp-lg/9607027 | Ilyas Cicekli | Ilyas Cicekli and H. Altay Guvenir | Learning Translation Rules From A Bilingual Corpus | 8 pages, Latex, uses nemlap.sty | Published in Proceedings of NEMLAP-2 | null | null | cmp-lg cs.CL | null | This paper proposes a mechanism for learning pattern correspondences between
two languages from a corpus of translated sentence pairs. The proposed
mechanism uses analogical reasoning between two translations. Given a pair of
translations, the similar parts of the sentences in the source language must
correspond the ... | [
{
"version": "v1",
"created": "Fri, 26 Jul 1996 10:36:59 GMT"
}
] | 2008-02-03T00:00:00 | [
[
"Cicekli",
"Ilyas",
""
],
[
"Guvenir",
"H. Altay",
""
]
] | TITLE: Learning Translation Rules From A Bilingual Corpus
ABSTRACT: This paper proposes a mechanism for learning pattern correspondences between
two languages from a corpus of translated sentence pairs. The proposed
mechanism uses analogical reasoning between two translations. Given a pair of
translations, the simi... |
physics/9701026 | Radford Neal | Radford M. Neal (Dept. of Statistics, University of Toronto) | Monte Carlo Implementation of Gaussian Process Models for Bayesian
Regression and Classification | null | null | null | 9702 | physics.data-an | null | Gaussian processes are a natural way of defining prior distributions over
functions of one or more input variables. In a simple nonparametric regression
problem, where such a function gives the mean of a Gaussian distribution for an
observed response, a Gaussian process model can easily be implemented using
matrix co... | [
{
"version": "v1",
"created": "Tue, 28 Jan 1997 00:59:11 GMT"
},
{
"version": "v2",
"created": "Tue, 28 Jan 1997 01:14:50 GMT"
}
] | 2008-02-03T00:00:00 | [
[
"Neal",
"Radford M.",
"",
"Dept. of Statistics, University of Toronto"
]
] | TITLE: Monte Carlo Implementation of Gaussian Process Models for Bayesian
Regression and Classification
ABSTRACT: Gaussian processes are a natural way of defining prior distributions over
functions of one or more input variables. In a simple nonparametric regression
problem, where such a function gives the mean o... |
0801.2349 | Cristian Marchioli Dr. | C. Marchioli, A. Soldati, J.G.M. Kuerten, B. Arcen, A. Taniere, G.
Goldensoph, K.D. Squires, M.F. Cargnelutti and L.M. Portela | Statistics of particle dispersion in Direct Numerical Simulations of
wall-bounded turbulence: results of an international collaborative benchmark
test | null | null | null | null | physics.flu-dyn | null | In this paper, the results of an international collaborative test case
relative to the production of a Direct Numerical Simulation and Lagrangian
Particle Tracking database for turbulent particle dispersion in channel flow at
low Reynolds number are presented. The objective of this test case is to
establish a homogen... | [
{
"version": "v1",
"created": "Tue, 15 Jan 2008 18:11:21 GMT"
}
] | 2008-01-16T00:00:00 | [
[
"Marchioli",
"C.",
""
],
[
"Soldati",
"A.",
""
],
[
"Kuerten",
"J. G. M.",
""
],
[
"Arcen",
"B.",
""
],
[
"Taniere",
"A.",
""
],
[
"Goldensoph",
"G.",
""
],
[
"Squires",
"K. D.",
""
],
[
"Cargnelutt... | TITLE: Statistics of particle dispersion in Direct Numerical Simulations of
wall-bounded turbulence: results of an international collaborative benchmark
test
ABSTRACT: In this paper, the results of an international collaborative test case
relative to the production of a Direct Numerical Simulation and Lagrangia... |
0712.4126 | Chandan Reddy | Chandan K. Reddy | TRUST-TECH based Methods for Optimization and Learning | PHD Thesis | Chandan K. Reddy, TRUST-TECH based Methods for Optimization and
Learning, PHD Thesis, Cornell University, February 2007 | null | null | cs.AI cs.CE cs.MS cs.NA cs.NE | null | Many problems that arise in machine learning domain deal with nonlinearity
and quite often demand users to obtain global optimal solutions rather than
local optimal ones. Optimization problems are inherent in machine learning
algorithms and hence many methods in machine learning were inherited from the
optimization l... | [
{
"version": "v1",
"created": "Tue, 25 Dec 2007 03:14:32 GMT"
}
] | 2007-12-27T00:00:00 | [
[
"Reddy",
"Chandan K.",
""
]
] | TITLE: TRUST-TECH based Methods for Optimization and Learning
ABSTRACT: Many problems that arise in machine learning domain deal with nonlinearity
and quite often demand users to obtain global optimal solutions rather than
local optimal ones. Optimization problems are inherent in machine learning
algorithms and hen... |
0712.2262 | Ian T Foster | David Bernholdt, Shishir Bharathi, David Brown, Kasidit Chanchio,
Meili Chen, Ann Chervenak, Luca Cinquini, Bob Drach, Ian Foster, Peter Fox,
Jose Garcia, Carl Kesselman, Rob Markel, Don Middleton, Veronika Nefedova,
Line Pouchard, Arie Shoshani, Alex Sim, Gary Strand, Dean Williams | The Earth System Grid: Supporting the Next Generation of Climate
Modeling Research | null | null | null | null | cs.CE cs.DC cs.NI | null | Understanding the earth's climate system and how it might be changing is a
preeminent scientific challenge. Global climate models are used to simulate
past, present, and future climates, and experiments are executed continuously
on an array of distributed supercomputers. The resulting data archive, spread
over severa... | [
{
"version": "v1",
"created": "Thu, 13 Dec 2007 23:39:04 GMT"
}
] | 2007-12-17T00:00:00 | [
[
"Bernholdt",
"David",
""
],
[
"Bharathi",
"Shishir",
""
],
[
"Brown",
"David",
""
],
[
"Chanchio",
"Kasidit",
""
],
[
"Chen",
"Meili",
""
],
[
"Chervenak",
"Ann",
""
],
[
"Cinquini",
"Luca",
""
],
[
... | TITLE: The Earth System Grid: Supporting the Next Generation of Climate
Modeling Research
ABSTRACT: Understanding the earth's climate system and how it might be changing is a
preeminent scientific challenge. Global climate models are used to simulate
past, present, and future climates, and experiments are execute... |
cs/0610105 | Vitaly Shmatikov | Arvind Narayanan and Vitaly Shmatikov | How To Break Anonymity of the Netflix Prize Dataset | null | null | null | null | cs.CR cs.DB | null | We present a new class of statistical de-anonymization attacks against
high-dimensional micro-data, such as individual preferences, recommendations,
transaction records and so on. Our techniques are robust to perturbation in the
data and tolerate some mistakes in the adversary's background knowledge.
We apply our d... | [
{
"version": "v1",
"created": "Wed, 18 Oct 2006 06:03:41 GMT"
},
{
"version": "v2",
"created": "Thu, 22 Nov 2007 05:13:06 GMT"
}
] | 2007-11-22T00:00:00 | [
[
"Narayanan",
"Arvind",
""
],
[
"Shmatikov",
"Vitaly",
""
]
] | TITLE: How To Break Anonymity of the Netflix Prize Dataset
ABSTRACT: We present a new class of statistical de-anonymization attacks against
high-dimensional micro-data, such as individual preferences, recommendations,
transaction records and so on. Our techniques are robust to perturbation in the
data and tolerate ... |
0711.2914 | Tshilidzi Marwala | Gidudu Anthony, Hulley Gregg and Marwala Tshilidzi | Image Classification Using SVMs: One-against-One Vs One-against-All | Proccedings of the 28th Asian Conference on Remote Sensing, 2007 | null | null | null | cs.LG cs.AI cs.CV | null | Support Vector Machines (SVMs) are a relatively new supervised classification
technique to the land cover mapping community. They have their roots in
Statistical Learning Theory and have gained prominence because they are robust,
accurate and are effective even when using a small training sample. By their
nature SVMs... | [
{
"version": "v1",
"created": "Mon, 19 Nov 2007 12:25:00 GMT"
}
] | 2007-11-20T00:00:00 | [
[
"Anthony",
"Gidudu",
""
],
[
"Gregg",
"Hulley",
""
],
[
"Tshilidzi",
"Marwala",
""
]
] | TITLE: Image Classification Using SVMs: One-against-One Vs One-against-All
ABSTRACT: Support Vector Machines (SVMs) are a relatively new supervised classification
technique to the land cover mapping community. They have their roots in
Statistical Learning Theory and have gained prominence because they are robust,
a... |
physics/0609252 | Chih-Yuan Tseng | Chien-chih Chen, Chih-Yuan Tseng and Jia-Jyun Dong | Variable selection based on entropic criterion and its application to
the debris-flow triggering | 9 pages and 4 tables | Engineering Geology 94, 19 (2007) | 10.1016/j.enggeo.2007.06.004 | null | physics.data-an physics.geo-ph | null | We propose a new data analyzing scheme, the method of minimum entropy
analysis (MEA), in this paper. New MEA provides a quantitative criterion to
select relevant variables for modeling the physical system interested. Such
method can be easily extended to various geophysical/geological data analysis,
where many releva... | [
{
"version": "v1",
"created": "Fri, 29 Sep 2006 05:19:27 GMT"
}
] | 2007-11-20T00:00:00 | [
[
"Chen",
"Chien-chih",
""
],
[
"Tseng",
"Chih-Yuan",
""
],
[
"Dong",
"Jia-Jyun",
""
]
] | TITLE: Variable selection based on entropic criterion and its application to
the debris-flow triggering
ABSTRACT: We propose a new data analyzing scheme, the method of minimum entropy
analysis (MEA), in this paper. New MEA provides a quantitative criterion to
select relevant variables for modeling the physical sy... |
0708.1242 | Christos Dimitrakakis | Christos Dimitrakakis and Christian Savu-Krohn | Cost-minimising strategies for data labelling : optimal stopping and
active learning | 17 pages, 4 figures. Corrected some errors and changed the flow of
the text | null | null | null | cs.LG | null | Supervised learning deals with the inference of a distribution over an output
or label space $\CY$ conditioned on points in an observation space $\CX$, given
a training dataset $D$ of pairs in $\CX \times \CY$. However, in a lot of
applications of interest, acquisition of large amounts of observations is easy,
while ... | [
{
"version": "v1",
"created": "Thu, 9 Aug 2007 10:21:34 GMT"
},
{
"version": "v2",
"created": "Mon, 27 Aug 2007 22:05:57 GMT"
},
{
"version": "v3",
"created": "Thu, 15 Nov 2007 16:37:51 GMT"
}
] | 2007-11-15T00:00:00 | [
[
"Dimitrakakis",
"Christos",
""
],
[
"Savu-Krohn",
"Christian",
""
]
] | TITLE: Cost-minimising strategies for data labelling : optimal stopping and
active learning
ABSTRACT: Supervised learning deals with the inference of a distribution over an output
or label space $\CY$ conditioned on points in an observation space $\CX$, given
a training dataset $D$ of pairs in $\CX \times \CY$. H... |
0709.3640 | Fabrice Rossi | Damien Fran\c{c}ois (CESAME), Fabrice Rossi (INRIA Rocquencourt /
INRIA Sophia Antipolis), Vincent Wertz (CESAME), Michel Verleysen (DICE -
MLG) | Resampling methods for parameter-free and robust feature selection with
mutual information | null | Neurocomputing 70, 7-9 (2007) 1276-1288 | 10.1016/j.neucom.2006.11.019 | null | cs.LG stat.AP | null | Combining the mutual information criterion with a forward feature selection
strategy offers a good trade-off between optimality of the selected feature
subset and computation time. However, it requires to set the parameter(s) of
the mutual information estimator and to determine when to halt the forward
procedure. The... | [
{
"version": "v1",
"created": "Sun, 23 Sep 2007 14:09:28 GMT"
}
] | 2007-09-26T00:00:00 | [
[
"François",
"Damien",
"",
"CESAME"
],
[
"Rossi",
"Fabrice",
"",
"INRIA Rocquencourt /\n INRIA Sophia Antipolis"
],
[
"Wertz",
"Vincent",
"",
"CESAME"
],
[
"Verleysen",
"Michel",
"",
"DICE -\n MLG"
]
] | TITLE: Resampling methods for parameter-free and robust feature selection with
mutual information
ABSTRACT: Combining the mutual information criterion with a forward feature selection
strategy offers a good trade-off between optimality of the selected feature
subset and computation time. However, it requires to s... |
0709.3965 | Tshilidzi Marwala | Greg Hulley and Tshilidzi Marwala | Evolving Classifiers: Methods for Incremental Learning | 14 pages | null | null | null | cs.LG cs.AI cs.NE | null | The ability of a classifier to take on new information and classes by
evolving the classifier without it having to be fully retrained is known as
incremental learning. Incremental learning has been successfully applied to
many classification problems, where the data is changing and is not all
available at once. In th... | [
{
"version": "v1",
"created": "Tue, 25 Sep 2007 14:28:32 GMT"
},
{
"version": "v2",
"created": "Wed, 26 Sep 2007 10:37:00 GMT"
}
] | 2007-09-26T00:00:00 | [
[
"Hulley",
"Greg",
""
],
[
"Marwala",
"Tshilidzi",
""
]
] | TITLE: Evolving Classifiers: Methods for Incremental Learning
ABSTRACT: The ability of a classifier to take on new information and classes by
evolving the classifier without it having to be fully retrained is known as
incremental learning. Incremental learning has been successfully applied to
many classification pr... |
0709.3967 | Tshilidzi Marwala | Gidudu Anthony, Hulley Greg and Marwala Tshilidzi | Classification of Images Using Support Vector Machines | 6 pages | null | null | null | cs.LG cs.AI | null | Support Vector Machines (SVMs) are a relatively new supervised classification
technique to the land cover mapping community. They have their roots in
Statistical Learning Theory and have gained prominence because they are robust,
accurate and are effective even when using a small training sample. By their
nature SVMs... | [
{
"version": "v1",
"created": "Tue, 25 Sep 2007 14:37:40 GMT"
}
] | 2007-09-26T00:00:00 | [
[
"Anthony",
"Gidudu",
""
],
[
"Greg",
"Hulley",
""
],
[
"Tshilidzi",
"Marwala",
""
]
] | TITLE: Classification of Images Using Support Vector Machines
ABSTRACT: Support Vector Machines (SVMs) are a relatively new supervised classification
technique to the land cover mapping community. They have their roots in
Statistical Learning Theory and have gained prominence because they are robust,
accurate and a... |
cs/0309005 | Aleksandar Stojmirovic | Aleksandar Stojmirovic and Vladimir Pestov | Indexing Schemes for Similarity Search In Datasets of Short Protein
Fragments | 34 pages, 12 figures, 4 tables - Timings for experiments added upon
referees' request, and a number of less substantial modifications made | Information Systems 32 (2007), 1145-1165 | null | null | cs.DS q-bio.BM | null | We propose a family of very efficient hierarchical indexing schemes for
ungapped, score matrix-based similarity search in large datasets of short (4-12
amino acid) protein fragments. This type of similarity search has importance in
both providing a building block to more complex algorithms and for possible use
in dir... | [
{
"version": "v1",
"created": "Fri, 5 Sep 2003 22:59:40 GMT"
},
{
"version": "v2",
"created": "Sat, 14 Jan 2006 00:45:57 GMT"
},
{
"version": "v3",
"created": "Tue, 11 Jul 2006 17:30:29 GMT"
},
{
"version": "v4",
"created": "Fri, 9 Feb 2007 02:33:56 GMT"
}
] | 2007-09-04T00:00:00 | [
[
"Stojmirovic",
"Aleksandar",
""
],
[
"Pestov",
"Vladimir",
""
]
] | TITLE: Indexing Schemes for Similarity Search In Datasets of Short Protein
Fragments
ABSTRACT: We propose a family of very efficient hierarchical indexing schemes for
ungapped, score matrix-based similarity search in large datasets of short (4-12
amino acid) protein fragments. This type of similarity search has i... |
0707.3670 | Xu Cheng | Xu Cheng and Cameron Dale and Jiangchuan Liu | Understanding the Characteristics of Internet Short Video Sharing:
YouTube as a Case Study | IEEE format, 9 pages, 16 figures | null | null | null | cs.NI cs.MM | null | Established in 2005, YouTube has become the most successful Internet site
providing a new generation of short video sharing service. Today, YouTube alone
comprises approximately 20% of all HTTP traffic, or nearly 10% of all traffic
on the Internet. Understanding the features of YouTube and similar video
sharing sites... | [
{
"version": "v1",
"created": "Wed, 25 Jul 2007 05:39:44 GMT"
}
] | 2007-07-26T00:00:00 | [
[
"Cheng",
"Xu",
""
],
[
"Dale",
"Cameron",
""
],
[
"Liu",
"Jiangchuan",
""
]
] | TITLE: Understanding the Characteristics of Internet Short Video Sharing:
YouTube as a Case Study
ABSTRACT: Established in 2005, YouTube has become the most successful Internet site
providing a new generation of short video sharing service. Today, YouTube alone
comprises approximately 20% of all HTTP traffic, or ... |
physics/0405044 | Harald St\"ogbauer | Harald St\"ogbauer, Alexander Kraskov, Sergey A. Astakhov, and Peter
Grassberger | Least Dependent Component Analysis Based on Mutual Information | 18 pages, 20 figures, Phys. Rev. E (in press) | Phys. Rev. E 70, 066123 (2004) | 10.1103/PhysRevE.70.066123 | null | physics.comp-ph cs.IT math.IT physics.data-an q-bio.QM | null | We propose to use precise estimators of mutual information (MI) to find least
dependent components in a linearly mixed signal. On the one hand this seems to
lead to better blind source separation than with any other presently available
algorithm. On the other hand it has the advantage, compared to other
implementatio... | [
{
"version": "v1",
"created": "Mon, 10 May 2004 14:58:17 GMT"
},
{
"version": "v2",
"created": "Tue, 28 Sep 2004 14:05:32 GMT"
}
] | 2007-07-16T00:00:00 | [
[
"Stögbauer",
"Harald",
""
],
[
"Kraskov",
"Alexander",
""
],
[
"Astakhov",
"Sergey A.",
""
],
[
"Grassberger",
"Peter",
""
]
] | TITLE: Least Dependent Component Analysis Based on Mutual Information
ABSTRACT: We propose to use precise estimators of mutual information (MI) to find least
dependent components in a linearly mixed signal. On the one hand this seems to
lead to better blind source separation than with any other presently available
... |
0707.1618 | Per Ola Kristensson | Per Ola Kristensson, Nils Dahlback, Daniel Anundi, Marius Bjornstad,
Hanna Gillberg, Jonas Haraldsson, Ingrid Martensson, Matttias Nordvall,
Josefin Stahl | The Trade-offs with Space Time Cube Representation of Spatiotemporal
Patterns | null | null | null | null | cs.HC cs.GR | null | Space time cube representation is an information visualization technique
where spatiotemporal data points are mapped into a cube. Fast and correct
analysis of such information is important in for instance geospatial and social
visualization applications. Information visualization researchers have
previously argued th... | [
{
"version": "v1",
"created": "Wed, 11 Jul 2007 13:39:34 GMT"
}
] | 2007-07-12T00:00:00 | [
[
"Kristensson",
"Per Ola",
""
],
[
"Dahlback",
"Nils",
""
],
[
"Anundi",
"Daniel",
""
],
[
"Bjornstad",
"Marius",
""
],
[
"Gillberg",
"Hanna",
""
],
[
"Haraldsson",
"Jonas",
""
],
[
"Martensson",
"Ingrid",
"... | TITLE: The Trade-offs with Space Time Cube Representation of Spatiotemporal
Patterns
ABSTRACT: Space time cube representation is an information visualization technique
where spatiotemporal data points are mapped into a cube. Fast and correct
analysis of such information is important in for instance geospatial and... |
0706.1842 | Dietrich Stauffer | Soeren Wichmann, Dietrich Stauffer, Christian Schulze, Eric W. Holman | Do language change rates depend on population size? | 20 pages including all figures for a linguistic journal | null | null | null | physics.soc-ph | null | An earlier study (Nettle 1999b) concluded, based on computer simulations and
some inferences from empirical data, that languages will change the more slowly
the larger the population gets. We replicate this study using a more complete
language model for simulations (the Schulze model combined with a
Barabasi-Albert n... | [
{
"version": "v1",
"created": "Wed, 13 Jun 2007 07:53:34 GMT"
}
] | 2007-06-14T00:00:00 | [
[
"Wichmann",
"Soeren",
""
],
[
"Stauffer",
"Dietrich",
""
],
[
"Schulze",
"Christian",
""
],
[
"Holman",
"Eric W.",
""
]
] | TITLE: Do language change rates depend on population size?
ABSTRACT: An earlier study (Nettle 1999b) concluded, based on computer simulations and
some inferences from empirical data, that languages will change the more slowly
the larger the population gets. We replicate this study using a more complete
language mod... |
cs/0601001 | Jens Oehlschl\"agel | Jens Oehlschl\"agel | Truecluster: robust scalable clustering with model selection | Article (10 figures). Changes in 2nd version: dropped supplements in
favor of better integrated presentation, better literature coverage, put into
proper English. Author's website available via http://www.truecluster.com | null | null | null | cs.AI | null | Data-based classification is fundamental to most branches of science. While
recent years have brought enormous progress in various areas of statistical
computing and clustering, some general challenges in clustering remain: model
selection, robustness, and scalability to large datasets. We consider the
important prob... | [
{
"version": "v1",
"created": "Mon, 2 Jan 2006 13:17:09 GMT"
},
{
"version": "v2",
"created": "Mon, 28 May 2007 17:18:09 GMT"
}
] | 2007-06-13T00:00:00 | [
[
"Oehlschlägel",
"Jens",
""
]
] | TITLE: Truecluster: robust scalable clustering with model selection
ABSTRACT: Data-based classification is fundamental to most branches of science. While
recent years have brought enormous progress in various areas of statistical
computing and clustering, some general challenges in clustering remain: model
selectio... |
cs/0610031 | Simeon Warner | Simeon Warner, Jeroen Bekaert, Carl Lagoze, Xiaoming Liu, Sandy
Payette, Herbert Van de Sompel | Pathways: Augmenting interoperability across scholarly repositories | 18 pages. Accepted for International Journal on Digital Libraries
special issue on Digital Libraries and eScience | null | 10.1007/s00799-007-0016-7 | null | cs.DL | null | In the emerging eScience environment, repositories of papers, datasets,
software, etc., should be the foundation of a global and natively-digital
scholarly communications system. The current infrastructure falls far short of
this goal. Cross-repository interoperability must be augmented to support the
many workflows ... | [
{
"version": "v1",
"created": "Thu, 5 Oct 2006 19:55:09 GMT"
}
] | 2007-06-13T00:00:00 | [
[
"Warner",
"Simeon",
""
],
[
"Bekaert",
"Jeroen",
""
],
[
"Lagoze",
"Carl",
""
],
[
"Liu",
"Xiaoming",
""
],
[
"Payette",
"Sandy",
""
],
[
"Van de Sompel",
"Herbert",
""
]
] | TITLE: Pathways: Augmenting interoperability across scholarly repositories
ABSTRACT: In the emerging eScience environment, repositories of papers, datasets,
software, etc., should be the foundation of a global and natively-digital
scholarly communications system. The current infrastructure falls far short of
this g... |
0704.1028 | Jianlin Cheng | Jianlin Cheng | A neural network approach to ordinal regression | 8 pages | null | null | null | cs.LG cs.AI cs.NE | null | Ordinal regression is an important type of learning, which has properties of
both classification and regression. Here we describe a simple and effective
approach to adapt a traditional neural network to learn ordinal categories. Our
approach is a generalization of the perceptron method for ordinal regression.
On seve... | [
{
"version": "v1",
"created": "Sun, 8 Apr 2007 17:36:00 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Cheng",
"Jianlin",
""
]
] | TITLE: A neural network approach to ordinal regression
ABSTRACT: Ordinal regression is an important type of learning, which has properties of
both classification and regression. Here we describe a simple and effective
approach to adapt a traditional neural network to learn ordinal categories. Our
approach is a gene... |
0704.2374 | Daniel Fraiman | Daniel Fraiman | Growing Directed Networks: Estimation and Hypothesis Testing | 4 pages, 3 figures | null | null | null | physics.soc-ph physics.data-an | null | Based only on the information gathered in a snapshot of a directed network,
we present a formal way of checking if the proposed model is correct for the
empirical growing network under study. In particular, we show how to estimate
the attractiveness, and present an application of the model presented in
[arxiv:0704.18... | [
{
"version": "v1",
"created": "Wed, 18 Apr 2007 16:08:32 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Fraiman",
"Daniel",
""
]
] | TITLE: Growing Directed Networks: Estimation and Hypothesis Testing
ABSTRACT: Based only on the information gathered in a snapshot of a directed network,
we present a formal way of checking if the proposed model is correct for the
empirical growing network under study. In particular, we show how to estimate
the att... |
0704.2668 | Alex Smola J | Le Song, Alex Smola, Arthur Gretton, Karsten Borgwardt, Justin Bedo | Supervised Feature Selection via Dependence Estimation | 9 pages | null | null | null | cs.LG | null | We introduce a framework for filtering features that employs the
Hilbert-Schmidt Independence Criterion (HSIC) as a measure of dependence
between the features and the labels. The key idea is that good features should
maximise such dependence. Feature selection for various supervised learning
problems (including class... | [
{
"version": "v1",
"created": "Fri, 20 Apr 2007 08:26:29 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Song",
"Le",
""
],
[
"Smola",
"Alex",
""
],
[
"Gretton",
"Arthur",
""
],
[
"Borgwardt",
"Karsten",
""
],
[
"Bedo",
"Justin",
""
]
] | TITLE: Supervised Feature Selection via Dependence Estimation
ABSTRACT: We introduce a framework for filtering features that employs the
Hilbert-Schmidt Independence Criterion (HSIC) as a measure of dependence
between the features and the labels. The key idea is that good features should
maximise such dependence. F... |
0704.2803 | Jure Leskovec | Jure Leskovec, Mary McGlohon, Christos Faloutsos, Natalie Glance,
Matthew Hurst | Cascading Behavior in Large Blog Graphs | null | null | null | null | physics.soc-ph physics.data-an | null | How do blogs cite and influence each other? How do such links evolve? Does
the popularity of old blog posts drop exponentially with time? These are some
of the questions that we address in this work. Our goal is to build a model
that generates realistic cascades, so that it can help us with link prediction
and outlie... | [
{
"version": "v1",
"created": "Fri, 20 Apr 2007 22:37:13 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Leskovec",
"Jure",
""
],
[
"McGlohon",
"Mary",
""
],
[
"Faloutsos",
"Christos",
""
],
[
"Glance",
"Natalie",
""
],
[
"Hurst",
"Matthew",
""
]
] | TITLE: Cascading Behavior in Large Blog Graphs
ABSTRACT: How do blogs cite and influence each other? How do such links evolve? Does
the popularity of old blog posts drop exponentially with time? These are some
of the questions that we address in this work. Our goal is to build a model
that generates realistic casca... |
0704.2883 | Roehner | Charles Jego, Bertrand M. Roehner | A physicist's view of the notion of "racism" | 14 pages, 3 figures, 1 table | null | null | null | physics.soc-ph | null | It is not uncommon, e.g. in the media, that specific groups are categorized
as being racist. Based on an extensive dataset of intermarriage statistics our
study questions the legitimacy of such characterizations. It suggests that, far
from being group-dependent, segregation mechanisms are instead
situation-dependent.... | [
{
"version": "v1",
"created": "Sun, 22 Apr 2007 13:42:57 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Jego",
"Charles",
""
],
[
"Roehner",
"Bertrand M.",
""
]
] | TITLE: A physicist's view of the notion of "racism"
ABSTRACT: It is not uncommon, e.g. in the media, that specific groups are categorized
as being racist. Based on an extensive dataset of intermarriage statistics our
study questions the legitimacy of such characterizations. It suggests that, far
from being group-de... |
0705.1110 | Edgar Graaf de | Edgar de Graaf Joost Kok Walter Kosters | Mining Patterns with a Balanced Interval | null | null | null | null | cs.AI cs.DB | null | In many applications it will be useful to know those patterns that occur with
a balanced interval, e.g., a certain combination of phone numbers are called
almost every Friday or a group of products are sold a lot on Tuesday and
Thursday.
In previous work we proposed a new measure of support (the number of
occurrenc... | [
{
"version": "v1",
"created": "Tue, 8 May 2007 15:22:38 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Kosters",
"Edgar de Graaf Joost Kok Walter",
""
]
] | TITLE: Mining Patterns with a Balanced Interval
ABSTRACT: In many applications it will be useful to know those patterns that occur with
a balanced interval, e.g., a certain combination of phone numbers are called
almost every Friday or a group of products are sold a lot on Tuesday and
Thursday.
In previous work w... |
0705.1390 | Tshilidzi Marwala | M.A. Herzog, T. Marwala and P.S. Heyns | Machine and Component Residual Life Estimation through the Application
of Neural Networks | 22 pages | null | null | null | cs.CE | null | This paper concerns the use of neural networks for predicting the residual
life of machines and components. In addition, the advantage of using
condition-monitoring data to enhance the predictive capability of these neural
networks was also investigated. A number of neural network variations were
trained and tested w... | [
{
"version": "v1",
"created": "Thu, 10 May 2007 05:52:22 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Herzog",
"M. A.",
""
],
[
"Marwala",
"T.",
""
],
[
"Heyns",
"P. S.",
""
]
] | TITLE: Machine and Component Residual Life Estimation through the Application
of Neural Networks
ABSTRACT: This paper concerns the use of neural networks for predicting the residual
life of machines and components. In addition, the advantage of using
condition-monitoring data to enhance the predictive capability ... |
astro-ph/0510688 | Michael Noble S. | M.S. Noble, J.C. Houck, J.E. Davis, A. Young, M. Nowak | Using the Parallel Virtual Machine for Everyday Analysis | 4 pages; manuscript for oral presentation given at ADASS XV, Madrid | null | null | null | astro-ph cs.DC | null | A review of the literature reveals that while parallel computing is sometimes
employed by astronomers for custom, large-scale calculations, no package
fosters the routine application of parallel methods to standard problems in
astronomical data analysis. This paper describes our attempt to close that gap
by wrapping ... | [
{
"version": "v1",
"created": "Mon, 24 Oct 2005 15:17:36 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Noble",
"M. S.",
""
],
[
"Houck",
"J. C.",
""
],
[
"Davis",
"J. E.",
""
],
[
"Young",
"A.",
""
],
[
"Nowak",
"M.",
""
]
] | TITLE: Using the Parallel Virtual Machine for Everyday Analysis
ABSTRACT: A review of the literature reveals that while parallel computing is sometimes
employed by astronomers for custom, large-scale calculations, no package
fosters the routine application of parallel methods to standard problems in
astronomical da... |
cond-mat/0207711 | Johannes Berg | Johannes Berg, Michael L\"assig (U Cologne), and Andreas Wagner (U New
Mexico) | Structure and evolution of protein interaction networks: A statistical
model for link dynamics and gene duplications | published version | BMC Evolutionary Biology 4:51 (2004) | null | null | cond-mat.stat-mech physics.bio-ph q-bio.MN | null | The structure of molecular networks derives from dynamical processes on
evolutionary time scales. For protein interaction networks, global statistical
features of their structure can now be inferred consistently from several
large-throughput datasets. Understanding the underlying evolutionary dynamics
is crucial for ... | [
{
"version": "v1",
"created": "Tue, 30 Jul 2002 14:11:58 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Apr 2003 13:03:55 GMT"
},
{
"version": "v3",
"created": "Sat, 27 Nov 2004 16:20:56 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Berg",
"Johannes",
"",
"U Cologne"
],
[
"Lässig",
"Michael",
"",
"U Cologne"
],
[
"Wagner",
"Andreas",
"",
"U New\n Mexico"
]
] | TITLE: Structure and evolution of protein interaction networks: A statistical
model for link dynamics and gene duplications
ABSTRACT: The structure of molecular networks derives from dynamical processes on
evolutionary time scales. For protein interaction networks, global statistical
features of their structure c... |
cond-mat/0305279 | Michele Caselle | M. Caselle, F. Di Cunto and P. Provero | A computational approach to regulatory element discovery in eukaryotes | 7 pages, 2 figures | Proceedings of the 2002 ECMTB conference | null | DFTT 13/2003 | cond-mat.dis-nn physics.bio-ph q-bio.GN | null | Gene regulation in Eukaryotes is mainly effected through transcription
factors binding to rather short recognition motifs generally located upstream
of the coding region. We present a novel computational method to identify
regulatory elements in the upstream region of Eukaryotic genes. The genes are
grouped in sets s... | [
{
"version": "v1",
"created": "Tue, 13 May 2003 12:40:59 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Caselle",
"M.",
""
],
[
"Di Cunto",
"F.",
""
],
[
"Provero",
"P.",
""
]
] | TITLE: A computational approach to regulatory element discovery in eukaryotes
ABSTRACT: Gene regulation in Eukaryotes is mainly effected through transcription
factors binding to rather short recognition motifs generally located upstream
of the coding region. We present a novel computational method to identify
regul... |
cond-mat/0305681 | Gorban | A. N. Gorban, A. Yu. Zinovyev, T. G. Popova | Seven clusters in genomic triplet distributions | Correction of URL. 16 pages, 5 figures. The software and datasets are
available at http://www.ihes.fr/~zinovyev/bullet and
http://www.ihes.fr/~zinovyev/7clusters Paper also available at
http://www.bioinfo.de/isb/2003/03/0039 | In Silico Biology, 3 (2003), 0039, 471-482 | null | null | cond-mat.dis-nn cs.CV physics.bio-ph physics.data-an q-bio.GN | null | In several recent papers new gene-detection algorithms were proposed for
detecting protein-coding regions without requiring learning dataset of already
known genes. The fact that unsupervised gene-detection is possible closely
connected to existence of a cluster structure in oligomer frequency
distributions. In this ... | [
{
"version": "v1",
"created": "Thu, 29 May 2003 11:36:34 GMT"
},
{
"version": "v2",
"created": "Wed, 14 Apr 2004 17:01:56 GMT"
},
{
"version": "v3",
"created": "Mon, 1 Nov 2004 11:08:03 GMT"
},
{
"version": "v4",
"created": "Tue, 23 Nov 2004 13:09:00 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Gorban",
"A. N.",
""
],
[
"Zinovyev",
"A. Yu.",
""
],
[
"Popova",
"T. G.",
""
]
] | TITLE: Seven clusters in genomic triplet distributions
ABSTRACT: In several recent papers new gene-detection algorithms were proposed for
detecting protein-coding regions without requiring learning dataset of already
known genes. The fact that unsupervised gene-detection is possible closely
connected to existence o... |
cs/0005005 | Davis King | Davis King, Jarek Rossignac, and Andrzej Szymczak | Connectivity Compression for Irregular Quadrilateral Meshes | null | null | null | GVU Tech Report GIT-GVU-99-36 | cs.GR cs.CG cs.DS | null | Applications that require Internet access to remote 3D datasets are often
limited by the storage costs of 3D models. Several compression methods are
available to address these limits for objects represented by triangle meshes.
Many CAD and VRML models, however, are represented as quadrilateral meshes or
mixed triangl... | [
{
"version": "v1",
"created": "Thu, 4 May 2000 18:15:08 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"King",
"Davis",
""
],
[
"Rossignac",
"Jarek",
""
],
[
"Szymczak",
"Andrzej",
""
]
] | TITLE: Connectivity Compression for Irregular Quadrilateral Meshes
ABSTRACT: Applications that require Internet access to remote 3D datasets are often
limited by the storage costs of 3D models. Several compression methods are
available to address these limits for objects represented by triangle meshes.
Many CAD and... |
cs/0006001 | Ninan Sajeeth Philip | Ninan Sajeeth Philip, K. Babu Joseph | Boosting the Differences: A fast Bayesian classifier neural network | latex 18pages no figures | null | null | IDA2000 | cs.CV | null | A Bayesian classifier that up-weights the differences in the attribute values
is discussed. Using four popular datasets from the UCI repository, some
interesting features of the network are illustrated. The network is suitable
for classification problems.
| [
{
"version": "v1",
"created": "Wed, 31 May 2000 23:37:48 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Philip",
"Ninan Sajeeth",
""
],
[
"Joseph",
"K. Babu",
""
]
] | TITLE: Boosting the Differences: A fast Bayesian classifier neural network
ABSTRACT: A Bayesian classifier that up-weights the differences in the attribute values
is discussed. Using four popular datasets from the UCI repository, some
interesting features of the network are illustrated. The network is suitable
for ... |
cs/0006002 | Ninan Sajeeth Philip | Ninan Sajeeth Philip, K. Babu Joseph | Distorted English Alphabet Identification : An application of Difference
Boosting Algorithm | latex 14pages no figures | null | null | ADCOM2000 | cs.CV | null | The difference-boosting algorithm is used on letters dataset from the UCI
repository to classify distorted raster images of English alphabets. In
contrast to rather complex networks, the difference-boosting is found to
produce comparable or better classification efficiency on this complex problem.
| [
{
"version": "v1",
"created": "Wed, 31 May 2000 23:52:31 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Philip",
"Ninan Sajeeth",
""
],
[
"Joseph",
"K. Babu",
""
]
] | TITLE: Distorted English Alphabet Identification : An application of Difference
Boosting Algorithm
ABSTRACT: The difference-boosting algorithm is used on letters dataset from the UCI
repository to classify distorted raster images of English alphabets. In
contrast to rather complex networks, the difference-boostin... |
cs/0103022 | Judith Beumer | Bill Allcock, Joe Bester, John Bresnahan, Ann L. Chervenak, Ian
Foster, Carl Kesselman, Sam Meder, Veronika Nefedova, Darcy Quesnel, Steven
Tuecke | Secure, Efficient Data Transport and Replica Management for
High-Performance Data-Intensive Computing | 15 pages | null | null | ANL/MCS-P871-0201 | cs.DC cs.DB | null | An emerging class of data-intensive applications involve the geographically
dispersed extraction of complex scientific information from very large
collections of measured or computed data. Such applications arise, for example,
in experimental physics, where the data in question is generated by
accelerators, and in si... | [
{
"version": "v1",
"created": "Wed, 28 Mar 2001 20:42:34 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Allcock",
"Bill",
""
],
[
"Bester",
"Joe",
""
],
[
"Bresnahan",
"John",
""
],
[
"Chervenak",
"Ann L.",
""
],
[
"Foster",
"Ian",
""
],
[
"Kesselman",
"Carl",
""
],
[
"Meder",
"Sam",
""
],
[
"Nefedov... | TITLE: Secure, Efficient Data Transport and Replica Management for
High-Performance Data-Intensive Computing
ABSTRACT: An emerging class of data-intensive applications involve the geographically
dispersed extraction of complex scientific information from very large
collections of measured or computed data. Such a... |
cs/0104009 | Naren Ramakrishnan | Batul J. Mirza, Benjamin J. Keller, and Naren Ramakrishnan | Evaluating Recommendation Algorithms by Graph Analysis | null | null | null | null | cs.IR cs.DM cs.DS | null | We present a novel framework for evaluating recommendation algorithms in
terms of the `jumps' that they make to connect people to artifacts. This
approach emphasizes reachability via an algorithm within the implicit graph
structure underlying a recommender dataset, and serves as a complement to
evaluation in terms of... | [
{
"version": "v1",
"created": "Tue, 3 Apr 2001 22:07:28 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Mirza",
"Batul J.",
""
],
[
"Keller",
"Benjamin J.",
""
],
[
"Ramakrishnan",
"Naren",
""
]
] | TITLE: Evaluating Recommendation Algorithms by Graph Analysis
ABSTRACT: We present a novel framework for evaluating recommendation algorithms in
terms of the `jumps' that they make to connect people to artifacts. This
approach emphasizes reachability via an algorithm within the implicit graph
structure underlying a... |
cs/0109106 | Michael D. Smith | Atip Asvanund, Karen Clay, Ramayya Krishnan, Michael Smith | Bigger May Not Be Better: An Empirical Analysis of Optimal Membership
Rules in Peer-To-Peer Networks | 29th TPRC Conference, 2001 | null | null | TPRC-2001-049 | cs.CY | null | Peer to peer networks will become an increasingly important distribution
channel for consumer information goods and may play a role in the distribution
of information within corporations. Our research analyzes optimal membership
rules for these networks in light of positive and negative externalities
additional users... | [
{
"version": "v1",
"created": "Tue, 25 Sep 2001 02:05:14 GMT"
},
{
"version": "v2",
"created": "Mon, 1 Oct 2001 17:26:24 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Asvanund",
"Atip",
""
],
[
"Clay",
"Karen",
""
],
[
"Krishnan",
"Ramayya",
""
],
[
"Smith",
"Michael",
""
]
] | TITLE: Bigger May Not Be Better: An Empirical Analysis of Optimal Membership
Rules in Peer-To-Peer Networks
ABSTRACT: Peer to peer networks will become an increasingly important distribution
channel for consumer information goods and may play a role in the distribution
of information within corporations. Our rese... |
cs/0204047 | Naren Ramakrishnan | Naren Ramakrishnan and Chris Bailey-Kellogg | Sampling Strategies for Mining in Data-Scarce Domains | null | null | null | null | cs.CE cs.AI | null | Data mining has traditionally focused on the task of drawing inferences from
large datasets. However, many scientific and engineering domains, such as fluid
dynamics and aircraft design, are characterized by scarce data, due to the
expense and complexity of associated experiments and simulations. In such
data-scarce ... | [
{
"version": "v1",
"created": "Mon, 22 Apr 2002 19:41:24 GMT"
},
{
"version": "v2",
"created": "Mon, 22 Apr 2002 21:56:55 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Ramakrishnan",
"Naren",
""
],
[
"Bailey-Kellogg",
"Chris",
""
]
] | TITLE: Sampling Strategies for Mining in Data-Scarce Domains
ABSTRACT: Data mining has traditionally focused on the task of drawing inferences from
large datasets. However, many scientific and engineering domains, such as fluid
dynamics and aircraft design, are characterized by scarce data, due to the
expense and c... |
cs/0204053 | Chris Bailey-Kellogg | Chris Bailey-Kellogg, Naren Ramakrishnan | Qualitative Analysis of Correspondence for Experimental Algorithmics | 11 pages | null | null | null | cs.AI cs.CE | null | Correspondence identifies relationships among objects via similarities among
their components; it is ubiquitous in the analysis of spatial datasets,
including images, weather maps, and computational simulations. This paper
develops a novel multi-level mechanism for qualitative analysis of
correspondence. Operators le... | [
{
"version": "v1",
"created": "Fri, 26 Apr 2002 17:25:51 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Bailey-Kellogg",
"Chris",
""
],
[
"Ramakrishnan",
"Naren",
""
]
] | TITLE: Qualitative Analysis of Correspondence for Experimental Algorithmics
ABSTRACT: Correspondence identifies relationships among objects via similarities among
their components; it is ubiquitous in the analysis of spatial datasets,
including images, weather maps, and computational simulations. This paper
develop... |
cs/0205065 | Lillian Lee | Regina Barzilay and Lillian Lee | Bootstrapping Lexical Choice via Multiple-Sequence Alignment | 8 pages; to appear in the proceedings of EMNLP-2002 | null | null | null | cs.CL | null | An important component of any generation system is the mapping dictionary, a
lexicon of elementary semantic expressions and corresponding natural language
realizations. Typically, labor-intensive knowledge-based methods are used to
construct the dictionary. We instead propose to acquire it automatically via a
novel m... | [
{
"version": "v1",
"created": "Sat, 25 May 2002 21:32:09 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Barzilay",
"Regina",
""
],
[
"Lee",
"Lillian",
""
]
] | TITLE: Bootstrapping Lexical Choice via Multiple-Sequence Alignment
ABSTRACT: An important component of any generation system is the mapping dictionary, a
lexicon of elementary semantic expressions and corresponding natural language
realizations. Typically, labor-intensive knowledge-based methods are used to
constr... |
cs/0206004 | Bart Goethals | Toon Calders, Bart Goethals | Mining All Non-Derivable Frequent Itemsets | 3 figures | null | null | null | cs.DB cs.AI | null | Recent studies on frequent itemset mining algorithms resulted in significant
performance improvements. However, if the minimal support threshold is set too
low, or the data is highly correlated, the number of frequent itemsets itself
can be prohibitively large. To overcome this problem, recently several
proposals hav... | [
{
"version": "v1",
"created": "Mon, 3 Jun 2002 14:13:51 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Calders",
"Toon",
""
],
[
"Goethals",
"Bart",
""
]
] | TITLE: Mining All Non-Derivable Frequent Itemsets
ABSTRACT: Recent studies on frequent itemset mining algorithms resulted in significant
performance improvements. However, if the minimal support threshold is set too
low, or the data is highly correlated, the number of frequent itemsets itself
can be prohibitively l... |
cs/0208011 | Jim Gray | Jim Gray, Wyman Chong, Tom Barclay, Alex Szalay, Jan vandenBerg | TeraScale SneakerNet: Using Inexpensive Disks for Backup, Archiving, and
Data Exchange | original at
http://research.microsoft.com/scripts/pubs/view.asp?TR_ID=MSR-TR-2002-54 | null | null | MSR-TR-2002-54 | cs.NI cs.DC | null | Large datasets are most economically trnsmitted via parcel post given the
current economics of wide-area networking. This article describes how the Sloan
Digital Sky Survey ships terabyte scale datasets both within the US and to
Europe and Asia. We 3GT storage bricks (Ghz processor, GB ram, GbpsEthernet, TB
disk) for... | [
{
"version": "v1",
"created": "Wed, 7 Aug 2002 22:32:46 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Gray",
"Jim",
""
],
[
"Chong",
"Wyman",
""
],
[
"Barclay",
"Tom",
""
],
[
"Szalay",
"Alex",
""
],
[
"vandenBerg",
"Jan",
""
]
] | TITLE: TeraScale SneakerNet: Using Inexpensive Disks for Backup, Archiving, and
Data Exchange
ABSTRACT: Large datasets are most economically trnsmitted via parcel post given the
current economics of wide-area networking. This article describes how the Sloan
Digital Sky Survey ships terabyte scale datasets both wi... |
cs/0208020 | Masaki Murata | Masaki Murata and Hitoshi Isahara | Using the DIFF Command for Natural Language Processing | 10 pages. Computation and Language. This paper is the rough English
translation of our Japanese papar | null | null | null | cs.CL | null | Diff is a software program that detects differences between two data sets and
is useful in natural language processing. This paper shows several examples of
the application of diff. They include the detection of differences between two
different datasets, extraction of rewriting rules, merging of two different
datase... | [
{
"version": "v1",
"created": "Tue, 13 Aug 2002 03:39:20 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Murata",
"Masaki",
""
],
[
"Isahara",
"Hitoshi",
""
]
] | TITLE: Using the DIFF Command for Natural Language Processing
ABSTRACT: Diff is a software program that detects differences between two data sets and
is useful in natural language processing. This paper shows several examples of
the application of diff. They include the detection of differences between two
differen... |
cs/0304037 | Judith Beumer | Sudharshan Vazhkudai and Jennifer M. Schopf | Using Regression Techniques to Predict Large Data Transfers | 29 pages, 11 figures | null | null | Preprint ANL/MCS-P1033-0303 | cs.DC | null | The recent proliferation of Data Grids and the increasingly common practice
of using resources as distributed data stores provide a convenient environment
for communities of researchers to share, replicate, and manage access to copies
of large datasets. This has led to the question of which replica can be
accessed mo... | [
{
"version": "v1",
"created": "Wed, 23 Apr 2003 20:36:09 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Vazhkudai",
"Sudharshan",
""
],
[
"Schopf",
"Jennifer M.",
""
]
] | TITLE: Using Regression Techniques to Predict Large Data Transfers
ABSTRACT: The recent proliferation of Data Grids and the increasingly common practice
of using resources as distributed data stores provide a convenient environment
for communities of researchers to share, replicate, and manage access to copies
of l... |
cs/0306048 | Judith Beumer | Jianwei Li, Wei-keng Liao, Alok Choudhary, Robert Ross, Rajeev Thakur,
William Gropp, Rob Latham | Parallel netCDF: A Scientific High-Performance I/O Interface | 10 pages,7 figures | null | null | Preprint ANL/MCS-P1048-0503 | cs.DC | null | Dataset storage, exchange, and access play a critical role in scientific
applications. For such purposes netCDF serves as a portable and efficient file
format and programming interface, which is popular in numerous scientific
application domains. However, the original interface does not provide an
efficient mechanism... | [
{
"version": "v1",
"created": "Wed, 11 Jun 2003 20:25:52 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Li",
"Jianwei",
""
],
[
"Liao",
"Wei-keng",
""
],
[
"Choudhary",
"Alok",
""
],
[
"Ross",
"Robert",
""
],
[
"Thakur",
"Rajeev",
""
],
[
"Gropp",
"William",
""
],
[
"Latham",
"Rob",
""
]
] | TITLE: Parallel netCDF: A Scientific High-Performance I/O Interface
ABSTRACT: Dataset storage, exchange, and access play a critical role in scientific
applications. For such purposes netCDF serves as a portable and efficient file
format and programming interface, which is popular in numerous scientific
application ... |
cs/0306061 | Artem Trunov | Tofigh Azemoon, Adil Hasan, Wilko Kroeger, Artem Trunov | Operational Aspects of Dealing with the Large BaBar Data Set | Presented for Computing in High Energy Physics, San Diego, March 2003 | null | null | null | cs.DB cs.DC | null | To date, the BaBar experiment has stored over 0.7PB of data in an
Objectivity/DB database. Approximately half this data-set comprises simulated
data of which more than 70% has been produced at more than 20 collaborating
institutes outside of SLAC. The operational aspects of managing such a large
data set and providin... | [
{
"version": "v1",
"created": "Fri, 13 Jun 2003 00:40:18 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Azemoon",
"Tofigh",
""
],
[
"Hasan",
"Adil",
""
],
[
"Kroeger",
"Wilko",
""
],
[
"Trunov",
"Artem",
""
]
] | TITLE: Operational Aspects of Dealing with the Large BaBar Data Set
ABSTRACT: To date, the BaBar experiment has stored over 0.7PB of data in an
Objectivity/DB database. Approximately half this data-set comprises simulated
data of which more than 70% has been produced at more than 20 collaborating
institutes outside... |
cs/0306068 | Pablo Saiz | Pablo Saiz, Predrag Buncic, Andreas J. Peters | AliEn Resource Brokers | 5 pages, 8 figures, CHEP 03 conference | null | null | null | cs.DC | null | AliEn (ALICE Environment) is a lightweight GRID framework developed by the
Alice Collaboration. When the experiment starts running, it will collect data
at a rate of approximately 2 PB per year, producing O(109) files per year. All
these files, including all simulated events generated during the preparation
phase of ... | [
{
"version": "v1",
"created": "Fri, 13 Jun 2003 16:00:45 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Saiz",
"Pablo",
""
],
[
"Buncic",
"Predrag",
""
],
[
"Peters",
"Andreas J.",
""
]
] | TITLE: AliEn Resource Brokers
ABSTRACT: AliEn (ALICE Environment) is a lightweight GRID framework developed by the
Alice Collaboration. When the experiment starts running, it will collect data
at a rate of approximately 2 PB per year, producing O(109) files per year. All
these files, including all simulated events ... |
cs/0306069 | Teela Pulliam | Teela Pulliam, Peter Elmer, Alvise Dorigo | Distributed Offline Data Reconstruction in BaBar | CHEP03 paper, MODT012 | null | null | SLAC-PUB-9903 | cs.DC | null | The BaBar experiment at SLAC is in its fourth year of running. The data
processing system has been continuously evolving to meet the challenges of
higher luminosity running and the increasing bulk of data to re-process each
year. To meet these goals a two-pass processing architecture has been adopted,
where 'rolling ... | [
{
"version": "v1",
"created": "Fri, 13 Jun 2003 16:16:44 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Pulliam",
"Teela",
""
],
[
"Elmer",
"Peter",
""
],
[
"Dorigo",
"Alvise",
""
]
] | TITLE: Distributed Offline Data Reconstruction in BaBar
ABSTRACT: The BaBar experiment at SLAC is in its fourth year of running. The data
processing system has been continuously evolving to meet the challenges of
higher luminosity running and the increasing bulk of data to re-process each
year. To meet these goals ... |
cs/0307032 | Praveen Boinee | M. Frailis, A. De Angelis, V. Roberto | Data Management and Mining in Astrophysical Databases | 10 pages, Latex | S. Ciprini, A. De Angelis, P. Lubrano and O. Mansutti (eds.):
Proc. of ``Science with the New Generation of High Energy Gamma-ray
Experiments'' (Perugia, Italy, May 2003). Forum, Udine 2003, p. 157 | null | null | cs.DB astro-ph physics.data-an | null | We analyse the issues involved in the management and mining of astrophysical
data. The traditional approach to data management in the astrophysical field is
not able to keep up with the increasing size of the data gathered by modern
detectors. An essential role in the astrophysical research will be assumed by
automat... | [
{
"version": "v1",
"created": "Sat, 12 Jul 2003 12:35:37 GMT"
},
{
"version": "v2",
"created": "Wed, 16 Jul 2003 12:49:46 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Frailis",
"M.",
""
],
[
"De Angelis",
"A.",
""
],
[
"Roberto",
"V.",
""
]
] | TITLE: Data Management and Mining in Astrophysical Databases
ABSTRACT: We analyse the issues involved in the management and mining of astrophysical
data. The traditional approach to data management in the astrophysical field is
not able to keep up with the increasing size of the data gathered by modern
detectors. A... |
cs/0307038 | Alfred Hero III | Jose Costa and Alfred Hero | Manifold Learning with Geodesic Minimal Spanning Trees | 13 pages, 3 figures | null | null | null | cs.CV cs.LG | null | In the manifold learning problem one seeks to discover a smooth low
dimensional surface, i.e., a manifold embedded in a higher dimensional linear
vector space, based on a set of measured sample points on the surface. In this
paper we consider the closely related problem of estimating the manifold's
intrinsic dimensio... | [
{
"version": "v1",
"created": "Wed, 16 Jul 2003 23:50:53 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Costa",
"Jose",
""
],
[
"Hero",
"Alfred",
""
]
] | TITLE: Manifold Learning with Geodesic Minimal Spanning Trees
ABSTRACT: In the manifold learning problem one seeks to discover a smooth low
dimensional surface, i.e., a manifold embedded in a higher dimensional linear
vector space, based on a set of measured sample points on the surface. In this
paper we consider t... |
cs/0311034 | Gibby Koldenhof | Gibby Koldenhof | Visualization of variations in human brain morphology using
differentiating reflection functions | 10 pages, keywords: MRI, Medical Visualization, Volume rendering,
BRDF, Specular reflection overlap | null | null | null | cs.GR | null | Conventional visualization media such as MRI prints and computer screens are
inherently two dimensional, making them incapable of displaying true 3D volume
data sets. By applying only transparency or intensity projection, and ignoring
light-matter interaction, results will likely fail to give optimal results.
Little ... | [
{
"version": "v1",
"created": "Sat, 22 Nov 2003 18:17:26 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Koldenhof",
"Gibby",
""
]
] | TITLE: Visualization of variations in human brain morphology using
differentiating reflection functions
ABSTRACT: Conventional visualization media such as MRI prints and computer screens are
inherently two dimensional, making them incapable of displaying true 3D volume
data sets. By applying only transparency or ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.