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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0711.0729 | Massimiliano Zanin | Massimiliano Zanin | Forbidden patterns in financial time series | 4 pages, 4 figures; affiliation updated | null | 10.1063/1.2841197 | null | q-fin.ST physics.data-an physics.soc-ph | null | The existence of forbidden patterns, i.e., certain missing sequences in a
given time series, is a recently proposed instrument of potential application
in the study of time series. Forbidden patterns are related to the permutation
entropy, which has the basic properties of classic chaos indicators, thus
allowing to s... | [
{
"version": "v1",
"created": "Mon, 5 Nov 2007 20:02:25 GMT"
},
{
"version": "v2",
"created": "Tue, 13 Nov 2007 18:58:11 GMT"
}
] | 2009-11-13T00:00:00 | [
[
"Zanin",
"Massimiliano",
""
]
] | TITLE: Forbidden patterns in financial time series
ABSTRACT: The existence of forbidden patterns, i.e., certain missing sequences in a
given time series, is a recently proposed instrument of potential application
in the study of time series. Forbidden patterns are related to the permutation
entropy, which has the b... |
0802.2138 | Mahesh Pal Dr. | Mahesh Pal and Paul M. Mather | Support Vector classifiers for Land Cover Classification | 11 pages, 1 figure, Published in MapIndia Conference 2003 | null | 10.1080/01431160802007624 | null | cs.NE cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Support vector machines represent a promising development in machine learning
research that is not widely used within the remote sensing community. This
paper reports the results of Multispectral(Landsat-7 ETM+) and Hyperspectral
DAIS)data in which multi-class SVMs are compared with maximum likelihood and
artificial ... | [
{
"version": "v1",
"created": "Fri, 15 Feb 2008 04:53:33 GMT"
}
] | 2009-11-13T00:00:00 | [
[
"Pal",
"Mahesh",
""
],
[
"Mather",
"Paul M.",
""
]
] | TITLE: Support Vector classifiers for Land Cover Classification
ABSTRACT: Support vector machines represent a promising development in machine learning
research that is not widely used within the remote sensing community. This
paper reports the results of Multispectral(Landsat-7 ETM+) and Hyperspectral
DAIS)data in... |
0805.2182 | Frederic Moisy | J. Seiwert, C. Morize, F. Moisy | On the decrease of intermittency in decaying rotating turbulence | 5 pages, 5 figures. In revision for Phys. Fluids Letters | Phys. Fluids 20, 071702 (2008). | 10.1063/1.2949313 | null | physics.flu-dyn | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The scaling of the longitudinal velocity structure functions, $S_q(r) = < |
\delta u (r) |^q > \sim r^{\zeta_q}$, is analyzed up to order $q=8$ in a
decaying rotating turbulence experiment from a large Particle Image Velocimetry
(PIV) dataset. The exponent of the second-order structure function, $\zeta_2$,
increases ... | [
{
"version": "v1",
"created": "Thu, 15 May 2008 15:36:45 GMT"
}
] | 2009-11-13T00:00:00 | [
[
"Seiwert",
"J.",
""
],
[
"Morize",
"C.",
""
],
[
"Moisy",
"F.",
""
]
] | TITLE: On the decrease of intermittency in decaying rotating turbulence
ABSTRACT: The scaling of the longitudinal velocity structure functions, $S_q(r) = < |
\delta u (r) |^q > \sim r^{\zeta_q}$, is analyzed up to order $q=8$ in a
decaying rotating turbulence experiment from a large Particle Image Velocimetry
(PIV)... |
0807.2515 | Joseph Mohr | Joseph J. Mohr (1), Wayne Barkhouse (2), Cristina Beldica (1),
Emmanuel Bertin (3), Y. Dora Cai (1), Luiz da Costa (4), J. Anthony Darnell
(1), Gregory E. Daues (1), Michael Jarvis (5), Michelle Gower (1), Huan Lin
(6), leandro Martelli (4), Eric Neilsen (6), Chow-Choong Ngeow (1), Ricardo
Ogando (4), Alex Parg... | The Dark Energy Survey Data Management System | To be published in the proceedings of the SPIE conference on
Astronomical Instrumentation (held in Marseille in June 2008). This preprint
is made available with the permission of SPIE. Further information together
with preprint containing full quality images is available at
http://desweb.cosmology.uiuc.edu/wiki | null | 10.1117/12.789550 | null | astro-ph cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Dark Energy Survey collaboration will study cosmic acceleration with a
5000 deg2 griZY survey in the southern sky over 525 nights from 2011-2016. The
DES data management (DESDM) system will be used to process and archive these
data and the resulting science ready data products. The DESDM system consists
of an int... | [
{
"version": "v1",
"created": "Wed, 16 Jul 2008 08:37:43 GMT"
}
] | 2009-11-13T00:00:00 | [
[
"Mohr",
"Joseph J.",
""
],
[
"Barkhouse",
"Wayne",
""
],
[
"Beldica",
"Cristina",
""
],
[
"Bertin",
"Emmanuel",
""
],
[
"Cai",
"Y. Dora",
""
],
[
"da Costa",
"Luiz",
""
],
[
"Darnell",
"J. Anthony",
""
],... | TITLE: The Dark Energy Survey Data Management System
ABSTRACT: The Dark Energy Survey collaboration will study cosmic acceleration with a
5000 deg2 griZY survey in the southern sky over 525 nights from 2011-2016. The
DES data management (DESDM) system will be used to process and archive these
data and the resulting... |
0812.1178 | Serge Meimon | Serge Meimon, Laurent M. Mugnier and Guy Le Besnerais | A self-calibration approach for optical long baseline interferometry
imaging | null | null | 10.1364/JOSAA.26.000108 | null | physics.optics | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current optical interferometers are affected by unknown turbulent phases on
each telescope. In the field of radio-interferometry, the self-calibration
technique is a powerful tool to process interferometric data with missing phase
information. This paper intends to revisit the application of self-calibration
to Optic... | [
{
"version": "v1",
"created": "Fri, 5 Dec 2008 16:51:34 GMT"
}
] | 2009-11-13T00:00:00 | [
[
"Meimon",
"Serge",
""
],
[
"Mugnier",
"Laurent M.",
""
],
[
"Besnerais",
"Guy Le",
""
]
] | TITLE: A self-calibration approach for optical long baseline interferometry
imaging
ABSTRACT: Current optical interferometers are affected by unknown turbulent phases on
each telescope. In the field of radio-interferometry, the self-calibration
technique is a powerful tool to process interferometric data with mis... |
physics/0608069 | Andreas P. Nawroth | A. P. Nawroth and J. Peinke | Multiscale reconstruction of time series | 4 pages, 3 figures | null | 10.1016/j.physleta.2006.08.024 | null | physics.data-an | null | A new method is proposed which allows a reconstruction of time series based
on higher order multiscale statistics given by a hierarchical process. This
method is able to model the time series not only on a specific scale but for a
range of scales. It is possible to generate complete new time series, or to
model the n... | [
{
"version": "v1",
"created": "Mon, 7 Aug 2006 17:33:31 GMT"
}
] | 2009-11-13T00:00:00 | [
[
"Nawroth",
"A. P.",
""
],
[
"Peinke",
"J.",
""
]
] | TITLE: Multiscale reconstruction of time series
ABSTRACT: A new method is proposed which allows a reconstruction of time series based
on higher order multiscale statistics given by a hierarchical process. This
method is able to model the time series not only on a specific scale but for a
range of scales. It is poss... |
astro-ph/0605042 | Somak Raychaudhury | Juan C. Cuevas-Tello (1,3), Peter Tino (1) and Somak Raychaudhury (2)
((1) School of Computer Science, University of Birmingham, UK; (2) School of
Physics & Astronomy, University of Birmingham, UK; (3) University of San Luis
Potosi, Mexico) | How accurate are the time delay estimates in gravitational lensing? | 14 pages, 12 figures; accepted for publication in Astronomy &
Astrophysics | Astron.Astrophys. 454 (2006) 695-706 | 10.1051/0004-6361:20054652 | null | astro-ph cs.LG | null | We present a novel approach to estimate the time delay between light curves
of multiple images in a gravitationally lensed system, based on Kernel methods
in the context of machine learning. We perform various experiments with
artificially generated irregularly-sampled data sets to study the effect of the
various lev... | [
{
"version": "v1",
"created": "Mon, 1 May 2006 20:42:03 GMT"
}
] | 2009-11-11T00:00:00 | [
[
"Cuevas-Tello",
"Juan C.",
""
],
[
"Tino",
"Peter",
""
],
[
"Raychaudhury",
"Somak",
""
]
] | TITLE: How accurate are the time delay estimates in gravitational lensing?
ABSTRACT: We present a novel approach to estimate the time delay between light curves
of multiple images in a gravitationally lensed system, based on Kernel methods
in the context of machine learning. We perform various experiments with
arti... |
physics/0509247 | Jose J. Ramasco | Jose J. Ramasco, Steven A. Morris | Social inertia in collaboration networks | 7 pages, 5 figures | Phys. Rev. E 73, 016122 (2006) | 10.1103/PhysRevE.73.016122 | null | physics.soc-ph cond-mat.stat-mech | null | This work is a study of the properties of collaboration networks employing
the formalism of weighted graphs to represent their one-mode projection. The
weight of the edges is directly the number of times that a partnership has been
repeated. This representation allows us to define the concept of "social
inertia" that... | [
{
"version": "v1",
"created": "Thu, 29 Sep 2005 15:35:00 GMT"
}
] | 2009-11-11T00:00:00 | [
[
"Ramasco",
"Jose J.",
""
],
[
"Morris",
"Steven A.",
""
]
] | TITLE: Social inertia in collaboration networks
ABSTRACT: This work is a study of the properties of collaboration networks employing
the formalism of weighted graphs to represent their one-mode projection. The
weight of the edges is directly the number of times that a partnership has been
repeated. This representat... |
physics/0601223 | Kwang-Il Goh | K.-I. Goh, Y.-H. Eom, H. Jeong, B. Kahng, and D. Kim | Structure and evolution of online social relationships: Heterogeneity in
warm discussions | 7 pages, 7 figures, 2 tables | null | 10.1103/PhysRevE.73.066123 | null | physics.data-an cond-mat.stat-mech physics.soc-ph | null | With the advancement in the information age, people are using electronic
media more frequently for communications, and social relationships are also
increasingly resorting to online channels. While extensive studies on
traditional social networks have been carried out, little has been done on
online social network. H... | [
{
"version": "v1",
"created": "Tue, 31 Jan 2006 17:27:30 GMT"
}
] | 2009-11-11T00:00:00 | [
[
"Goh",
"K. -I.",
""
],
[
"Eom",
"Y. -H.",
""
],
[
"Jeong",
"H.",
""
],
[
"Kahng",
"B.",
""
],
[
"Kim",
"D.",
""
]
] | TITLE: Structure and evolution of online social relationships: Heterogeneity in
warm discussions
ABSTRACT: With the advancement in the information age, people are using electronic
media more frequently for communications, and social relationships are also
increasingly resorting to online channels. While extensive... |
0911.1455 | Loet Leydesdorff | Wilfred Dolfsma, Loet Leydesdorff | "Medium-tech" industries may be of greater importance to a local economy
than "High-tech" firms: New methods for measuring the knowledge base of an
economic system | null | Medical Hypotheses, 71(3) (2008) 330-334 | null | null | physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we offer a way to measure the knowledge base of an economy in
terms of probabilistic entropy. This measure, we hypothesize, is an indication
of the extent to which a system, including the economic system, self-organizes.
In a self-organizing system, interactions between dimensions or subsystems will
uni... | [
{
"version": "v1",
"created": "Sat, 7 Nov 2009 19:42:43 GMT"
}
] | 2009-11-10T00:00:00 | [
[
"Dolfsma",
"Wilfred",
""
],
[
"Leydesdorff",
"Loet",
""
]
] | TITLE: "Medium-tech" industries may be of greater importance to a local economy
than "High-tech" firms: New methods for measuring the knowledge base of an
economic system
ABSTRACT: In this paper we offer a way to measure the knowledge base of an economy in
terms of probabilistic entropy. This measure, we hypoth... |
astro-ph/0310624 | Anil K. Pradhan | Sultana N. Nahar and Anil K. Pradhan (Ohio State) | Self-Consistent R-matrix Approach To Photoionization And Unified
Electron-Ion Recombination | 33 pages, 13 figures, Review in "Radiation Processes In Physics and
Chemistry", Elsevier (in press). Postscript file with higher resolution
figures at http://www.astronomy.ohio-state.edu/~pradhan/pr.ps | Radiat.Phys.Chem. 70 (2004) 323-344 | 10.1016/j.radphyschem.2003.12.019 | null | astro-ph physics.atom-ph | null | A unified scheme using the R-matrix method has been developed for
electron-ion recombination subsuming heretofore separate treatments of
radiative and dielectronic recombination (RR and DR). The ab initio coupled
channel approach unifies resonant and non-resonant phenomena, and enables a
general and self-consistent t... | [
{
"version": "v1",
"created": "Tue, 21 Oct 2003 20:20:15 GMT"
}
] | 2009-11-10T00:00:00 | [
[
"Nahar",
"Sultana N.",
"",
"Ohio State"
],
[
"Pradhan",
"Anil K.",
"",
"Ohio State"
]
] | TITLE: Self-Consistent R-matrix Approach To Photoionization And Unified
Electron-Ion Recombination
ABSTRACT: A unified scheme using the R-matrix method has been developed for
electron-ion recombination subsuming heretofore separate treatments of
radiative and dielectronic recombination (RR and DR). The ab initio ... |
astro-ph/0410487 | Dirk Petry | Dirk Petry (Joint Center for Astrophysics, UMBC & NASA/GSFC) | The Earth's Gamma-ray Albedo as observed by EGRET | To be published in the proceedings of the Gamma 2004 Symposium on
High-Energy Gamma-Ray Astronomy, Heidelberg, July, 2004 (AIP Proceedings
Series) | null | 10.1063/1.1878488 | null | astro-ph physics.geo-ph | null | The Earth's high energy gamma-ray emission is caused by cosmic ray
interactions with the atmosphere. The EGRET detector on-board the CGRO
satellite is only the second experiment (after SAS-2) to provide a suitable
dataset for the comprehensive study of this emission. Approximately 60% of the
EGRET dataset consist of ... | [
{
"version": "v1",
"created": "Wed, 20 Oct 2004 19:09:38 GMT"
}
] | 2009-11-10T00:00:00 | [
[
"Petry",
"Dirk",
"",
"Joint Center for Astrophysics, UMBC & NASA/GSFC"
]
] | TITLE: The Earth's Gamma-ray Albedo as observed by EGRET
ABSTRACT: The Earth's high energy gamma-ray emission is caused by cosmic ray
interactions with the atmosphere. The EGRET detector on-board the CGRO
satellite is only the second experiment (after SAS-2) to provide a suitable
dataset for the comprehensive study... |
cs/0402016 | Marco Frailis | M. Frailis, A. De Angelis, V. Roberto | Perspects in astrophysical databases | null | Physica A338 (2004) 54-59 | 10.1016/j.physa.2004.02.024 | null | cs.DB astro-ph | null | Astrophysics has become a domain extremely rich of scientific data. Data
mining tools are needed for information extraction from such large datasets.
This asks for an approach to data management emphasizing the efficiency and
simplicity of data access; efficiency is obtained using multidimensional access
methods and ... | [
{
"version": "v1",
"created": "Mon, 9 Feb 2004 19:13:17 GMT"
}
] | 2009-11-10T00:00:00 | [
[
"Frailis",
"M.",
""
],
[
"De Angelis",
"A.",
""
],
[
"Roberto",
"V.",
""
]
] | TITLE: Perspects in astrophysical databases
ABSTRACT: Astrophysics has become a domain extremely rich of scientific data. Data
mining tools are needed for information extraction from such large datasets.
This asks for an approach to data management emphasizing the efficiency and
simplicity of data access; efficienc... |
physics/0307098 | Alessandra Retico | A. Lauria, M.E. Fantacci, U. Bottigli, P. Delogu, F. Fauci, B.
Golosio, P.L. Indovina, G.L. Masala, P. Oliva, R. Palmiero, G. Raso, S.
Stumbo, S. Tangaro | Diagnostic performance of radiologists with and without different CAD
systems for mammography | 6 pages, 3 figures; to appear in the Proceedings of The International
Society for Optical Engineering, SPIE Conference, 15-20 February 2003, San
Diego, California, USA | null | 10.1117/12.480079 | null | physics.med-ph | null | The purpose of this study is the evaluation of the variation of performance
in terms of sensitivity and specificity of two radiologists with different
experience in mammography, with and without the assistance of two different CAD
systems. The CAD considered are SecondLookTM (CADx Medical Systems, Canada),
and CALMA ... | [
{
"version": "v1",
"created": "Sat, 19 Jul 2003 13:22:06 GMT"
}
] | 2009-11-10T00:00:00 | [
[
"Lauria",
"A.",
""
],
[
"Fantacci",
"M. E.",
""
],
[
"Bottigli",
"U.",
""
],
[
"Delogu",
"P.",
""
],
[
"Fauci",
"F.",
""
],
[
"Golosio",
"B.",
""
],
[
"Indovina",
"P. L.",
""
],
[
"Masala",
"G. ... | TITLE: Diagnostic performance of radiologists with and without different CAD
systems for mammography
ABSTRACT: The purpose of this study is the evaluation of the variation of performance
in terms of sensitivity and specificity of two radiologists with different
experience in mammography, with and without the assi... |
physics/0312077 | Guglielmo Lacorata | Guglielmo Lacorata, Erik Aurell, Bernard Legras and Angelo Vulpiani | Evidence for a k^{-5/3} spectrum from the EOLE Lagrangian balloons in
the low stratosphere | 19 pages, 1 table + 5 (pdf) figures | J. Atmos. Sci. 61, 23, 2936-2942 (2004) | 10.1175/JAS-3292.1 | null | physics.ao-ph nlin.CD | null | The EOLE Experiment is revisited to study turbulent processes in the lower
stratosphere circulation from a Lagrangian viewpoint and resolve a discrepancy
on the slope of the atmospheric energy spectrum between the work of Morel and
Larcheveque (1974) and recent studies using aircraft data. Relative dispersion
of ball... | [
{
"version": "v1",
"created": "Thu, 11 Dec 2003 16:46:41 GMT"
}
] | 2009-11-10T00:00:00 | [
[
"Lacorata",
"Guglielmo",
""
],
[
"Aurell",
"Erik",
""
],
[
"Legras",
"Bernard",
""
],
[
"Vulpiani",
"Angelo",
""
]
] | TITLE: Evidence for a k^{-5/3} spectrum from the EOLE Lagrangian balloons in
the low stratosphere
ABSTRACT: The EOLE Experiment is revisited to study turbulent processes in the lower
stratosphere circulation from a Lagrangian viewpoint and resolve a discrepancy
on the slope of the atmospheric energy spectrum betw... |
physics/0104028 | Wentian Li | Wentian Li | Zipf's Law in Importance of Genes for Cancer Classification Using
Microarray Data | 11 pages, 5 figures. submitted | W Li and Y Yang (2002), J. Theoretical Biology, 219(4):539-551. | 10.1006/jtbi.2002.3145 | physics/0104028 | physics.bio-ph physics.data-an q-bio.QM | null | Microarray data consists of mRNA expression levels of thousands of genes
under certain conditions. A difference in the expression level of a gene at two
different conditions/phenotypes, such as cancerous versus non-cancerous, one
subtype of cancer versus another, before versus after a drug treatment, is
indicative of... | [
{
"version": "v1",
"created": "Fri, 6 Apr 2001 00:07:44 GMT"
}
] | 2009-11-09T00:00:00 | [
[
"Li",
"Wentian",
""
]
] | TITLE: Zipf's Law in Importance of Genes for Cancer Classification Using
Microarray Data
ABSTRACT: Microarray data consists of mRNA expression levels of thousands of genes
under certain conditions. A difference in the expression level of a gene at two
different conditions/phenotypes, such as cancerous versus non-... |
cs/0208013 | Jim Gray | Alexander S. Szalay, Jim Gray, Jan vandenBerg | Petabyte Scale Data Mining: Dream or Reality? | originals at
http://research.microsoft.com/scripts/pubs/view.asp?TR_ID=MSR-TR-2002-84 | SIPE Astronmy Telescopes and Instruments, 22-28 August 2002,
Waikoloa, Hawaii | 10.1117/12.461427 | MSR-TR-2002-84 | cs.DB cs.CE | null | Science is becoming very data intensive1. Today's astronomy datasets with
tens of millions of galaxies already present substantial challenges for data
mining. In less than 10 years the catalogs are expected to grow to billions of
objects, and image archives will reach Petabytes. Imagine having a 100GB
database in 199... | [
{
"version": "v1",
"created": "Wed, 7 Aug 2002 22:49:56 GMT"
}
] | 2009-11-07T00:00:00 | [
[
"Szalay",
"Alexander S.",
""
],
[
"Gray",
"Jim",
""
],
[
"vandenBerg",
"Jan",
""
]
] | TITLE: Petabyte Scale Data Mining: Dream or Reality?
ABSTRACT: Science is becoming very data intensive1. Today's astronomy datasets with
tens of millions of galaxies already present substantial challenges for data
mining. In less than 10 years the catalogs are expected to grow to billions of
objects, and image arch... |
cs/0208015 | Jim Gray | Alexander S. Szalay, Tamas Budavari, Andrew Connolly, Jim Gray,
Takahiko Matsubara, Adrian Pope, Istvan Szapudi | Spatial Clustering of Galaxies in Large Datasets | original documents at
http://research.microsoft.com/scripts/pubs/view.asp?TR_ID=MSR-TR-2002-86 | SIPE Astronomy Telescopes and Instruments, 22-28 August 2002,
Waikoloa, Hawaii | 10.1117/12.476761 | TR_ID=MSR-TR-2002-86 | cs.DB cs.DS | null | Datasets with tens of millions of galaxies present new challenges for the
analysis of spatial clustering. We have built a framework that integrates a
database of object catalogs, tools for creating masks of bad regions, and a
fast (NlogN) correlation code. This system has enabled unprecedented efficiency
in carrying ... | [
{
"version": "v1",
"created": "Wed, 7 Aug 2002 23:06:40 GMT"
}
] | 2009-11-07T00:00:00 | [
[
"Szalay",
"Alexander S.",
""
],
[
"Budavari",
"Tamas",
""
],
[
"Connolly",
"Andrew",
""
],
[
"Gray",
"Jim",
""
],
[
"Matsubara",
"Takahiko",
""
],
[
"Pope",
"Adrian",
""
],
[
"Szapudi",
"Istvan",
""
]
] | TITLE: Spatial Clustering of Galaxies in Large Datasets
ABSTRACT: Datasets with tens of millions of galaxies present new challenges for the
analysis of spatial clustering. We have built a framework that integrates a
database of object catalogs, tools for creating masks of bad regions, and a
fast (NlogN) correlation... |
astro-ph/0103178 | Anil K. Pradhan | Hong Lin Zhang (Los Alamos National Laboratory), Sultana N. Nahar and
Anil K. Pradhan (Ohio State University) | Relativistic close coupling calculations for photoionization and
recombination of Ne-like Fe XVII | 19 pages, 8 figures, Phys. Rev. A (submitted) | null | 10.1103/PhysRevA.64.032719 | null | astro-ph physics.atom-ph | null | Relativistic and channel coupling effects in photoionization and unified
electronic recombination of Fe XVII are demonstrated with an extensive 60-level
close coupling calculation using the Breit-Pauli R-matrix method.
Photoionization and (e + ion) recombination calculations are carried out for
the total and the leve... | [
{
"version": "v1",
"created": "Mon, 12 Mar 2001 22:33:34 GMT"
}
] | 2009-11-06T00:00:00 | [
[
"Zhang",
"Hong Lin",
"",
"Los Alamos National Laboratory"
],
[
"Nahar",
"Sultana N.",
"",
"Ohio State University"
],
[
"Pradhan",
"Anil K.",
"",
"Ohio State University"
]
] | TITLE: Relativistic close coupling calculations for photoionization and
recombination of Ne-like Fe XVII
ABSTRACT: Relativistic and channel coupling effects in photoionization and unified
electronic recombination of Fe XVII are demonstrated with an extensive 60-level
close coupling calculation using the Breit-Pau... |
physics/0004009 | Gaddy Getz | G. Getz, E. Levine and E. Domany | Coupled Two-Way Clustering Analysis of Gene Microarray Data | null | null | 10.1073/pnas.210134797 | null | physics.bio-ph physics.comp-ph physics.data-an q-bio.QM | null | We present a novel coupled two-way clustering approach to gene microarray
data analysis. The main idea is to identify subsets of the genes and samples,
such that when one of these is used to cluster the other, stable and
significant partitions emerge. The search for such subsets is a computationally
complex task: we ... | [
{
"version": "v1",
"created": "Tue, 4 Apr 2000 14:10:53 GMT"
}
] | 2009-11-06T00:00:00 | [
[
"Getz",
"G.",
""
],
[
"Levine",
"E.",
""
],
[
"Domany",
"E.",
""
]
] | TITLE: Coupled Two-Way Clustering Analysis of Gene Microarray Data
ABSTRACT: We present a novel coupled two-way clustering approach to gene microarray
data analysis. The main idea is to identify subsets of the genes and samples,
such that when one of these is used to cluster the other, stable and
significant partit... |
0911.0674 | James Bagrow | James P. Bagrow, Tal Koren | Investigating Bimodal Clustering in Human Mobility | 4 pages, 2 figures | International Conference on Computational Science and Engineering,
4: 944-947, 2009 | 10.1109/CSE.2009.283 | null | physics.data-an physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We apply a simple clustering algorithm to a large dataset of cellular
telecommunication records, reducing the complexity of mobile phone users' full
trajectories and allowing for simple statistics to characterize their
properties. For the case of two clusters, we quantify how clustered human
mobility is, how much of ... | [
{
"version": "v1",
"created": "Tue, 3 Nov 2009 21:42:02 GMT"
}
] | 2009-11-05T00:00:00 | [
[
"Bagrow",
"James P.",
""
],
[
"Koren",
"Tal",
""
]
] | TITLE: Investigating Bimodal Clustering in Human Mobility
ABSTRACT: We apply a simple clustering algorithm to a large dataset of cellular
telecommunication records, reducing the complexity of mobile phone users' full
trajectories and allowing for simple statistics to characterize their
properties. For the case of t... |
0911.0787 | Rdv Ijcsis | Shailendra Singh, Sanjay Silakari | Generalized Discriminant Analysis algorithm for feature reduction in
Cyber Attack Detection System | 8 pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS 2009, ISSN 1947 5500, Impact Factor 0.423,
http://sites.google.com/site/ijcsis/ | International Journal of Computer Science and Information
Security, IJCSIS, Vol. 6, No. 1, pp. 173-180, October 2009, USA | null | ISSN 1947 5500 | cs.CR cs.CV cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This Generalized Discriminant Analysis (GDA) has provided an extremely
powerful approach to extracting non linear features. The network traffic data
provided for the design of intrusion detection system always are large with
ineffective information, thus we need to remove the worthless information from
the original h... | [
{
"version": "v1",
"created": "Wed, 4 Nov 2009 11:29:57 GMT"
}
] | 2009-11-05T00:00:00 | [
[
"Singh",
"Shailendra",
""
],
[
"Silakari",
"Sanjay",
""
]
] | TITLE: Generalized Discriminant Analysis algorithm for feature reduction in
Cyber Attack Detection System
ABSTRACT: This Generalized Discriminant Analysis (GDA) has provided an extremely
powerful approach to extracting non linear features. The network traffic data
provided for the design of intrusion detection sy... |
0911.0460 | Lester Mackey | Joseph Sill, Gabor Takacs, Lester Mackey, David Lin | Feature-Weighted Linear Stacking | 17 pages, 1 figure, 2 tables | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Ensemble methods, such as stacking, are designed to boost predictive accuracy
by blending the predictions of multiple machine learning models. Recent work
has shown that the use of meta-features, additional inputs describing each
example in a dataset, can boost the performance of ensemble methods, but the
greatest re... | [
{
"version": "v1",
"created": "Tue, 3 Nov 2009 08:17:05 GMT"
},
{
"version": "v2",
"created": "Wed, 4 Nov 2009 08:55:28 GMT"
}
] | 2009-11-04T00:00:00 | [
[
"Sill",
"Joseph",
""
],
[
"Takacs",
"Gabor",
""
],
[
"Mackey",
"Lester",
""
],
[
"Lin",
"David",
""
]
] | TITLE: Feature-Weighted Linear Stacking
ABSTRACT: Ensemble methods, such as stacking, are designed to boost predictive accuracy
by blending the predictions of multiple machine learning models. Recent work
has shown that the use of meta-features, additional inputs describing each
example in a dataset, can boost the ... |
0911.0465 | Konstantinos Pelechrinis | Theodoros Lappas, Konstantinos Pelechrinis, Michalis Faloutsos | A Simple Conceptual Generator for the Internet Graph | 9 pages | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The evolution of the Internet during the last years, has lead to a dramatic
increase of the size of its graph at the Autonomous System (AS) level. Soon -
if not already - its size will make the latter impractical for use from the
research community, e.g. for protocol testing. Reproducing a smaller size,
snapshot of t... | [
{
"version": "v1",
"created": "Tue, 3 Nov 2009 00:38:01 GMT"
}
] | 2009-11-04T00:00:00 | [
[
"Lappas",
"Theodoros",
""
],
[
"Pelechrinis",
"Konstantinos",
""
],
[
"Faloutsos",
"Michalis",
""
]
] | TITLE: A Simple Conceptual Generator for the Internet Graph
ABSTRACT: The evolution of the Internet during the last years, has lead to a dramatic
increase of the size of its graph at the Autonomous System (AS) level. Soon -
if not already - its size will make the latter impractical for use from the
research communi... |
astro-ph/0002230 | Anil K. Pradhan | Sultana N. Nahar (1), Franck Delahaye (1), Anil K. Pradhan (1), C.J.
Zeippen (2) (1 - Ohio State University, 2 - Observatoire de Meudon) | Atomic data from the Iron Project.XLIII. Transition probabilities for Fe
V | 19 pages, 1 figure. This paper marks the beginning of a large-scale
effort of ab initio atomic calculations that should eventually lead to
re-calculation of accurate iron opacities. Astron. Astrophys. Suppl. Ser. (in
press) | null | 10.1051/aas:2000339 | null | astro-ph physics.atom-ph | null | An extensive set of dipole-allowed, intercombination, and forbidden
transition probabilities for Fe V is presented. The Breit-Pauli R-matrix (BPRM)
method is used to calculate 1.46 x 10^6 oscillator strengths for the allowed
and intercombination E1 transitions among 3,865 fine-structure levels dominated
by configurat... | [
{
"version": "v1",
"created": "Thu, 10 Feb 2000 16:27:57 GMT"
}
] | 2009-10-31T00:00:00 | [
[
"Nahar",
"Sultana N.",
""
],
[
"Delahaye",
"Franck",
""
],
[
"Pradhan",
"Anil K.",
""
],
[
"Zeippen",
"C. J.",
""
]
] | TITLE: Atomic data from the Iron Project.XLIII. Transition probabilities for Fe
V
ABSTRACT: An extensive set of dipole-allowed, intercombination, and forbidden
transition probabilities for Fe V is presented. The Breit-Pauli R-matrix (BPRM)
method is used to calculate 1.46 x 10^6 oscillator strengths for the allow... |
astro-ph/9911102 | Raul Jimenez | Alan Heavens (IfA, Edinburgh), Raul Jimenez (IfA, Edinburgh), Ofer
Lahav (IoA, Cambridge) | Massive Lossless Data Compression and Multiple Parameter Estimation from
Galaxy Spectra | Minor modifications to match revised version accepted by MNRAS | Mon.Not.Roy.Astron.Soc. 317 (2000) 965 | 10.1046/j.1365-8711.2000.03692.x | null | astro-ph math.RA physics.data-an | null | We present a method for radical linear compression of datasets where the data
are dependent on some number $M$ of parameters. We show that, if the noise in
the data is independent of the parameters, we can form $M$ linear combinations
of the data which contain as much information about all the parameters as the
entir... | [
{
"version": "v1",
"created": "Sat, 6 Nov 1999 01:01:09 GMT"
},
{
"version": "v2",
"created": "Tue, 23 May 2000 10:29:36 GMT"
}
] | 2009-10-31T00:00:00 | [
[
"Heavens",
"Alan",
"",
"IfA, Edinburgh"
],
[
"Jimenez",
"Raul",
"",
"IfA, Edinburgh"
],
[
"Lahav",
"Ofer",
"",
"IoA, Cambridge"
]
] | TITLE: Massive Lossless Data Compression and Multiple Parameter Estimation from
Galaxy Spectra
ABSTRACT: We present a method for radical linear compression of datasets where the data
are dependent on some number $M$ of parameters. We show that, if the noise in
the data is independent of the parameters, we can for... |
0806.3284 | Daniel M. Gordon | Daniel M. Gordon, Victor Miller and Peter Ostapenko | Optimal hash functions for approximate closest pairs on the n-cube | IEEE Transactions on Information Theory, to appear | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One way to find closest pairs in large datasets is to use hash functions. In
recent years locality-sensitive hash functions for various metrics have been
given: projecting an n-cube onto k bits is simple hash function that performs
well. In this paper we investigate alternatives to projection. For various
parameters ... | [
{
"version": "v1",
"created": "Fri, 20 Jun 2008 17:19:44 GMT"
},
{
"version": "v2",
"created": "Thu, 15 Oct 2009 15:40:02 GMT"
}
] | 2009-10-15T00:00:00 | [
[
"Gordon",
"Daniel M.",
""
],
[
"Miller",
"Victor",
""
],
[
"Ostapenko",
"Peter",
""
]
] | TITLE: Optimal hash functions for approximate closest pairs on the n-cube
ABSTRACT: One way to find closest pairs in large datasets is to use hash functions. In
recent years locality-sensitive hash functions for various metrics have been
given: projecting an n-cube onto k bits is simple hash function that performs
... |
0910.2279 | Chunhua Shen | Chunhua Shen, Junae Kim, Lei Wang, Anton van den Hengel | Positive Semidefinite Metric Learning with Boosting | 11 pages, Twenty-Third Annual Conference on Neural Information
Processing Systems (NIPS 2009), Vancouver, Canada | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The learning of appropriate distance metrics is a critical problem in image
classification and retrieval. In this work, we propose a boosting-based
technique, termed \BoostMetric, for learning a Mahalanobis distance metric. One
of the primary difficulties in learning such a metric is to ensure that the
Mahalanobis ma... | [
{
"version": "v1",
"created": "Tue, 13 Oct 2009 00:54:31 GMT"
}
] | 2009-10-14T00:00:00 | [
[
"Shen",
"Chunhua",
""
],
[
"Kim",
"Junae",
""
],
[
"Wang",
"Lei",
""
],
[
"Hengel",
"Anton van den",
""
]
] | TITLE: Positive Semidefinite Metric Learning with Boosting
ABSTRACT: The learning of appropriate distance metrics is a critical problem in image
classification and retrieval. In this work, we propose a boosting-based
technique, termed \BoostMetric, for learning a Mahalanobis distance metric. One
of the primary diff... |
0910.2405 | Maya Ramanath | Maya Ramanath, Kondreddi Sarath Kumar, Georgiana Ifrim | Generating Concise and Readable Summaries of XML Documents | null | null | null | MPI-I-2009-5-002 | cs.IR cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | XML has become the de-facto standard for data representation and exchange,
resulting in large scale repositories and warehouses of XML data. In order for
users to understand and explore these large collections, a summarized, bird's
eye view of the available data is a necessity. In this paper, we are interested
in sem... | [
{
"version": "v1",
"created": "Tue, 13 Oct 2009 14:19:01 GMT"
}
] | 2009-10-14T00:00:00 | [
[
"Ramanath",
"Maya",
""
],
[
"Kumar",
"Kondreddi Sarath",
""
],
[
"Ifrim",
"Georgiana",
""
]
] | TITLE: Generating Concise and Readable Summaries of XML Documents
ABSTRACT: XML has become the de-facto standard for data representation and exchange,
resulting in large scale repositories and warehouses of XML data. In order for
users to understand and explore these large collections, a summarized, bird's
eye view... |
0910.1849 | N Vunka Jungum | Sanjay Silakari, Mahesh Motwani and Manish Maheshwari | Color Image Clustering using Block Truncation Algorithm | " International Journal of Computer Science Issues, IJCSI, Volume 4,
Issue 2, pp31-35, September 2009" | S. Silakari, M. Motwani and M. Maheshwari," Color Image Clustering
using Block Truncation Algorithm", International Journal of Computer Science
Issues, IJCSI, Volume 4, Issue 2, pp31-35, September 2009 | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the advancement in image capturing device, the image data been generated
at high volume. If images are analyzed properly, they can reveal useful
information to the human users. Content based image retrieval address the
problem of retrieving images relevant to the user needs from image databases on
the basis of l... | [
{
"version": "v1",
"created": "Fri, 9 Oct 2009 20:21:23 GMT"
}
] | 2009-10-13T00:00:00 | [
[
"Silakari",
"Sanjay",
""
],
[
"Motwani",
"Mahesh",
""
],
[
"Maheshwari",
"Manish",
""
]
] | TITLE: Color Image Clustering using Block Truncation Algorithm
ABSTRACT: With the advancement in image capturing device, the image data been generated
at high volume. If images are analyzed properly, they can reveal useful
information to the human users. Content based image retrieval address the
problem of retrievi... |
0910.1650 | Dingyin Xia | Dingyin Xia, Fei Wu, Xuqing Zhang, Yueting Zhuang | Local and global approaches of affinity propagation clustering for large
scale data | 9 pages | J Zhejiang Univ Sci A 2008 9(10):1373-1381 | 10.1631/jzus.A0720058 | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently a new clustering algorithm called 'affinity propagation' (AP) has
been proposed, which efficiently clustered sparsely related data by passing
messages between data points. However, we want to cluster large scale data
where the similarities are not sparse in many cases. This paper presents two
variants of AP ... | [
{
"version": "v1",
"created": "Fri, 9 Oct 2009 04:55:41 GMT"
}
] | 2009-10-12T00:00:00 | [
[
"Xia",
"Dingyin",
""
],
[
"Wu",
"Fei",
""
],
[
"Zhang",
"Xuqing",
""
],
[
"Zhuang",
"Yueting",
""
]
] | TITLE: Local and global approaches of affinity propagation clustering for large
scale data
ABSTRACT: Recently a new clustering algorithm called 'affinity propagation' (AP) has
been proposed, which efficiently clustered sparsely related data by passing
messages between data points. However, we want to cluster larg... |
0910.0820 | Rdv Ijcsis | Adhistya Erna Permanasari, Dayang Rohaya Awang Rambli, Dhanapal Durai
Dominic | Prediction of Zoonosis Incidence in Human using Seasonal Auto Regressive
Integrated Moving Average (SARIMA) | 8 pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS 2009, ISSN 1947 5500, Impact Factor 0.423,
http://sites.google.com/site/ijcsis/ | International Journal of Computer Science and Information
Security, IJCSIS, Vol. 5, No. 1, pp. 103-110, September 2009, USA | null | ISSn 1947 5500 | cs.LG q-bio.QM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Zoonosis refers to the transmission of infectious diseases from animal to
human. The increasing number of zoonosis incidence makes the great losses to
lives, including humans and animals, and also the impact in social economic. It
motivates development of a system that can predict the future number of
zoonosis occurr... | [
{
"version": "v1",
"created": "Mon, 5 Oct 2009 18:36:11 GMT"
},
{
"version": "v2",
"created": "Thu, 8 Oct 2009 11:05:26 GMT"
}
] | 2009-10-08T00:00:00 | [
[
"Permanasari",
"Adhistya Erna",
""
],
[
"Rambli",
"Dayang Rohaya Awang",
""
],
[
"Dominic",
"Dhanapal Durai",
""
]
] | TITLE: Prediction of Zoonosis Incidence in Human using Seasonal Auto Regressive
Integrated Moving Average (SARIMA)
ABSTRACT: Zoonosis refers to the transmission of infectious diseases from animal to
human. The increasing number of zoonosis incidence makes the great losses to
lives, including humans and animals, a... |
0910.1273 | Fabien Moutarde | Taoufik Bdiri (CAOR), Fabien Moutarde (CAOR), Nicolas Bourdis (CAOR),
Bruno Steux (CAOR) | Adaboost with "Keypoint Presence Features" for Real-Time Vehicle Visual
Detection | null | 16th World Congress on Intelligent Transport Systems (ITSwc'2009),
Su\`ede (2009) | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present promising results for real-time vehicle visual detection, obtained
with adaBoost using new original ?keypoints presence features?. These
weak-classifiers produce a boolean response based on presence or absence in the
tested image of a ?keypoint? (~ a SURF interest point) with a descriptor
sufficiently simi... | [
{
"version": "v1",
"created": "Wed, 7 Oct 2009 14:26:01 GMT"
}
] | 2009-10-08T00:00:00 | [
[
"Bdiri",
"Taoufik",
"",
"CAOR"
],
[
"Moutarde",
"Fabien",
"",
"CAOR"
],
[
"Bourdis",
"Nicolas",
"",
"CAOR"
],
[
"Steux",
"Bruno",
"",
"CAOR"
]
] | TITLE: Adaboost with "Keypoint Presence Features" for Real-Time Vehicle Visual
Detection
ABSTRACT: We present promising results for real-time vehicle visual detection, obtained
with adaBoost using new original ?keypoints presence features?. These
weak-classifiers produce a boolean response based on presence or ab... |
0910.1294 | Fabien Moutarde | Taoufik Bdiri (CAOR), Fabien Moutarde (CAOR), Bruno Steux (CAOR) | Visual object categorization with new keypoint-based adaBoost features | null | IEEE Symposium on Intelligent Vehicles (IV'2009), XiAn : China
(2009) | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present promising results for visual object categorization, obtained with
adaBoost using new original ?keypoints-based features?. These weak-classifiers
produce a boolean response based on presence or absence in the tested image of
a ?keypoint? (a kind of SURF interest point) with a descriptor sufficiently
similar... | [
{
"version": "v1",
"created": "Wed, 7 Oct 2009 15:42:30 GMT"
}
] | 2009-10-08T00:00:00 | [
[
"Bdiri",
"Taoufik",
"",
"CAOR"
],
[
"Moutarde",
"Fabien",
"",
"CAOR"
],
[
"Steux",
"Bruno",
"",
"CAOR"
]
] | TITLE: Visual object categorization with new keypoint-based adaBoost features
ABSTRACT: We present promising results for visual object categorization, obtained with
adaBoost using new original ?keypoints-based features?. These weak-classifiers
produce a boolean response based on presence or absence in the tested im... |
physics/0701339 | David Smith | David M.D. Smith, Jukka-Pekka Onnela, Neil F. Johnson | Accelerating networks | 12 pages, 8 figures | New J. Phys. 9 181 (2007) | 10.1088/1367-2630/9/6/181 | null | physics.soc-ph cond-mat.dis-nn | null | Evolving out-of-equilibrium networks have been under intense scrutiny
recently. In many real-world settings the number of links added per new node is
not constant but depends on the time at which the node is introduced in the
system. This simple idea gives rise to the concept of accelerating networks,
for which we re... | [
{
"version": "v1",
"created": "Tue, 30 Jan 2007 14:53:48 GMT"
}
] | 2009-10-08T00:00:00 | [
[
"Smith",
"David M. D.",
""
],
[
"Onnela",
"Jukka-Pekka",
""
],
[
"Johnson",
"Neil F.",
""
]
] | TITLE: Accelerating networks
ABSTRACT: Evolving out-of-equilibrium networks have been under intense scrutiny
recently. In many real-world settings the number of links added per new node is
not constant but depends on the time at which the node is introduced in the
system. This simple idea gives rise to the concept ... |
0910.0542 | Om Patri | Om Prasad Patri, Amit Kumar Mishra | Pre-processing in AI based Prediction of QSARs | 6 pages, 12 figures, In the Proceedings of the 12th International
Conference on Information Technology, ICIT 2009, December 21-24 2009,
Bhubaneswar, India | null | null | null | cs.AI cs.NE q-bio.QM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Machine learning, data mining and artificial intelligence (AI) based methods
have been used to determine the relations between chemical structure and
biological activity, called quantitative structure activity relationships
(QSARs) for the compounds. Pre-processing of the dataset, which includes the
mapping from a la... | [
{
"version": "v1",
"created": "Sat, 3 Oct 2009 18:46:00 GMT"
}
] | 2009-10-06T00:00:00 | [
[
"Patri",
"Om Prasad",
""
],
[
"Mishra",
"Amit Kumar",
""
]
] | TITLE: Pre-processing in AI based Prediction of QSARs
ABSTRACT: Machine learning, data mining and artificial intelligence (AI) based methods
have been used to determine the relations between chemical structure and
biological activity, called quantitative structure activity relationships
(QSARs) for the compounds. P... |
0907.3426 | Theodore Alexandrov | Theodore Alexandrov, Klaus Steinhorst, Oliver Keszoecze, Stefan
Schiffler | SparseCodePicking: feature extraction in mass spectrometry using sparse
coding algorithms | 10 pages, 6 figures | null | null | null | stat.ML physics.med-ph stat.AP stat.ME | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mass spectrometry (MS) is an important technique for chemical profiling which
calculates for a sample a high dimensional histogram-like spectrum. A crucial
step of MS data processing is the peak picking which selects peaks containing
information about molecules with high concentrations which are of interest in
an MS ... | [
{
"version": "v1",
"created": "Mon, 20 Jul 2009 15:50:22 GMT"
},
{
"version": "v2",
"created": "Mon, 5 Oct 2009 08:58:10 GMT"
}
] | 2009-10-05T00:00:00 | [
[
"Alexandrov",
"Theodore",
""
],
[
"Steinhorst",
"Klaus",
""
],
[
"Keszoecze",
"Oliver",
""
],
[
"Schiffler",
"Stefan",
""
]
] | TITLE: SparseCodePicking: feature extraction in mass spectrometry using sparse
coding algorithms
ABSTRACT: Mass spectrometry (MS) is an important technique for chemical profiling which
calculates for a sample a high dimensional histogram-like spectrum. A crucial
step of MS data processing is the peak picking whic... |
0910.0253 | Ken Bloom | Kenneth Bloom | The CMS Computing System: Successes and Challenges | To be published in the proceedings of DPF-2009, Detroit, MI, July
2009, eConf C090726 | null | null | CMS CR-2009/90 | physics.ins-det hep-ex | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Each LHC experiment will produce datasets with sizes of order one petabyte
per year. All of this data must be stored, processed, transferred, simulated
and analyzed, which requires a computing system of a larger scale than ever
mounted for any particle physics experiment, and possibly for any enterprise in
the world.... | [
{
"version": "v1",
"created": "Thu, 1 Oct 2009 20:01:45 GMT"
}
] | 2009-10-05T00:00:00 | [
[
"Bloom",
"Kenneth",
""
]
] | TITLE: The CMS Computing System: Successes and Challenges
ABSTRACT: Each LHC experiment will produce datasets with sizes of order one petabyte
per year. All of this data must be stored, processed, transferred, simulated
and analyzed, which requires a computing system of a larger scale than ever
mounted for any part... |
0909.5530 | Xiaokui Xiao | Xiaokui Xiao, Guozhang Wang, Johannes Gehrke | Differential Privacy via Wavelet Transforms | null | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Privacy preserving data publishing has attracted considerable research
interest in recent years. Among the existing solutions, {\em
$\epsilon$-differential privacy} provides one of the strongest privacy
guarantees. Existing data publishing methods that achieve
$\epsilon$-differential privacy, however, offer little da... | [
{
"version": "v1",
"created": "Wed, 30 Sep 2009 07:16:38 GMT"
}
] | 2009-10-01T00:00:00 | [
[
"Xiao",
"Xiaokui",
""
],
[
"Wang",
"Guozhang",
""
],
[
"Gehrke",
"Johannes",
""
]
] | TITLE: Differential Privacy via Wavelet Transforms
ABSTRACT: Privacy preserving data publishing has attracted considerable research
interest in recent years. Among the existing solutions, {\em
$\epsilon$-differential privacy} provides one of the strongest privacy
guarantees. Existing data publishing methods that ac... |
0906.4284 | Eric Lerner | Eric J. Lerner | Tolman Test from z = 0.1 to z = 5.5: Preliminary results challenge the
expanding universe model | 12 pages, 4 figures. 2nd Crisis in Cosmology Conference, 7-11
September, 2008, Port Angeles, WA. accepted in Proceedings of the 2nd Crisis
in Cosmology Conference, Astronomical Society of the Pacific Conference
series | null | null | null | physics.gen-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We performed the Tolman surface-brightness test for the expansion of the
universe using a large UV dataset of disk galaxies in a wide range of redshifts
(from 0.03 to 5.7). We combined data for low-z galaxies from GALEX observations
with those for high-z objects from HST UltraDeep Field images. Starting from
the data... | [
{
"version": "v1",
"created": "Tue, 23 Jun 2009 15:19:07 GMT"
}
] | 2009-09-30T00:00:00 | [
[
"Lerner",
"Eric J.",
""
]
] | TITLE: Tolman Test from z = 0.1 to z = 5.5: Preliminary results challenge the
expanding universe model
ABSTRACT: We performed the Tolman surface-brightness test for the expansion of the
universe using a large UV dataset of disk galaxies in a wide range of redshifts
(from 0.03 to 5.7). We combined data for low-z g... |
0908.3131 | Mehdi Moussaid | Mehdi Moussaid, Dirk Helbing, Simon Garnier, Anders Johansson, Maud
Combe, Guy Theraulaz | Experimental study of the behavioural mechanisms underlying
self-organization in human crowds | null | M. Moussaid et al. (2009) Proceedings of the Royal Society B 276,
2755-2762 | 10.1098/rspb.2009.0405 | null | physics.soc-ph physics.bio-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In animal societies as well as in human crowds, many observed collective
behaviours result from self-organized processes based on local interactions
among individuals. However, models of crowd dynamics are still lacking a
systematic individual-level experimental verification, and the local mechanisms
underlying the f... | [
{
"version": "v1",
"created": "Fri, 21 Aug 2009 14:13:48 GMT"
}
] | 2009-09-30T00:00:00 | [
[
"Moussaid",
"Mehdi",
""
],
[
"Helbing",
"Dirk",
""
],
[
"Garnier",
"Simon",
""
],
[
"Johansson",
"Anders",
""
],
[
"Combe",
"Maud",
""
],
[
"Theraulaz",
"Guy",
""
]
] | TITLE: Experimental study of the behavioural mechanisms underlying
self-organization in human crowds
ABSTRACT: In animal societies as well as in human crowds, many observed collective
behaviours result from self-organized processes based on local interactions
among individuals. However, models of crowd dynamics a... |
0808.3296 | Stevan Harnad | Stevan Harnad | Confirmation Bias and the Open Access Advantage: Some Methodological
Suggestions for the Davis Citation Study | 17 pages, 17 references, 1 table; comment on 0808.2428v1 | null | null | null | cs.DL cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Davis (2008) analyzes citations from 2004-2007 in 11 biomedical journals. 15%
of authors paid to make them Open Access (OA). The outcome is a significant OA
citation Advantage, but a small one (21%). The author infers that the OA
advantage has been shrinking yearly, but the data suggest the opposite. Further
analyses... | [
{
"version": "v1",
"created": "Mon, 25 Aug 2008 03:36:14 GMT"
},
{
"version": "v2",
"created": "Tue, 26 Aug 2008 17:09:08 GMT"
}
] | 2009-09-29T00:00:00 | [
[
"Harnad",
"Stevan",
""
]
] | TITLE: Confirmation Bias and the Open Access Advantage: Some Methodological
Suggestions for the Davis Citation Study
ABSTRACT: Davis (2008) analyzes citations from 2004-2007 in 11 biomedical journals. 15%
of authors paid to make them Open Access (OA). The outcome is a significant OA
citation Advantage, but a smal... |
0811.4013 | Matthew Jackson | Benjamin Golub and Matthew O. Jackson | How Homophily Affects Diffusion and Learning in Networks | Expanded version includes additional empirical analysis | null | null | null | physics.soc-ph physics.data-an | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We examine how three different communication processes operating through
social networks are affected by homophily -- the tendency of individuals to
associate with others similar to themselves. Homophily has no effect if
messages are broadcast or sent via shortest paths; only connection density
matters. In contrast, ... | [
{
"version": "v1",
"created": "Tue, 25 Nov 2008 04:40:37 GMT"
},
{
"version": "v2",
"created": "Mon, 9 Feb 2009 05:03:24 GMT"
}
] | 2009-09-29T00:00:00 | [
[
"Golub",
"Benjamin",
""
],
[
"Jackson",
"Matthew O.",
""
]
] | TITLE: How Homophily Affects Diffusion and Learning in Networks
ABSTRACT: We examine how three different communication processes operating through
social networks are affected by homophily -- the tendency of individuals to
associate with others similar to themselves. Homophily has no effect if
messages are broadcas... |
cs/0211018 | Vladimir Pestov | Vladimir Pestov and Aleksandar Stojmirovic | Indexing schemes for similarity search: an illustrated paradigm | 19 pages, LaTeX with 8 figures, prepared using Fundamenta
Informaticae style file | Fundamenta Informaticae Vol. 70 (2006), No. 4, 367-385 | null | null | cs.DS | null | We suggest a variation of the Hellerstein--Koutsoupias--Papadimitriou
indexability model for datasets equipped with a similarity measure, with the
aim of better understanding the structure of indexing schemes for
similarity-based search and the geometry of similarity workloads. This in
particular provides a unified a... | [
{
"version": "v1",
"created": "Thu, 14 Nov 2002 19:10:16 GMT"
},
{
"version": "v2",
"created": "Thu, 13 Oct 2005 21:06:17 GMT"
}
] | 2009-09-29T00:00:00 | [
[
"Pestov",
"Vladimir",
""
],
[
"Stojmirovic",
"Aleksandar",
""
]
] | TITLE: Indexing schemes for similarity search: an illustrated paradigm
ABSTRACT: We suggest a variation of the Hellerstein--Koutsoupias--Papadimitriou
indexability model for datasets equipped with a similarity measure, with the
aim of better understanding the structure of indexing schemes for
similarity-based searc... |
cs/9503102 | null | P. D. Turney | Cost-Sensitive Classification: Empirical Evaluation of a Hybrid Genetic
Decision Tree Induction Algorithm | See http://www.jair.org/ for any accompanying files | Journal of Artificial Intelligence Research, Vol 2, (1995),
369-409 | null | null | cs.AI | null | This paper introduces ICET, a new algorithm for cost-sensitive
classification. ICET uses a genetic algorithm to evolve a population of biases
for a decision tree induction algorithm. The fitness function of the genetic
algorithm is the average cost of classification when using the decision tree,
including both the co... | [
{
"version": "v1",
"created": "Wed, 1 Mar 1995 00:00:00 GMT"
}
] | 2009-09-25T00:00:00 | [
[
"Turney",
"P. D.",
""
]
] | TITLE: Cost-Sensitive Classification: Empirical Evaluation of a Hybrid Genetic
Decision Tree Induction Algorithm
ABSTRACT: This paper introduces ICET, a new algorithm for cost-sensitive
classification. ICET uses a genetic algorithm to evolve a population of biases
for a decision tree induction algorithm. The fitn... |
cs/9701101 | null | D. R. Wilson, T. R. Martinez | Improved Heterogeneous Distance Functions | See http://www.jair.org/ for an online appendix and other files
accompanying this article | Journal of Artificial Intelligence Research, Vol 6, (1997), 1-34 | null | null | cs.AI | null | Instance-based learning techniques typically handle continuous and linear
input values well, but often do not handle nominal input attributes
appropriately. The Value Difference Metric (VDM) was designed to find
reasonable distance values between nominal attribute values, but it largely
ignores continuous attributes,... | [
{
"version": "v1",
"created": "Wed, 1 Jan 1997 00:00:00 GMT"
}
] | 2009-09-25T00:00:00 | [
[
"Wilson",
"D. R.",
""
],
[
"Martinez",
"T. R.",
""
]
] | TITLE: Improved Heterogeneous Distance Functions
ABSTRACT: Instance-based learning techniques typically handle continuous and linear
input values well, but often do not handle nominal input attributes
appropriately. The Value Difference Metric (VDM) was designed to find
reasonable distance values between nominal at... |
cs/9803102 | null | A. Moore, M. S. Lee | Cached Sufficient Statistics for Efficient Machine Learning with Large
Datasets | See http://www.jair.org/ for any accompanying files | Journal of Artificial Intelligence Research, Vol 8, (1998), 67-91 | null | null | cs.AI | null | This paper introduces new algorithms and data structures for quick counting
for machine learning datasets. We focus on the counting task of constructing
contingency tables, but our approach is also applicable to counting the number
of records in a dataset that match conjunctive queries. Subject to certain
assumptions... | [
{
"version": "v1",
"created": "Sun, 1 Mar 1998 00:00:00 GMT"
}
] | 2009-09-25T00:00:00 | [
[
"Moore",
"A.",
""
],
[
"Lee",
"M. S.",
""
]
] | TITLE: Cached Sufficient Statistics for Efficient Machine Learning with Large
Datasets
ABSTRACT: This paper introduces new algorithms and data structures for quick counting
for machine learning datasets. We focus on the counting task of constructing
contingency tables, but our approach is also applicable to count... |
0909.3609 | Vinay Jethava | Vinay Jethava, Krishnan Suresh, Chiranjib Bhattacharyya, Ramesh
Hariharan | Randomized Algorithms for Large scale SVMs | 17 pages, Submitted to Machine Learning journal (October 2008) -
under revision | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a randomized algorithm for training Support vector machines(SVMs)
on large datasets. By using ideas from Random projections we show that the
combinatorial dimension of SVMs is $O({log} n)$ with high probability. This
estimate of combinatorial dimension is used to derive an iterative algorithm,
called RandS... | [
{
"version": "v1",
"created": "Sat, 19 Sep 2009 23:40:10 GMT"
}
] | 2009-09-22T00:00:00 | [
[
"Jethava",
"Vinay",
""
],
[
"Suresh",
"Krishnan",
""
],
[
"Bhattacharyya",
"Chiranjib",
""
],
[
"Hariharan",
"Ramesh",
""
]
] | TITLE: Randomized Algorithms for Large scale SVMs
ABSTRACT: We propose a randomized algorithm for training Support vector machines(SVMs)
on large datasets. By using ideas from Random projections we show that the
combinatorial dimension of SVMs is $O({log} n)$ with high probability. This
estimate of combinatorial di... |
0909.3481 | Pan Hui | Pan Hui, Richard Mortier, Tristan Henderson, Jon Crowcroft | Planet-scale Human Mobility Measurement | 6 pages, 2 figures | null | null | null | cs.NI cs.CY cs.GL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Research into, and design and construction of mobile systems and algorithms
requires access to large-scale mobility data. Unfortunately, the wireless and
mobile research community lacks such data. For instance, the largest available
human contact traces contain only 100 nodes with very sparse connectivity,
limited by... | [
{
"version": "v1",
"created": "Fri, 18 Sep 2009 16:27:51 GMT"
}
] | 2009-09-21T00:00:00 | [
[
"Hui",
"Pan",
""
],
[
"Mortier",
"Richard",
""
],
[
"Henderson",
"Tristan",
""
],
[
"Crowcroft",
"Jon",
""
]
] | TITLE: Planet-scale Human Mobility Measurement
ABSTRACT: Research into, and design and construction of mobile systems and algorithms
requires access to large-scale mobility data. Unfortunately, the wireless and
mobile research community lacks such data. For instance, the largest available
human contact traces conta... |
0909.3193 | Loet Leydesdorff | Loet Leydesdorff, Felix de Moya-Anegon and Vicente P. Guerrero-Bote | Journal Maps on the Basis of Scopus Data: A comparison with the Journal
Citation Reports of the ISI | Journal of the American Society for Information Science and
Technology (forthcoming) | null | null | null | physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Using the Scopus dataset (1996-2007) a grand matrix of aggregated
journal-journal citations was constructed. This matrix can be compared in terms
of the network structures with the matrix contained in the Journal Citation
Reports (JCR) of the Institute of Scientific Information (ISI). Since the
Scopus database contai... | [
{
"version": "v1",
"created": "Thu, 17 Sep 2009 17:43:55 GMT"
}
] | 2009-09-18T00:00:00 | [
[
"Leydesdorff",
"Loet",
""
],
[
"de Moya-Anegon",
"Felix",
""
],
[
"Guerrero-Bote",
"Vicente P.",
""
]
] | TITLE: Journal Maps on the Basis of Scopus Data: A comparison with the Journal
Citation Reports of the ISI
ABSTRACT: Using the Scopus dataset (1996-2007) a grand matrix of aggregated
journal-journal citations was constructed. This matrix can be compared in terms
of the network structures with the matrix contained... |
0709.1981 | Bin Jiang | Bin Jiang and Chengke Liu | Street-based Topological Representations and Analyses for Predicting
Traffic Flow in GIS | 14 pages, 9 figures, 6 tables, submitted to International Journal of
Geographic Information Science | International Journal of Geographical Information Science, 23(9),
2009, 1119-1137. | 10.1080/13658810701690448 | null | physics.data-an | null | It is well received in the space syntax community that traffic flow is
significantly correlated to a morphological property of streets, which are
represented by axial lines, forming a so called axial map. The correlation
co-efficient (R square value) approaches 0.8 and even a higher value according
to the space synta... | [
{
"version": "v1",
"created": "Thu, 13 Sep 2007 03:27:23 GMT"
}
] | 2009-09-15T00:00:00 | [
[
"Jiang",
"Bin",
""
],
[
"Liu",
"Chengke",
""
]
] | TITLE: Street-based Topological Representations and Analyses for Predicting
Traffic Flow in GIS
ABSTRACT: It is well received in the space syntax community that traffic flow is
significantly correlated to a morphological property of streets, which are
represented by axial lines, forming a so called axial map. The... |
0909.1766 | Yi Zhang | Yi Zhang (Duke University), Herodotos Herodotou, Jun Yang (Duke) | RIOT: I/O-Efficient Numerical Computing without SQL | CIDR 2009 | null | null | null | cs.DB | http://creativecommons.org/licenses/by/3.0/ | R is a numerical computing environment that is widely popular for statistical
data analysis. Like many such environments, R performs poorly for large
datasets whose sizes exceed that of physical memory. We present our vision of
RIOT (R with I/O Transparency), a system that makes R programs I/O-efficient in
a way tran... | [
{
"version": "v1",
"created": "Wed, 9 Sep 2009 18:09:27 GMT"
}
] | 2009-09-15T00:00:00 | [
[
"Zhang",
"Yi",
"",
"Duke University"
],
[
"Herodotou",
"Herodotos",
"",
"Duke"
],
[
"Yang",
"Jun",
"",
"Duke"
]
] | TITLE: RIOT: I/O-Efficient Numerical Computing without SQL
ABSTRACT: R is a numerical computing environment that is widely popular for statistical
data analysis. Like many such environments, R performs poorly for large
datasets whose sizes exceed that of physical memory. We present our vision of
RIOT (R with I/O Tr... |
0909.2345 | Andri Mirzal M.Sc. | Andri Mirzal | Weblog Clustering in Multilinear Algebra Perspective | 16 pages, 7 figures | International Journal of Information Technology, Vol. 15 No. 1,
2009 | null | null | cs.IR | http://creativecommons.org/licenses/by-nc-sa/3.0/ | This paper describes a clustering method to group the most similar and
important weblogs with their descriptive shared words by using a technique from
multilinear algebra known as PARAFAC tensor decomposition. The proposed method
first creates labeled-link network representation of the weblog datasets, where
the node... | [
{
"version": "v1",
"created": "Sat, 12 Sep 2009 15:53:33 GMT"
}
] | 2009-09-15T00:00:00 | [
[
"Mirzal",
"Andri",
""
]
] | TITLE: Weblog Clustering in Multilinear Algebra Perspective
ABSTRACT: This paper describes a clustering method to group the most similar and
important weblogs with their descriptive shared words by using a technique from
multilinear algebra known as PARAFAC tensor decomposition. The proposed method
first creates la... |
0909.0844 | Francis Bach | Francis Bach (INRIA Rocquencourt) | High-Dimensional Non-Linear Variable Selection through Hierarchical
Kernel Learning | null | null | null | null | cs.LG math.ST stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of high-dimensional non-linear variable selection for
supervised learning. Our approach is based on performing linear selection among
exponentially many appropriately defined positive definite kernels that
characterize non-linear interactions between the original variables. To select
efficient... | [
{
"version": "v1",
"created": "Fri, 4 Sep 2009 09:43:38 GMT"
}
] | 2009-09-08T00:00:00 | [
[
"Bach",
"Francis",
"",
"INRIA Rocquencourt"
]
] | TITLE: High-Dimensional Non-Linear Variable Selection through Hierarchical
Kernel Learning
ABSTRACT: We consider the problem of high-dimensional non-linear variable selection for
supervised learning. Our approach is based on performing linear selection among
exponentially many appropriately defined positive defin... |
0909.1127 | Raymond Chi-Wing Wong | Raymond Chi-Wing Wong, Ada Wai-Chee Fu, Ke Wang, Yabo Xu, Jian Pei,
Philip S. Yu | Anonymization with Worst-Case Distribution-Based Background Knowledge | null | null | null | null | cs.DB cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Background knowledge is an important factor in privacy preserving data
publishing. Distribution-based background knowledge is one of the well studied
background knowledge. However, to the best of our knowledge, there is no
existing work considering the distribution-based background knowledge in the
worst case scenari... | [
{
"version": "v1",
"created": "Mon, 7 Sep 2009 01:44:36 GMT"
}
] | 2009-09-08T00:00:00 | [
[
"Wong",
"Raymond Chi-Wing",
""
],
[
"Fu",
"Ada Wai-Chee",
""
],
[
"Wang",
"Ke",
""
],
[
"Xu",
"Yabo",
""
],
[
"Pei",
"Jian",
""
],
[
"Yu",
"Philip S.",
""
]
] | TITLE: Anonymization with Worst-Case Distribution-Based Background Knowledge
ABSTRACT: Background knowledge is an important factor in privacy preserving data
publishing. Distribution-based background knowledge is one of the well studied
background knowledge. However, to the best of our knowledge, there is no
existi... |
0909.0572 | Andri Mirzal M.Sc. | Andri Mirzal and Masashi Furukawa | A Method for Accelerating the HITS Algorithm | 10 pages, 3 figures, to be appear in Journal of Advanced
Computational Intelligence and Intelligent Informatics, Vol. 14 No. 1, 2010 | null | null | null | cs.IR | http://creativecommons.org/licenses/by-nc-sa/3.0/ | We present a new method to accelerate the HITS algorithm by exploiting
hyperlink structure of the web graph. The proposed algorithm extends the idea
of authority and hub scores from HITS by introducing two diagonal matrices
which contain constants that act as weights to make authority pages more
authoritative and hub... | [
{
"version": "v1",
"created": "Thu, 3 Sep 2009 05:34:35 GMT"
}
] | 2009-09-04T00:00:00 | [
[
"Mirzal",
"Andri",
""
],
[
"Furukawa",
"Masashi",
""
]
] | TITLE: A Method for Accelerating the HITS Algorithm
ABSTRACT: We present a new method to accelerate the HITS algorithm by exploiting
hyperlink structure of the web graph. The proposed algorithm extends the idea
of authority and hub scores from HITS by introducing two diagonal matrices
which contain constants that a... |
0906.0684 | Chris Giannella | Chris Giannella | New Instability Results for High Dimensional Nearest Neighbor Search | null | Information Processing Letters 109(19), 2009. | null | null | cs.DB cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Consider a dataset of n(d) points generated independently from R^d according
to a common p.d.f. f_d with support(f_d) = [0,1]^d and sup{f_d([0,1]^d)}
growing sub-exponentially in d. We prove that: (i) if n(d) grows
sub-exponentially in d, then, for any query point q^d in [0,1]^d and any
epsilon>0, the ratio of the di... | [
{
"version": "v1",
"created": "Wed, 3 Jun 2009 15:13:12 GMT"
}
] | 2009-09-01T00:00:00 | [
[
"Giannella",
"Chris",
""
]
] | TITLE: New Instability Results for High Dimensional Nearest Neighbor Search
ABSTRACT: Consider a dataset of n(d) points generated independently from R^d according
to a common p.d.f. f_d with support(f_d) = [0,1]^d and sup{f_d([0,1]^d)}
growing sub-exponentially in d. We prove that: (i) if n(d) grows
sub-exponential... |
0908.4349 | Michael Hapgood | Mike Hapgood | Scientific Understanding and the Risk from Extreme Space Weather | Submitted to Advances in Space Research | null | null | null | physics.space-ph physics.plasm-ph physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Like all natural hazards, space weather exhibits occasional extreme events
over timescales of decades to centuries. Historical events provoked much
interest but had little economic impact. However, the widespread adoption of
advanced technological infrastructures over the past fifty years gives these
events the poten... | [
{
"version": "v1",
"created": "Sat, 29 Aug 2009 17:28:06 GMT"
}
] | 2009-09-01T00:00:00 | [
[
"Hapgood",
"Mike",
""
]
] | TITLE: Scientific Understanding and the Risk from Extreme Space Weather
ABSTRACT: Like all natural hazards, space weather exhibits occasional extreme events
over timescales of decades to centuries. Historical events provoked much
interest but had little economic impact. However, the widespread adoption of
advanced ... |
0908.4144 | Ping Li | Ping Li | ABC-LogitBoost for Multi-class Classification | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We develop abc-logitboost, based on the prior work on abc-boost and robust
logitboost. Our extensive experiments on a variety of datasets demonstrate the
considerable improvement of abc-logitboost over logitboost and abc-mart.
| [
{
"version": "v1",
"created": "Fri, 28 Aug 2009 07:09:19 GMT"
}
] | 2009-08-31T00:00:00 | [
[
"Li",
"Ping",
""
]
] | TITLE: ABC-LogitBoost for Multi-class Classification
ABSTRACT: We develop abc-logitboost, based on the prior work on abc-boost and robust
logitboost. Our extensive experiments on a variety of datasets demonstrate the
considerable improvement of abc-logitboost over logitboost and abc-mart.
|
0903.2999 | Filippo Radicchi | Filippo Radicchi | Human Activity in the Web | 10 pages, 9 figures. Final version accepted for publication in
Physical Review E | Phys. Rev. E 80, 026118 (2009) | 10.1103/PhysRevE.80.026118 | null | physics.soc-ph cond-mat.stat-mech cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The recent information technology revolution has enabled the analysis and
processing of large-scale datasets describing human activities. The main source
of data is represented by the Web, where humans generally use to spend a
relevant part of their day. Here we study three large datasets containing the
information a... | [
{
"version": "v1",
"created": "Tue, 17 Mar 2009 16:24:02 GMT"
},
{
"version": "v2",
"created": "Mon, 27 Jul 2009 15:21:41 GMT"
}
] | 2009-08-20T00:00:00 | [
[
"Radicchi",
"Filippo",
""
]
] | TITLE: Human Activity in the Web
ABSTRACT: The recent information technology revolution has enabled the analysis and
processing of large-scale datasets describing human activities. The main source
of data is represented by the Web, where humans generally use to spend a
relevant part of their day. Here we study thre... |
0908.1453 | R Doomun | Roya Asadi, Norwati Mustapha, Nasir Sulaiman | Training Process Reduction Based On Potential Weights Linear Analysis To
Accelarate Back Propagation Network | 11 pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS 2009, ISSN 1947 5500, Impact factor 0.423 | International Journal of Computer Science and Information
Security, IJCSIS, Vol. 3, No. 1, July 2009, USA | null | ISSN 1947 5500 | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Learning is the important property of Back Propagation Network (BPN) and
finding the suitable weights and thresholds during training in order to improve
training time as well as achieve high accuracy. Currently, data pre-processing
such as dimension reduction input values and pre-training are the contributing
factors... | [
{
"version": "v1",
"created": "Tue, 11 Aug 2009 05:30:01 GMT"
}
] | 2009-08-12T00:00:00 | [
[
"Asadi",
"Roya",
""
],
[
"Mustapha",
"Norwati",
""
],
[
"Sulaiman",
"Nasir",
""
]
] | TITLE: Training Process Reduction Based On Potential Weights Linear Analysis To
Accelarate Back Propagation Network
ABSTRACT: Learning is the important property of Back Propagation Network (BPN) and
finding the suitable weights and thresholds during training in order to improve
training time as well as achieve hi... |
0811.1067 | Lek-Heng Lim | Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye | Statistical ranking and combinatorial Hodge theory | 42 pages; minor changes throughout; numerical experiments added | null | null | null | stat.ML cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a number of techniques for obtaining a global ranking from data
that may be incomplete and imbalanced -- characteristics almost universal to
modern datasets coming from e-commerce and internet applications. We are
primarily interested in score or rating-based cardinal data. From raw ranking
data, we constr... | [
{
"version": "v1",
"created": "Fri, 7 Nov 2008 01:23:09 GMT"
},
{
"version": "v2",
"created": "Mon, 10 Aug 2009 10:34:29 GMT"
}
] | 2009-08-10T00:00:00 | [
[
"Jiang",
"Xiaoye",
""
],
[
"Lim",
"Lek-Heng",
""
],
[
"Yao",
"Yuan",
""
],
[
"Ye",
"Yinyu",
""
]
] | TITLE: Statistical ranking and combinatorial Hodge theory
ABSTRACT: We propose a number of techniques for obtaining a global ranking from data
that may be incomplete and imbalanced -- characteristics almost universal to
modern datasets coming from e-commerce and internet applications. We are
primarily interested in... |
0907.5442 | Jian Li | Jian Li, Amol Deshpande, Samir Khuller | On Computing Compression Trees for Data Collection in Sensor Networks | null | null | null | null | cs.NI cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We address the problem of efficiently gathering correlated data from a wired
or a wireless sensor network, with the aim of designing algorithms with
provable optimality guarantees, and understanding how close we can get to the
known theoretical lower bounds. Our proposed approach is based on finding an
optimal or a n... | [
{
"version": "v1",
"created": "Thu, 30 Jul 2009 22:40:53 GMT"
}
] | 2009-08-03T00:00:00 | [
[
"Li",
"Jian",
""
],
[
"Deshpande",
"Amol",
""
],
[
"Khuller",
"Samir",
""
]
] | TITLE: On Computing Compression Trees for Data Collection in Sensor Networks
ABSTRACT: We address the problem of efficiently gathering correlated data from a wired
or a wireless sensor network, with the aim of designing algorithms with
provable optimality guarantees, and understanding how close we can get to the
kn... |
0907.3315 | Zi-Ke Zhang Mr. | Zi-Ke Zhang, Tao Zhou | Effective Personalized Recommendation in Collaborative Tagging Systems | null | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, collaborative tagging systems have attracted more and more
attention and have been widely applied in web systems. Tags provide highly
abstracted information about personal preferences and item content, and are
therefore potential to help in improving better personalized recommendations.
In this paper, we pr... | [
{
"version": "v1",
"created": "Sun, 19 Jul 2009 18:56:37 GMT"
}
] | 2009-07-21T00:00:00 | [
[
"Zhang",
"Zi-Ke",
""
],
[
"Zhou",
"Tao",
""
]
] | TITLE: Effective Personalized Recommendation in Collaborative Tagging Systems
ABSTRACT: Recently, collaborative tagging systems have attracted more and more
attention and have been widely applied in web systems. Tags provide highly
abstracted information about personal preferences and item content, and are
therefor... |
0907.1815 | Hal Daum\'e III | Hal Daum\'e III | Frustratingly Easy Domain Adaptation | null | ACL 2007 | null | null | cs.LG cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We describe an approach to domain adaptation that is appropriate exactly in
the case when one has enough ``target'' data to do slightly better than just
using only ``source'' data. Our approach is incredibly simple, easy to
implement as a preprocessing step (10 lines of Perl!) and outperforms
state-of-the-art approac... | [
{
"version": "v1",
"created": "Fri, 10 Jul 2009 13:25:48 GMT"
}
] | 2009-07-13T00:00:00 | [
[
"Daumé",
"Hal",
"III"
]
] | TITLE: Frustratingly Easy Domain Adaptation
ABSTRACT: We describe an approach to domain adaptation that is appropriate exactly in
the case when one has enough ``target'' data to do slightly better than just
using only ``source'' data. Our approach is incredibly simple, easy to
implement as a preprocessing step (10 ... |
0904.3761 | Charalampos Tsourakakis | Charalampos E. Tsourakakis, Mihail N. Kolountzakis, Gary L. Miller | Approximate Triangle Counting | 1) 16 pages, 2 figures, under submission 2) Removed the erroneous
random projection part. Thanks to Ioannis Koutis for pointing out the error.
3) Added experimental session | null | null | null | cs.DS cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Triangle counting is an important problem in graph mining. Clustering
coefficients of vertices and the transitivity ratio of the graph are two
metrics often used in complex network analysis. Furthermore, triangles have
been used successfully in several real-world applications. However, exact
triangle counting is an e... | [
{
"version": "v1",
"created": "Fri, 24 Apr 2009 14:21:13 GMT"
},
{
"version": "v2",
"created": "Tue, 30 Jun 2009 09:02:34 GMT"
}
] | 2009-06-30T00:00:00 | [
[
"Tsourakakis",
"Charalampos E.",
""
],
[
"Kolountzakis",
"Mihail N.",
""
],
[
"Miller",
"Gary L.",
""
]
] | TITLE: Approximate Triangle Counting
ABSTRACT: Triangle counting is an important problem in graph mining. Clustering
coefficients of vertices and the transitivity ratio of the graph are two
metrics often used in complex network analysis. Furthermore, triangles have
been used successfully in several real-world appli... |
0906.4927 | Lijun Chang | Lijun Chang, Jeffrey Xu Yu, Lu Qin | Fast Probabilistic Ranking under x-Relation Model | null | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The probabilistic top-k queries based on the interplay of score and
probability, under the possible worlds semantic, become an important research
issue that considers both score and uncertainty on the same basis. In the
literature, many different probabilistic top-k queries are proposed. Almost all
of them need to co... | [
{
"version": "v1",
"created": "Fri, 26 Jun 2009 13:24:57 GMT"
}
] | 2009-06-29T00:00:00 | [
[
"Chang",
"Lijun",
""
],
[
"Yu",
"Jeffrey Xu",
""
],
[
"Qin",
"Lu",
""
]
] | TITLE: Fast Probabilistic Ranking under x-Relation Model
ABSTRACT: The probabilistic top-k queries based on the interplay of score and
probability, under the possible worlds semantic, become an important research
issue that considers both score and uncertainty on the same basis. In the
literature, many different pr... |
0906.3741 | Lillian Lee | Cristian Danescu-Niculescu-Mizil, Gueorgi Kossinets, Jon Kleinberg,
Lillian Lee | How opinions are received by online communities: A case study on
Amazon.com helpfulness votes | null | Proceedings of WWW, pp. 141--150, 2009 | null | null | cs.CL cs.IR physics.data-an physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There are many on-line settings in which users publicly express opinions. A
number of these offer mechanisms for other users to evaluate these opinions; a
canonical example is Amazon.com, where reviews come with annotations like "26
of 32 people found the following review helpful." Opinion evaluation appears in
many ... | [
{
"version": "v1",
"created": "Sun, 21 Jun 2009 01:59:21 GMT"
}
] | 2009-06-24T00:00:00 | [
[
"Danescu-Niculescu-Mizil",
"Cristian",
""
],
[
"Kossinets",
"Gueorgi",
""
],
[
"Kleinberg",
"Jon",
""
],
[
"Lee",
"Lillian",
""
]
] | TITLE: How opinions are received by online communities: A case study on
Amazon.com helpfulness votes
ABSTRACT: There are many on-line settings in which users publicly express opinions. A
number of these offer mechanisms for other users to evaluate these opinions; a
canonical example is Amazon.com, where reviews c... |
0906.2274 | D\v{z}enan Zuki\'c | D\v{z}enan Zuki\'c, Christof Rezk-Salama, Andreas Kolb | A Neural Network Classifier of Volume Datasets | 10 pages, 10 figures, 1 table, 3IA conference http://3ia.teiath.gr/ | International Conference on Computer Graphics and Artificial
Intelligence, Proceedings (2009) 53-62 | null | null | cs.GR cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many state-of-the art visualization techniques must be tailored to the
specific type of dataset, its modality (CT, MRI, etc.), the recorded object or
anatomical region (head, spine, abdomen, etc.) and other parameters related to
the data acquisition process. While parts of the information (imaging modality
and acquis... | [
{
"version": "v1",
"created": "Fri, 12 Jun 2009 11:17:05 GMT"
}
] | 2009-06-15T00:00:00 | [
[
"Zukić",
"Dženan",
""
],
[
"Rezk-Salama",
"Christof",
""
],
[
"Kolb",
"Andreas",
""
]
] | TITLE: A Neural Network Classifier of Volume Datasets
ABSTRACT: Many state-of-the art visualization techniques must be tailored to the
specific type of dataset, its modality (CT, MRI, etc.), the recorded object or
anatomical region (head, spine, abdomen, etc.) and other parameters related to
the data acquisition pr... |
0806.2925 | Dzenan Zukic | D\v{z}enan Zuki\'c, Andreas Elsner, Zikrija Avdagi\'c, Gitta Domik | Neural networks in 3D medical scan visualization | 8 pages, 6 figures published on conference 3IA'2008 in Athens, Greece
(http://3ia.teiath.gr) | International Conference on Computer Graphics and Artificial
Intelligence, Proceedings (2008) 183-190 | null | null | cs.AI cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For medical volume visualization, one of the most important tasks is to
reveal clinically relevant details from the 3D scan (CT, MRI ...), e.g. the
coronary arteries, without obscuring them with less significant parts. These
volume datasets contain different materials which are difficult to extract and
visualize with... | [
{
"version": "v1",
"created": "Wed, 18 Jun 2008 08:36:15 GMT"
},
{
"version": "v2",
"created": "Fri, 12 Jun 2009 08:25:23 GMT"
}
] | 2009-06-12T00:00:00 | [
[
"Zukić",
"Dženan",
""
],
[
"Elsner",
"Andreas",
""
],
[
"Avdagić",
"Zikrija",
""
],
[
"Domik",
"Gitta",
""
]
] | TITLE: Neural networks in 3D medical scan visualization
ABSTRACT: For medical volume visualization, one of the most important tasks is to
reveal clinically relevant details from the 3D scan (CT, MRI ...), e.g. the
coronary arteries, without obscuring them with less significant parts. These
volume datasets contain d... |
0906.1814 | Renqiang Min | Martin Renqiang Min, David A. Stanley, Zineng Yuan, Anthony Bonner,
and Zhaolei Zhang | Large-Margin kNN Classification Using a Deep Encoder Network | 13 pages (preliminary version) | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | KNN is one of the most popular classification methods, but it often fails to
work well with inappropriate choice of distance metric or due to the presence
of numerous class-irrelevant features. Linear feature transformation methods
have been widely applied to extract class-relevant information to improve kNN
classifi... | [
{
"version": "v1",
"created": "Tue, 9 Jun 2009 20:06:45 GMT"
}
] | 2009-06-11T00:00:00 | [
[
"Min",
"Martin Renqiang",
""
],
[
"Stanley",
"David A.",
""
],
[
"Yuan",
"Zineng",
""
],
[
"Bonner",
"Anthony",
""
],
[
"Zhang",
"Zhaolei",
""
]
] | TITLE: Large-Margin kNN Classification Using a Deep Encoder Network
ABSTRACT: KNN is one of the most popular classification methods, but it often fails to
work well with inappropriate choice of distance metric or due to the presence
of numerous class-irrelevant features. Linear feature transformation methods
have b... |
0904.2623 | James Petterson | James Petterson, Tiberio Caetano, Julian McAuley, Jin Yu | Exponential Family Graph Matching and Ranking | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a method for learning max-weight matching predictors in bipartite
graphs. The method consists of performing maximum a posteriori estimation in
exponential families with sufficient statistics that encode permutations and
data features. Although inference is in general hard, we show that for one very
relevan... | [
{
"version": "v1",
"created": "Fri, 17 Apr 2009 03:48:02 GMT"
},
{
"version": "v2",
"created": "Fri, 5 Jun 2009 03:54:58 GMT"
}
] | 2009-06-05T00:00:00 | [
[
"Petterson",
"James",
""
],
[
"Caetano",
"Tiberio",
""
],
[
"McAuley",
"Julian",
""
],
[
"Yu",
"Jin",
""
]
] | TITLE: Exponential Family Graph Matching and Ranking
ABSTRACT: We present a method for learning max-weight matching predictors in bipartite
graphs. The method consists of performing maximum a posteriori estimation in
exponential families with sufficient statistics that encode permutations and
data features. Althoug... |
0903.4217 | John Langford | Alina Beygelzimer, John Langford, Yuri Lifshits, Gregory Sorkin, and
Alex Strehl | Conditional Probability Tree Estimation Analysis and Algorithms | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of estimating the conditional probability of a label
in time $O(\log n)$, where $n$ is the number of possible labels. We analyze a
natural reduction of this problem to a set of binary regression problems
organized in a tree structure, proving a regret bound that scales with the
depth of the tr... | [
{
"version": "v1",
"created": "Wed, 25 Mar 2009 00:28:44 GMT"
},
{
"version": "v2",
"created": "Wed, 3 Jun 2009 21:19:34 GMT"
}
] | 2009-06-04T00:00:00 | [
[
"Beygelzimer",
"Alina",
""
],
[
"Langford",
"John",
""
],
[
"Lifshits",
"Yuri",
""
],
[
"Sorkin",
"Gregory",
""
],
[
"Strehl",
"Alex",
""
]
] | TITLE: Conditional Probability Tree Estimation Analysis and Algorithms
ABSTRACT: We consider the problem of estimating the conditional probability of a label
in time $O(\log n)$, where $n$ is the number of possible labels. We analyze a
natural reduction of this problem to a set of binary regression problems
organiz... |
0707.4638 | Fengzhong Wang | Fengzhong Wang, Kazuko Yamasaki, Shlomo Havlin and H. Eugene Stanley | Indication of multiscaling in the volatility return intervals of stock
markets | 19 pages, 6 figures | Phys. Rev. E 77, 016109 (2008) | 10.1103/PhysRevE.77.016109 | null | q-fin.ST physics.soc-ph | null | The distribution of the return intervals $\tau$ between volatilities above a
threshold $q$ for financial records has been approximated by a scaling
behavior. To explore how accurate is the scaling and therefore understand the
underlined non-linear mechanism, we investigate intraday datasets of 500 stocks
which consis... | [
{
"version": "v1",
"created": "Tue, 31 Jul 2007 15:14:47 GMT"
}
] | 2009-06-02T00:00:00 | [
[
"Wang",
"Fengzhong",
""
],
[
"Yamasaki",
"Kazuko",
""
],
[
"Havlin",
"Shlomo",
""
],
[
"Stanley",
"H. Eugene",
""
]
] | TITLE: Indication of multiscaling in the volatility return intervals of stock
markets
ABSTRACT: The distribution of the return intervals $\tau$ between volatilities above a
threshold $q$ for financial records has been approximated by a scaling
behavior. To explore how accurate is the scaling and therefore underst... |
0905.4627 | Claudio Lucchese | Paolo Bolettieri, Andrea Esuli, Fabrizio Falchi, Claudio Lucchese,
Raffaele Perego, Tommaso Piccioli and Fausto Rabitti | CoPhIR: a Test Collection for Content-Based Image Retrieval | 15 pages | null | null | null | cs.MM cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The scalability, as well as the effectiveness, of the different Content-based
Image Retrieval (CBIR) approaches proposed in literature, is today an important
research issue. Given the wealth of images on the Web, CBIR systems must in
fact leap towards Web-scale datasets. In this paper, we report on our
experience in ... | [
{
"version": "v1",
"created": "Thu, 28 May 2009 12:14:07 GMT"
},
{
"version": "v2",
"created": "Mon, 1 Jun 2009 07:44:19 GMT"
}
] | 2009-06-01T00:00:00 | [
[
"Bolettieri",
"Paolo",
""
],
[
"Esuli",
"Andrea",
""
],
[
"Falchi",
"Fabrizio",
""
],
[
"Lucchese",
"Claudio",
""
],
[
"Perego",
"Raffaele",
""
],
[
"Piccioli",
"Tommaso",
""
],
[
"Rabitti",
"Fausto",
""
... | TITLE: CoPhIR: a Test Collection for Content-Based Image Retrieval
ABSTRACT: The scalability, as well as the effectiveness, of the different Content-based
Image Retrieval (CBIR) approaches proposed in literature, is today an important
research issue. Given the wealth of images on the Web, CBIR systems must in
fact ... |
0905.4138 | Christos Attikos | Christos Attikos, Michael Doumpos | Faster estimation of the correlation fractal dimension using
box-counting | 4 pages, to appear in BCI 2009 - 4th Balkan Conference in Informatics | null | null | null | cs.DB cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fractal dimension is widely adopted in spatial databases and data mining,
among others as a measure of dataset skewness. State-of-the-art algorithms for
estimating the fractal dimension exhibit linear runtime complexity whether
based on box-counting or approximation schemes. In this paper, we revisit a
correlation fr... | [
{
"version": "v1",
"created": "Tue, 26 May 2009 08:52:42 GMT"
}
] | 2009-05-27T00:00:00 | [
[
"Attikos",
"Christos",
""
],
[
"Doumpos",
"Michael",
""
]
] | TITLE: Faster estimation of the correlation fractal dimension using
box-counting
ABSTRACT: Fractal dimension is widely adopted in spatial databases and data mining,
among others as a measure of dataset skewness. State-of-the-art algorithms for
estimating the fractal dimension exhibit linear runtime complexity whe... |
0905.4022 | Paramveer Dhillon | Paramveer S. Dhillon, Dean Foster and Lyle Ungar | Transfer Learning Using Feature Selection | Masters' Thesis | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present three related ways of using Transfer Learning to improve feature
selection. The three methods address different problems, and hence share
different kinds of information between tasks or feature classes, but all three
are based on the information theoretic Minimum Description Length (MDL)
principle and shar... | [
{
"version": "v1",
"created": "Mon, 25 May 2009 14:29:59 GMT"
}
] | 2009-05-26T00:00:00 | [
[
"Dhillon",
"Paramveer S.",
""
],
[
"Foster",
"Dean",
""
],
[
"Ungar",
"Lyle",
""
]
] | TITLE: Transfer Learning Using Feature Selection
ABSTRACT: We present three related ways of using Transfer Learning to improve feature
selection. The three methods address different problems, and hence share
different kinds of information between tasks or feature classes, but all three
are based on the information ... |
0905.2200 | Debprakash Patnaik | Yong Cao, Debprakash Patnaik, Sean Ponce, Jeremy Archuleta, Patrick
Butler, Wu-chun Feng, and Naren Ramakrishnan | Towards Chip-on-Chip Neuroscience: Fast Mining of Frequent Episodes
Using Graphics Processors | null | null | null | null | cs.DC cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Computational neuroscience is being revolutionized with the advent of
multi-electrode arrays that provide real-time, dynamic, perspectives into brain
function. Mining event streams from these chips is critical to understanding
the firing patterns of neurons and to gaining insight into the underlying
cellular activity... | [
{
"version": "v1",
"created": "Wed, 13 May 2009 21:04:03 GMT"
}
] | 2009-05-15T00:00:00 | [
[
"Cao",
"Yong",
""
],
[
"Patnaik",
"Debprakash",
""
],
[
"Ponce",
"Sean",
""
],
[
"Archuleta",
"Jeremy",
""
],
[
"Butler",
"Patrick",
""
],
[
"Feng",
"Wu-chun",
""
],
[
"Ramakrishnan",
"Naren",
""
]
] | TITLE: Towards Chip-on-Chip Neuroscience: Fast Mining of Frequent Episodes
Using Graphics Processors
ABSTRACT: Computational neuroscience is being revolutionized with the advent of
multi-electrode arrays that provide real-time, dynamic, perspectives into brain
function. Mining event streams from these chips is cr... |
0905.2203 | Debprakash Patnaik | Debprakash Patnaik, Sean P. Ponce, Yong Cao, Naren Ramakrishnan | Accelerator-Oriented Algorithm Transformation for Temporal Data Mining | null | null | null | null | cs.DC cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Temporal data mining algorithms are becoming increasingly important in many
application domains including computational neuroscience, especially the
analysis of spike train data. While application scientists have been able to
readily gather multi-neuronal datasets, analysis capabilities have lagged
behind, due to bot... | [
{
"version": "v1",
"created": "Wed, 13 May 2009 21:18:31 GMT"
}
] | 2009-05-15T00:00:00 | [
[
"Patnaik",
"Debprakash",
""
],
[
"Ponce",
"Sean P.",
""
],
[
"Cao",
"Yong",
""
],
[
"Ramakrishnan",
"Naren",
""
]
] | TITLE: Accelerator-Oriented Algorithm Transformation for Temporal Data Mining
ABSTRACT: Temporal data mining algorithms are becoming increasingly important in many
application domains including computational neuroscience, especially the
analysis of spike train data. While application scientists have been able to
re... |
0905.2288 | Michele Marchesi | Hongyu Zhang, Hee Beng Kuan Tan, Michele Marchesi | The Distribution of Program Sizes and Its Implications: An Eclipse Case
Study | 10 pages, 2 figures, 6 tables | null | null | null | cs.SE cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A large software system is often composed of many inter-related programs of
different sizes. Using the public Eclipse dataset, we replicate our previous
study on the distribution of program sizes. Our results confirm that the
program sizes follow the lognormal distribution. We also investigate the
implications of the... | [
{
"version": "v1",
"created": "Thu, 14 May 2009 09:24:51 GMT"
}
] | 2009-05-15T00:00:00 | [
[
"Zhang",
"Hongyu",
""
],
[
"Tan",
"Hee Beng Kuan",
""
],
[
"Marchesi",
"Michele",
""
]
] | TITLE: The Distribution of Program Sizes and Its Implications: An Eclipse Case
Study
ABSTRACT: A large software system is often composed of many inter-related programs of
different sizes. Using the public Eclipse dataset, we replicate our previous
study on the distribution of program sizes. Our results confirm th... |
0905.2141 | Ilya Volnyansky | Ilya Volnyansky | Curse of Dimensionality in the Application of Pivot-based Indexes to the
Similarity Search Problem | 56 pages, 7 figures Master's Thesis in Mathematics, University of
Ottawa (Canada) Supervisor: Vladimir Pestov | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work we study the validity of the so-called curse of dimensionality
for indexing of databases for similarity search. We perform an asymptotic
analysis, with a test model based on a sequence of metric spaces $(\Omega_d)$
from which we pick datasets $X_d$ in an i.i.d. fashion. We call the subscript
$d$ the dime... | [
{
"version": "v1",
"created": "Wed, 13 May 2009 16:24:21 GMT"
}
] | 2009-05-14T00:00:00 | [
[
"Volnyansky",
"Ilya",
""
]
] | TITLE: Curse of Dimensionality in the Application of Pivot-based Indexes to the
Similarity Search Problem
ABSTRACT: In this work we study the validity of the so-called curse of dimensionality
for indexing of databases for similarity search. We perform an asymptotic
analysis, with a test model based on a sequence ... |
0905.1744 | Fahad Saeed | Fahad Saeed and Ashfaq Khokhar | A Domain Decomposition Strategy for Alignment of Multiple Biological
Sequences on Multiprocessor Platforms | 36 pages, 17 figures, Accepted manuscript in Journal of Parallel and
Distributed Computing(JPDC) | as: F. Saeed, A. Khokhar, A domain decomposition strategy for
alignment of multiple biological sequences on multiprocessor platforms, J.
Parallel Distrib. Comput. (2009) | 10.1016/j.jpdc.2009.03.006 | null | cs.DC q-bio.QM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multiple Sequences Alignment (MSA) of biological sequences is a fundamental
problem in computational biology due to its critical significance in wide
ranging applications including haplotype reconstruction, sequence homology,
phylogenetic analysis, and prediction of evolutionary origins. The MSA problem
is considered... | [
{
"version": "v1",
"created": "Tue, 12 May 2009 01:04:40 GMT"
}
] | 2009-05-13T00:00:00 | [
[
"Saeed",
"Fahad",
""
],
[
"Khokhar",
"Ashfaq",
""
]
] | TITLE: A Domain Decomposition Strategy for Alignment of Multiple Biological
Sequences on Multiprocessor Platforms
ABSTRACT: Multiple Sequences Alignment (MSA) of biological sequences is a fundamental
problem in computational biology due to its critical significance in wide
ranging applications including haplotype... |
0905.1755 | Raymond Chi-Wing Wong | Raymond Chi-Wing Wong, Ada Wai-Chee Fu, Ke Wang, Yabo Xu, Philip S. Yu | Can the Utility of Anonymized Data be used for Privacy Breaches? | 11 pages | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Group based anonymization is the most widely studied approach for privacy
preserving data publishing. This includes k-anonymity, l-diversity, and
t-closeness, to name a few. The goal of this paper is to raise a fundamental
issue on the privacy exposure of the current group based approach. This has
been overlooked in ... | [
{
"version": "v1",
"created": "Tue, 12 May 2009 03:36:26 GMT"
}
] | 2009-05-13T00:00:00 | [
[
"Wong",
"Raymond Chi-Wing",
""
],
[
"Fu",
"Ada Wai-Chee",
""
],
[
"Wang",
"Ke",
""
],
[
"Xu",
"Yabo",
""
],
[
"Yu",
"Philip S.",
""
]
] | TITLE: Can the Utility of Anonymized Data be used for Privacy Breaches?
ABSTRACT: Group based anonymization is the most widely studied approach for privacy
preserving data publishing. This includes k-anonymity, l-diversity, and
t-closeness, to name a few. The goal of this paper is to raise a fundamental
issue on th... |
0902.1475 | Frank E. Walter | Frank E. Walter, Stefano Battiston, Frank Schweitzer | Personalised and Dynamic Trust in Social Networks | Revised, added Empirical Validation, submitted to Recommender Systems
2009 | null | null | null | cs.CY cs.IR physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a novel trust metric for social networks which is suitable for
application in recommender systems. It is personalised and dynamic and allows
to compute the indirect trust between two agents which are not neighbours based
on the direct trust between agents that are neighbours. In analogy to some
personalise... | [
{
"version": "v1",
"created": "Mon, 9 Feb 2009 16:53:01 GMT"
},
{
"version": "v2",
"created": "Sat, 9 May 2009 17:48:23 GMT"
}
] | 2009-05-09T00:00:00 | [
[
"Walter",
"Frank E.",
""
],
[
"Battiston",
"Stefano",
""
],
[
"Schweitzer",
"Frank",
""
]
] | TITLE: Personalised and Dynamic Trust in Social Networks
ABSTRACT: We propose a novel trust metric for social networks which is suitable for
application in recommender systems. It is personalised and dynamic and allows
to compute the indirect trust between two agents which are not neighbours based
on the direct tru... |
0904.4041 | Mario Nascimento | Jie Luo and Mario A. Nascimento | Content-Based Sub-Image Retrieval with Relevance Feedback | A preliminary version of this paper appeared in the Proceedings of
the 1st ACM International Workshop on Multimedia Databases, p. 63-69. 2003 | null | null | null | cs.DB cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The typical content-based image retrieval problem is to find images within a
database that are similar to a given query image. This paper presents a
solution to a different problem, namely that of content based sub-image
retrieval, i.e., finding images from a database that contains another image.
Note that this is di... | [
{
"version": "v1",
"created": "Sun, 26 Apr 2009 17:50:33 GMT"
}
] | 2009-04-28T00:00:00 | [
[
"Luo",
"Jie",
""
],
[
"Nascimento",
"Mario A.",
""
]
] | TITLE: Content-Based Sub-Image Retrieval with Relevance Feedback
ABSTRACT: The typical content-based image retrieval problem is to find images within a
database that are similar to a given query image. This paper presents a
solution to a different problem, namely that of content based sub-image
retrieval, i.e., fin... |
0904.3316 | Shariq Bashir Mr. | Shariq Bashir, and Abdul Rauf Baig | Ramp: Fast Frequent Itemset Mining with Efficient Bit-Vector Projection
Technique | null | null | null | null | cs.DB cs.AI cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mining frequent itemset using bit-vector representation approach is very
efficient for dense type datasets, but highly inefficient for sparse datasets
due to lack of any efficient bit-vector projection technique. In this paper we
present a novel efficient bit-vector projection technique, for sparse and dense
datasets... | [
{
"version": "v1",
"created": "Tue, 21 Apr 2009 18:49:13 GMT"
}
] | 2009-04-22T00:00:00 | [
[
"Bashir",
"Shariq",
""
],
[
"Baig",
"Abdul Rauf",
""
]
] | TITLE: Ramp: Fast Frequent Itemset Mining with Efficient Bit-Vector Projection
Technique
ABSTRACT: Mining frequent itemset using bit-vector representation approach is very
efficient for dense type datasets, but highly inefficient for sparse datasets
due to lack of any efficient bit-vector projection technique. In... |
0904.3319 | Shariq Bashir Mr. | Shariq Bashir, Zahoor Jan, Abdul Rauf Baig | Fast Algorithms for Mining Interesting Frequent Itemsets without Minimum
Support | 25 Pages | null | null | null | cs.DB cs.AI cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Real world datasets are sparse, dirty and contain hundreds of items. In such
situations, discovering interesting rules (results) using traditional frequent
itemset mining approach by specifying a user defined input support threshold is
not appropriate. Since without any domain knowledge, setting support threshold
sma... | [
{
"version": "v1",
"created": "Tue, 21 Apr 2009 19:07:35 GMT"
}
] | 2009-04-22T00:00:00 | [
[
"Bashir",
"Shariq",
""
],
[
"Jan",
"Zahoor",
""
],
[
"Baig",
"Abdul Rauf",
""
]
] | TITLE: Fast Algorithms for Mining Interesting Frequent Itemsets without Minimum
Support
ABSTRACT: Real world datasets are sparse, dirty and contain hundreds of items. In such
situations, discovering interesting rules (results) using traditional frequent
itemset mining approach by specifying a user defined input s... |
0904.3320 | Shariq Bashir Mr. | Shariq Bashir, Saad Razzaq, Umer Maqbool, Sonya Tahir, Abdul Rauf Baig | Using Association Rules for Better Treatment of Missing Values | null | null | null | null | cs.DB cs.AI cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The quality of training data for knowledge discovery in databases (KDD) and
data mining depends upon many factors, but handling missing values is
considered to be a crucial factor in overall data quality. Today real world
datasets contains missing values due to human, operational error, hardware
malfunctioning and ma... | [
{
"version": "v1",
"created": "Tue, 21 Apr 2009 19:09:57 GMT"
}
] | 2009-04-22T00:00:00 | [
[
"Bashir",
"Shariq",
""
],
[
"Razzaq",
"Saad",
""
],
[
"Maqbool",
"Umer",
""
],
[
"Tahir",
"Sonya",
""
],
[
"Baig",
"Abdul Rauf",
""
]
] | TITLE: Using Association Rules for Better Treatment of Missing Values
ABSTRACT: The quality of training data for knowledge discovery in databases (KDD) and
data mining depends upon many factors, but handling missing values is
considered to be a crucial factor in overall data quality. Today real world
datasets conta... |
0904.3321 | Shariq Bashir Mr. | Shariq Bashir, Saad Razzaq, Umer Maqbool, Sonya Tahir, Abdul Rauf Baig | Introducing Partial Matching Approach in Association Rules for Better
Treatment of Missing Values | null | null | null | null | cs.DB cs.AI cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Handling missing values in training datasets for constructing learning models
or extracting useful information is considered to be an important research task
in data mining and knowledge discovery in databases. In recent years, lot of
techniques are proposed for imputing missing values by considering attribute
relati... | [
{
"version": "v1",
"created": "Tue, 21 Apr 2009 19:16:00 GMT"
}
] | 2009-04-22T00:00:00 | [
[
"Bashir",
"Shariq",
""
],
[
"Razzaq",
"Saad",
""
],
[
"Maqbool",
"Umer",
""
],
[
"Tahir",
"Sonya",
""
],
[
"Baig",
"Abdul Rauf",
""
]
] | TITLE: Introducing Partial Matching Approach in Association Rules for Better
Treatment of Missing Values
ABSTRACT: Handling missing values in training datasets for constructing learning models
or extracting useful information is considered to be an important research task
in data mining and knowledge discovery in... |
0904.2476 | Alessandra Retico | I. Gori, F. Bagagli, M.E. Fantacci, A. Preite Martinez, A. Retico, I.
De Mitri, S. Donadio, C. Fulcheri, G. Gargano, R. Magro, M. Santoro, S.
Stumbo | Multi-scale analysis of lung computed tomography images | 18 pages, 12 low-resolution figures | 2007 JINST 2 P09007 | 10.1088/1748-0221/2/09/P09007 | null | physics.med-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A computer-aided detection (CAD) system for the identification of lung
internal nodules in low-dose multi-detector helical Computed Tomography (CT)
images was developed in the framework of the MAGIC-5 project. The three modules
of our lung CAD system, a segmentation algorithm for lung internal region
identification, ... | [
{
"version": "v1",
"created": "Thu, 16 Apr 2009 12:29:04 GMT"
}
] | 2009-04-17T00:00:00 | [
[
"Gori",
"I.",
""
],
[
"Bagagli",
"F.",
""
],
[
"Fantacci",
"M. E.",
""
],
[
"Martinez",
"A. Preite",
""
],
[
"Retico",
"A.",
""
],
[
"De Mitri",
"I.",
""
],
[
"Donadio",
"S.",
""
],
[
"Fulcheri",
... | TITLE: Multi-scale analysis of lung computed tomography images
ABSTRACT: A computer-aided detection (CAD) system for the identification of lung
internal nodules in low-dose multi-detector helical Computed Tomography (CT)
images was developed in the framework of the MAGIC-5 project. The three modules
of our lung CAD... |
0904.2160 | Debprakash Patnaik | Debprakash Patnaik and Srivatsan Laxman and Naren Ramakrishnan | Inferring Dynamic Bayesian Networks using Frequent Episode Mining | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Motivation: Several different threads of research have been proposed for
modeling and mining temporal data. On the one hand, approaches such as dynamic
Bayesian networks (DBNs) provide a formal probabilistic basis to model
relationships between time-indexed random variables but these models are
intractable to learn i... | [
{
"version": "v1",
"created": "Tue, 14 Apr 2009 17:32:00 GMT"
}
] | 2009-04-15T00:00:00 | [
[
"Patnaik",
"Debprakash",
""
],
[
"Laxman",
"Srivatsan",
""
],
[
"Ramakrishnan",
"Naren",
""
]
] | TITLE: Inferring Dynamic Bayesian Networks using Frequent Episode Mining
ABSTRACT: Motivation: Several different threads of research have been proposed for
modeling and mining temporal data. On the one hand, approaches such as dynamic
Bayesian networks (DBNs) provide a formal probabilistic basis to model
relationsh... |
physics/0701244 | Alessandra Retico | P. Delogu, M.E. Fantacci, P. Kasae, A. Retico | An automatic system to discriminate malignant from benign massive
lesions in mammograms | 4 pages, 2 figure; Proceedings of the Frontier Science 2005, 4th
International Conference on Frontier Science, 12-17 September, 2005, Milano,
Italy | Volume XL. Frontier Science 2005 - New Frontiers in Subnuclear
Physics. Eds. A. Pullia and M. Paganoni. | null | null | physics.med-ph | null | Evaluating the degree of malignancy of a massive lesion on the basis of the
mere visual analysis of the mammogram is a non-trivial task. We developed a
semi-automated system for massive-lesion characterization with the aim to
support the radiological diagnosis. A dataset of 226 masses has been used in
the present ana... | [
{
"version": "v1",
"created": "Mon, 22 Jan 2007 10:58:23 GMT"
}
] | 2009-04-15T00:00:00 | [
[
"Delogu",
"P.",
""
],
[
"Fantacci",
"M. E.",
""
],
[
"Kasae",
"P.",
""
],
[
"Retico",
"A.",
""
]
] | TITLE: An automatic system to discriminate malignant from benign massive
lesions in mammograms
ABSTRACT: Evaluating the degree of malignancy of a massive lesion on the basis of the
mere visual analysis of the mammogram is a non-trivial task. We developed a
semi-automated system for massive-lesion characterization... |
0901.0148 | Michal Zerola | Michal Zerola, Jerome Lauret, Roman Bartak and Michal Sumbera | Using constraint programming to resolve the multi-source/multi-site data
movement paradigm on the Grid | 10 pages; ACAT 2008 workshop | null | null | null | cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In order to achieve both fast and coordinated data transfer to collaborative
sites as well as to create a distribution of data over multiple sites,
efficient data movement is one of the most essential aspects in distributed
environment. With such capabilities at hand, truly distributed task scheduling
with minimal la... | [
{
"version": "v1",
"created": "Wed, 31 Dec 2008 21:25:32 GMT"
}
] | 2009-04-14T00:00:00 | [
[
"Zerola",
"Michal",
""
],
[
"Lauret",
"Jerome",
""
],
[
"Bartak",
"Roman",
""
],
[
"Sumbera",
"Michal",
""
]
] | TITLE: Using constraint programming to resolve the multi-source/multi-site data
movement paradigm on the Grid
ABSTRACT: In order to achieve both fast and coordinated data transfer to collaborative
sites as well as to create a distribution of data over multiple sites,
efficient data movement is one of the most ess... |
0904.1931 | Byron Gao | Obi L. Griffith, Byron J. Gao, Mikhail Bilenky, Yuliya Prichyna,
Martin Ester, Steven J.M. Jones | KiWi: A Scalable Subspace Clustering Algorithm for Gene Expression
Analysis | International Conference on Bioinformatics and Biomedical Engineering
(iCBBE), 2009 | null | null | null | cs.DB cs.AI q-bio.GN | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Subspace clustering has gained increasing popularity in the analysis of gene
expression data. Among subspace cluster models, the recently introduced
order-preserving sub-matrix (OPSM) has demonstrated high promise. An OPSM,
essentially a pattern-based subspace cluster, is a subset of rows and columns
in a data matrix... | [
{
"version": "v1",
"created": "Mon, 13 Apr 2009 08:16:53 GMT"
}
] | 2009-04-14T00:00:00 | [
[
"Griffith",
"Obi L.",
""
],
[
"Gao",
"Byron J.",
""
],
[
"Bilenky",
"Mikhail",
""
],
[
"Prichyna",
"Yuliya",
""
],
[
"Ester",
"Martin",
""
],
[
"Jones",
"Steven J. M.",
""
]
] | TITLE: KiWi: A Scalable Subspace Clustering Algorithm for Gene Expression
Analysis
ABSTRACT: Subspace clustering has gained increasing popularity in the analysis of gene
expression data. Among subspace cluster models, the recently introduced
order-preserving sub-matrix (OPSM) has demonstrated high promise. An OPS... |
0904.1313 | Hao Zhang | Hao Zhang, Gang Li, Huadong Meng | A Class of Novel STAP Algorithms Using Sparse Recovery Technique | 8 pages, 5 figures | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A class of novel STAP algorithms based on sparse recovery technique were
presented. Intrinsic sparsity of distribution of clutter and target energy on
spatial-frequency plane was exploited from the viewpoint of compressed sensing.
The original sample data and distribution of target and clutter energy was
connected by... | [
{
"version": "v1",
"created": "Wed, 8 Apr 2009 11:58:02 GMT"
}
] | 2009-04-09T00:00:00 | [
[
"Zhang",
"Hao",
""
],
[
"Li",
"Gang",
""
],
[
"Meng",
"Huadong",
""
]
] | TITLE: A Class of Novel STAP Algorithms Using Sparse Recovery Technique
ABSTRACT: A class of novel STAP algorithms based on sparse recovery technique were
presented. Intrinsic sparsity of distribution of clutter and target energy on
spatial-frequency plane was exploited from the viewpoint of compressed sensing.
The... |
0903.4035 | Iraklis Varlamis | A. Kritikopoulos, M. Sideri, I. Varlamis | BLOGRANK: Ranking Weblogs Based On Connectivity And Similarity Features | 9 pages, in 2nd international workshop on Advanced architectures and
algorithms for internet delivery and applications | Proceedings of the 2nd international Workshop on Advanced
Architectures and Algorithms For internet Delivery and Applications (Pisa,
Italy, October 10 - 10, 2006). AAA-IDEA '06 | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A large part of the hidden web resides in weblog servers. New content is
produced in a daily basis and the work of traditional search engines turns to
be insufficient due to the nature of weblogs. This work summarizes the
structure of the blogosphere and highlights the special features of weblogs. In
this paper we pr... | [
{
"version": "v1",
"created": "Tue, 24 Mar 2009 08:36:21 GMT"
}
] | 2009-03-25T00:00:00 | [
[
"Kritikopoulos",
"A.",
""
],
[
"Sideri",
"M.",
""
],
[
"Varlamis",
"I.",
""
]
] | TITLE: BLOGRANK: Ranking Weblogs Based On Connectivity And Similarity Features
ABSTRACT: A large part of the hidden web resides in weblog servers. New content is
produced in a daily basis and the work of traditional search engines turns to
be insufficient due to the nature of weblogs. This work summarizes the
struc... |
0801.1647 | Vincenzo Nicosia | V. Nicosia, G. Mangioni, V. Carchiolo and M. Malgeri | Extending the definition of modularity to directed graphs with
overlapping communities | 22 pages, 11 figures | J. Stat. Mech. (2009) P03024 | 10.1088/1742-5468/2009/03/P03024 | null | physics.data-an physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Complex networks topologies present interesting and surprising properties,
such as community structures, which can be exploited to optimize communication,
to find new efficient and context-aware routing algorithms or simply to
understand the dynamics and meaning of relationships among nodes. Complex
networks are gain... | [
{
"version": "v1",
"created": "Thu, 10 Jan 2008 18:04:35 GMT"
},
{
"version": "v2",
"created": "Tue, 22 Jan 2008 16:05:02 GMT"
},
{
"version": "v3",
"created": "Tue, 29 Jan 2008 17:57:26 GMT"
},
{
"version": "v4",
"created": "Tue, 24 Mar 2009 18:43:28 GMT"
}
] | 2009-03-24T00:00:00 | [
[
"Nicosia",
"V.",
""
],
[
"Mangioni",
"G.",
""
],
[
"Carchiolo",
"V.",
""
],
[
"Malgeri",
"M.",
""
]
] | TITLE: Extending the definition of modularity to directed graphs with
overlapping communities
ABSTRACT: Complex networks topologies present interesting and surprising properties,
such as community structures, which can be exploited to optimize communication,
to find new efficient and context-aware routing algorit... |
0903.3228 | Alberto Accomazzi | Michael J. Kurtz, Alberto Accomazzi, Stephen S. Murray | The Smithsonian/NASA Astrophysics Data System (ADS) Decennial Report | 6 pages, whitepaper submitted to the National Research Council
Astronomy and Astrophysics Decadal Survey | null | null | null | astro-ph.IM cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Eight years after the ADS first appeared the last decadal survey wrote:
"NASA's initiative for the Astrophysics Data System has vastly increased the
accessibility of the scientific literature for astronomers. NASA deserves
credit for this valuable initiative and is urged to continue it." Here we
summarize some of the... | [
{
"version": "v1",
"created": "Wed, 18 Mar 2009 19:36:57 GMT"
}
] | 2009-03-19T00:00:00 | [
[
"Kurtz",
"Michael J.",
""
],
[
"Accomazzi",
"Alberto",
""
],
[
"Murray",
"Stephen S.",
""
]
] | TITLE: The Smithsonian/NASA Astrophysics Data System (ADS) Decennial Report
ABSTRACT: Eight years after the ADS first appeared the last decadal survey wrote:
"NASA's initiative for the Astrophysics Data System has vastly increased the
accessibility of the scientific literature for astronomers. NASA deserves
credit ... |
0807.0023 | Marko A. Rodriguez | Marko A. Rodriguez, Johan Bollen, Herbert Van de Sompel | Automatic Metadata Generation using Associative Networks | null | ACM Transactions on Information Systems, volume 27, number 2,
pages 1-20, ISSN: 1046-8188, ACM Press, February 2009 | 10.1145/1462198.1462199 | LA-UR-06-3445 | cs.IR cs.DL | http://creativecommons.org/licenses/publicdomain/ | In spite of its tremendous value, metadata is generally sparse and
incomplete, thereby hampering the effectiveness of digital information
services. Many of the existing mechanisms for the automated creation of
metadata rely primarily on content analysis which can be costly and
inefficient. The automatic metadata gene... | [
{
"version": "v1",
"created": "Mon, 30 Jun 2008 21:23:28 GMT"
},
{
"version": "v2",
"created": "Sat, 7 Mar 2009 01:20:48 GMT"
}
] | 2009-03-07T00:00:00 | [
[
"Rodriguez",
"Marko A.",
""
],
[
"Bollen",
"Johan",
""
],
[
"Van de Sompel",
"Herbert",
""
]
] | TITLE: Automatic Metadata Generation using Associative Networks
ABSTRACT: In spite of its tremendous value, metadata is generally sparse and
incomplete, thereby hampering the effectiveness of digital information
services. Many of the existing mechanisms for the automated creation of
metadata rely primarily on conte... |
0903.0625 | Edith Cohen | Edith Cohen, Haim Kaplan | Leveraging Discarded Samples for Tighter Estimation of Multiple-Set
Aggregates | 16 pages | null | null | null | cs.DB cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many datasets such as market basket data, text or hypertext documents, and
sensor observations recorded in different locations or time periods, are
modeled as a collection of sets over a ground set of keys. We are interested in
basic aggregates such as the weight or selectivity of keys that satisfy some
selection pre... | [
{
"version": "v1",
"created": "Tue, 3 Mar 2009 21:21:02 GMT"
}
] | 2009-03-05T00:00:00 | [
[
"Cohen",
"Edith",
""
],
[
"Kaplan",
"Haim",
""
]
] | TITLE: Leveraging Discarded Samples for Tighter Estimation of Multiple-Set
Aggregates
ABSTRACT: Many datasets such as market basket data, text or hypertext documents, and
sensor observations recorded in different locations or time periods, are
modeled as a collection of sets over a ground set of keys. We are inte... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.