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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1107.3765 | Jordan Boyd-Graber | Ke Zhai, Jordan Boyd-Graber, and Nima Asadi | Using Variational Inference and MapReduce to Scale Topic Modeling | null | null | null | null | cs.AI cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Latent Dirichlet Allocation (LDA) is a popular topic modeling technique for
exploring document collections. Because of the increasing prevalence of large
datasets, there is a need to improve the scalability of inference of LDA. In
this paper, we propose a technique called ~\emph{MapReduce LDA} (Mr. LDA) to
accommodat... | [
{
"version": "v1",
"created": "Tue, 19 Jul 2011 16:32:22 GMT"
}
] | 2011-07-20T00:00:00 | [
[
"Zhai",
"Ke",
""
],
[
"Boyd-Graber",
"Jordan",
""
],
[
"Asadi",
"Nima",
""
]
] | TITLE: Using Variational Inference and MapReduce to Scale Topic Modeling
ABSTRACT: Latent Dirichlet Allocation (LDA) is a popular topic modeling technique for
exploring document collections. Because of the increasing prevalence of large
datasets, there is a need to improve the scalability of inference of LDA. In
th... |
1103.5112 | Mikail Rubinov | Mikail Rubinov and Olaf Sporns | Weight-conserving characterization of complex functional brain networks | NeuroImage, in press | Neuroimage. 2011 Jun 15;56(4):2068-79. Epub 2011 Apr 1 | 10.1016/j.neuroimage.2011.03.069 | null | q-bio.NC cond-mat.dis-nn physics.data-an | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Complex functional brain networks are large networks of brain regions and
functional brain connections. Statistical characterizations of these networks
aim to quantify global and local properties of brain activity with a small
number of network measures. Important functional network measures include
measures of modul... | [
{
"version": "v1",
"created": "Sat, 26 Mar 2011 06:57:37 GMT"
}
] | 2011-07-19T00:00:00 | [
[
"Rubinov",
"Mikail",
""
],
[
"Sporns",
"Olaf",
""
]
] | TITLE: Weight-conserving characterization of complex functional brain networks
ABSTRACT: Complex functional brain networks are large networks of brain regions and
functional brain connections. Statistical characterizations of these networks
aim to quantify global and local properties of brain activity with a small
... |
1107.2859 | Jinhui Tang | Jinhui Tang, Shuicheng Yan, Tat-Seng Chua and Ramesh Jain | Label-Specific Training Set Construction from Web Resource for Image
Annotation | 4 pages, 5 figures | null | null | null | cs.MM cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently many research efforts have been devoted to image annotation by
leveraging on the associated tags/keywords of web images as training labels. A
key issue to resolve is the relatively low accuracy of the tags. In this paper,
we propose a novel semi-automatic framework to construct a more accurate and
effective ... | [
{
"version": "v1",
"created": "Thu, 14 Jul 2011 15:52:21 GMT"
}
] | 2011-07-15T00:00:00 | [
[
"Tang",
"Jinhui",
""
],
[
"Yan",
"Shuicheng",
""
],
[
"Chua",
"Tat-Seng",
""
],
[
"Jain",
"Ramesh",
""
]
] | TITLE: Label-Specific Training Set Construction from Web Resource for Image
Annotation
ABSTRACT: Recently many research efforts have been devoted to image annotation by
leveraging on the associated tags/keywords of web images as training labels. A
key issue to resolve is the relatively low accuracy of the tags. I... |
1107.2553 | Toufiq Parag | Toufiq Parag and Vladimir Pavlovic and Ahmed Elgammal | Learning Hypergraph Labeling for Feature Matching | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This study poses the feature correspondence problem as a hypergraph node
labeling problem. Candidate feature matches and their subsets (usually of size
larger than two) are considered to be the nodes and hyperedges of a hypergraph.
A hypergraph labeling algorithm, which models the subset-wise interaction by an
undire... | [
{
"version": "v1",
"created": "Wed, 13 Jul 2011 14:01:50 GMT"
}
] | 2011-07-14T00:00:00 | [
[
"Parag",
"Toufiq",
""
],
[
"Pavlovic",
"Vladimir",
""
],
[
"Elgammal",
"Ahmed",
""
]
] | TITLE: Learning Hypergraph Labeling for Feature Matching
ABSTRACT: This study poses the feature correspondence problem as a hypergraph node
labeling problem. Candidate feature matches and their subsets (usually of size
larger than two) are considered to be the nodes and hyperedges of a hypergraph.
A hypergraph labe... |
1106.2603 | Sam Ma | Chengxi Ye, Zhanshan Sam Ma, Charles H. Cannon, Mihai Pop, Douglas W.
Yu | SparseAssembler: de novo Assembly with the Sparse de Bruijn Graph | Corresponding author: Douglas W. Yu, dougwyu@gmail.com | null | null | null | cs.DS q-bio.GN | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | de Bruijn graph-based algorithms are one of the two most widely used
approaches for de novo genome assembly. A major limitation of this approach is
the large computational memory space requirement to construct the de Bruijn
graph, which scales with k-mer length and total diversity (N) of unique k-mers
in the genome e... | [
{
"version": "v1",
"created": "Tue, 14 Jun 2011 04:06:06 GMT"
}
] | 2011-07-11T00:00:00 | [
[
"Ye",
"Chengxi",
""
],
[
"Ma",
"Zhanshan Sam",
""
],
[
"Cannon",
"Charles H.",
""
],
[
"Pop",
"Mihai",
""
],
[
"Yu",
"Douglas W.",
""
]
] | TITLE: SparseAssembler: de novo Assembly with the Sparse de Bruijn Graph
ABSTRACT: de Bruijn graph-based algorithms are one of the two most widely used
approaches for de novo genome assembly. A major limitation of this approach is
the large computational memory space requirement to construct the de Bruijn
graph, wh... |
1107.1104 | Samur Araujo | Samur Araujo, Jan Hidders, Daniel Schwabe and Arjen P. de Vries | SERIMI - Resource Description Similarity, RDF Instance Matching and
Interlinking | null | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The interlinking of datasets published in the Linked Data Cloud is a
challenging problem and a key factor for the success of the Semantic Web.
Manual rule-based methods are the most effective solution for the problem, but
they require skilled human data publishers going through a laborious, error
prone and time-consu... | [
{
"version": "v1",
"created": "Wed, 6 Jul 2011 11:56:34 GMT"
}
] | 2011-07-07T00:00:00 | [
[
"Araujo",
"Samur",
""
],
[
"Hidders",
"Jan",
""
],
[
"Schwabe",
"Daniel",
""
],
[
"de Vries",
"Arjen P.",
""
]
] | TITLE: SERIMI - Resource Description Similarity, RDF Instance Matching and
Interlinking
ABSTRACT: The interlinking of datasets published in the Linked Data Cloud is a
challenging problem and a key factor for the success of the Semantic Web.
Manual rule-based methods are the most effective solution for the problem... |
1107.1128 | Seeja K. R. | K.R Seeja | AISMOTIF-An Artificial Immune System for DNA Motif Discovery | 7 pages | IJCSI International Journal of Computer Science Issues, Vol. 8,
Issue 2, March 2011 IJCSI International Journal of Computer Science Issues,
Vol. 8, Issue 2, March 2011, ISSN (Online): 1694-0814, pages 143-149 | null | null | cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Discovery of transcription factor binding sites is a much explored and still
exploring area of research in functional genomics. Many computational tools
have been developed for finding motifs and each of them has their own
advantages as well as disadvantages. Most of these algorithms need prior
knowledge about the da... | [
{
"version": "v1",
"created": "Tue, 5 Jul 2011 06:01:20 GMT"
}
] | 2011-07-07T00:00:00 | [
[
"Seeja",
"K. R",
""
]
] | TITLE: AISMOTIF-An Artificial Immune System for DNA Motif Discovery
ABSTRACT: Discovery of transcription factor binding sites is a much explored and still
exploring area of research in functional genomics. Many computational tools
have been developed for finding motifs and each of them has their own
advantages as w... |
1107.1229 | Daniel Rockmore | Sean Brocklebank, Scott Pauls, Daniel Rockmore, Timothy C. Bates | Characteristic Characteristics | 23 pages, 5 Figures, 3 Tables | null | null | null | stat.AP cs.IR physics.data-an | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While five-factor models of personality are widespread, there is still not
universal agreement on this as a structural framework. Part of the reason for
the lingering debate is its dependence on factor analysis. In particular,
derivation or refutation of the model via other statistical means is a
worthwhile project. ... | [
{
"version": "v1",
"created": "Wed, 6 Jul 2011 19:45:14 GMT"
}
] | 2011-07-07T00:00:00 | [
[
"Brocklebank",
"Sean",
""
],
[
"Pauls",
"Scott",
""
],
[
"Rockmore",
"Daniel",
""
],
[
"Bates",
"Timothy C.",
""
]
] | TITLE: Characteristic Characteristics
ABSTRACT: While five-factor models of personality are widespread, there is still not
universal agreement on this as a structural framework. Part of the reason for
the lingering debate is its dependence on factor analysis. In particular,
derivation or refutation of the model via... |
1107.0922 | Danny Bickson | Yucheng Low, Joseph Gonzalez, Aapo Kyrola, Danny Bickson, Carlos
Guestrin | GraphLab: A Distributed Framework for Machine Learning in the Cloud | CMU Tech Report, GraphLab project webpage: http://graphlab.org | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Machine Learning (ML) techniques are indispensable in a wide range of fields.
Unfortunately, the exponential increase of dataset sizes are rapidly extending
the runtime of sequential algorithms and threatening to slow future progress in
ML. With the promise of affordable large-scale parallel computing, Cloud
systems ... | [
{
"version": "v1",
"created": "Tue, 5 Jul 2011 16:56:53 GMT"
}
] | 2011-07-06T00:00:00 | [
[
"Low",
"Yucheng",
""
],
[
"Gonzalez",
"Joseph",
""
],
[
"Kyrola",
"Aapo",
""
],
[
"Bickson",
"Danny",
""
],
[
"Guestrin",
"Carlos",
""
]
] | TITLE: GraphLab: A Distributed Framework for Machine Learning in the Cloud
ABSTRACT: Machine Learning (ML) techniques are indispensable in a wide range of fields.
Unfortunately, the exponential increase of dataset sizes are rapidly extending
the runtime of sequential algorithms and threatening to slow future progre... |
1107.0414 | Francois Meyer | Kye M. Taylor and Francois G. Meyer | A random walk on image patches | null | null | null | null | physics.data-an cs.DM stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we address the problem of understanding the success of
algorithms that organize patches according to graph-based metrics. Algorithms
that analyze patches extracted from images or time series have led to
state-of-the art techniques for classification, denoising, and the study of
nonlinear dynamics. The m... | [
{
"version": "v1",
"created": "Sat, 2 Jul 2011 20:37:07 GMT"
}
] | 2011-07-05T00:00:00 | [
[
"Taylor",
"Kye M.",
""
],
[
"Meyer",
"Francois G.",
""
]
] | TITLE: A random walk on image patches
ABSTRACT: In this paper we address the problem of understanding the success of
algorithms that organize patches according to graph-based metrics. Algorithms
that analyze patches extracted from images or time series have led to
state-of-the art techniques for classification, den... |
1102.5499 | Linyuan Lu | Linyuan Lu, Weiping Liu | Information filtering via preferential diffusion | 12 pages, 10 figures, 2 tables | Physical Review E 83, 066119 (2011) | 10.1103/PhysRevE.83.066119 | null | physics.data-an cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recommender systems have shown great potential to address information
overload problem, namely to help users in finding interesting and relevant
objects within a huge information space. Some physical dynamics, including heat
conduction process and mass or energy diffusion on networks, have recently
found applications... | [
{
"version": "v1",
"created": "Sun, 27 Feb 2011 13:12:53 GMT"
}
] | 2011-07-04T00:00:00 | [
[
"Lu",
"Linyuan",
""
],
[
"Liu",
"Weiping",
""
]
] | TITLE: Information filtering via preferential diffusion
ABSTRACT: Recommender systems have shown great potential to address information
overload problem, namely to help users in finding interesting and relevant
objects within a huge information space. Some physical dynamics, including heat
conduction process and ma... |
1106.5917 | Jitesh Dundas | Jitesh Dundas and David Chik | Implementing Human-like Intuition Mechanism in Artificial Intelligence | 14 pages with 1 figure + 1 table | null | null | null | cs.AI cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Human intuition has been simulated by several research projects using
artificial intelligence techniques. Most of these algorithms or models lack the
ability to handle complications or diversions. Moreover, they also do not
explain the factors influencing intuition and the accuracy of the results from
this process. I... | [
{
"version": "v1",
"created": "Wed, 29 Jun 2011 12:03:33 GMT"
}
] | 2011-06-30T00:00:00 | [
[
"Dundas",
"Jitesh",
""
],
[
"Chik",
"David",
""
]
] | TITLE: Implementing Human-like Intuition Mechanism in Artificial Intelligence
ABSTRACT: Human intuition has been simulated by several research projects using
artificial intelligence techniques. Most of these algorithms or models lack the
ability to handle complications or diversions. Moreover, they also do not
expl... |
1106.6024 | Indraneel Mukherjee | Indraneel Mukherjee and Cynthia Rudin and Robert E. Schapire | The Rate of Convergence of AdaBoost | A preliminary version will appear in COLT 2011 | null | null | null | math.OC cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The AdaBoost algorithm was designed to combine many "weak" hypotheses that
perform slightly better than random guessing into a "strong" hypothesis that
has very low error. We study the rate at which AdaBoost iteratively converges
to the minimum of the "exponential loss." Unlike previous work, our proofs do
not requir... | [
{
"version": "v1",
"created": "Wed, 29 Jun 2011 18:53:46 GMT"
}
] | 2011-06-30T00:00:00 | [
[
"Mukherjee",
"Indraneel",
""
],
[
"Rudin",
"Cynthia",
""
],
[
"Schapire",
"Robert E.",
""
]
] | TITLE: The Rate of Convergence of AdaBoost
ABSTRACT: The AdaBoost algorithm was designed to combine many "weak" hypotheses that
perform slightly better than random guessing into a "strong" hypothesis that
has very low error. We study the rate at which AdaBoost iteratively converges
to the minimum of the "exponentia... |
1106.5186 | Ula\c{s} Ba\u{g}ci | Ulas Bagci, Jianhua Yao, Jesus Caban, Anthony F. Suffredini, Tara N.
Palmore, Daniel J. Mollura | Learning Shape and Texture Characteristics of CT Tree-in-Bud Opacities
for CAD Systems | 7 pages, 4 figures. Published in Proc. of Medical Image Computing and
Computer Assisted Interventions (MICCAI), 2011 | null | null | NIH-CIDI-MICCAI2011 | cs.CV | http://creativecommons.org/licenses/publicdomain/ | Although radiologists can employ CAD systems to characterize malignancies,
pulmonary fibrosis and other chronic diseases; the design of imaging techniques
to quantify infectious diseases continue to lag behind. There exists a need to
create more CAD systems capable of detecting and quantifying characteristic
patterns... | [
{
"version": "v1",
"created": "Sun, 26 Jun 2011 03:35:08 GMT"
}
] | 2011-06-28T00:00:00 | [
[
"Bagci",
"Ulas",
""
],
[
"Yao",
"Jianhua",
""
],
[
"Caban",
"Jesus",
""
],
[
"Suffredini",
"Anthony F.",
""
],
[
"Palmore",
"Tara N.",
""
],
[
"Mollura",
"Daniel J.",
""
]
] | TITLE: Learning Shape and Texture Characteristics of CT Tree-in-Bud Opacities
for CAD Systems
ABSTRACT: Although radiologists can employ CAD systems to characterize malignancies,
pulmonary fibrosis and other chronic diseases; the design of imaging techniques
to quantify infectious diseases continue to lag behind.... |
1106.4880 | Ying Ding | Qian Zhu, Yuyin Sun, Sashikiran Challa, Ying Ding, Michael S.
Lajiness, David J. Wild | Semantic Inference using Chemogenomics Data for Drug Discovery | 23 pages, 9 figures, 4 tables | null | 10.1186/1471-2105-12-256 | null | q-bio.QM cs.DL cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Background Semantic Web Technology (SWT) makes it possible to integrate and
search the large volume of life science datasets in the public domain, as
demonstrated by well-known linked data projects such as LODD, Bio2RDF, and
Chem2Bio2RDF. Integration of these sets creates large networks of information.
We have previo... | [
{
"version": "v1",
"created": "Fri, 24 Jun 2011 03:21:56 GMT"
}
] | 2011-06-27T00:00:00 | [
[
"Zhu",
"Qian",
""
],
[
"Sun",
"Yuyin",
""
],
[
"Challa",
"Sashikiran",
""
],
[
"Ding",
"Ying",
""
],
[
"Lajiness",
"Michael S.",
""
],
[
"Wild",
"David J.",
""
]
] | TITLE: Semantic Inference using Chemogenomics Data for Drug Discovery
ABSTRACT: Background Semantic Web Technology (SWT) makes it possible to integrate and
search the large volume of life science datasets in the public domain, as
demonstrated by well-known linked data projects such as LODD, Bio2RDF, and
Chem2Bio2RD... |
1106.3791 | Shanika Kuruppu Ms | Shanika Kuruppu, Simon Puglisi and Justin Zobel | Reference Sequence Construction for Relative Compression of Genomes | 12 pages, 2 figures, to appear in the Proceedings of SPIRE2011 as a
short paper | null | null | null | q-bio.QM cs.CE cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Relative compression, where a set of similar strings are compressed with
respect to a reference string, is a very effective method of compressing DNA
datasets containing multiple similar sequences. Relative compression is fast to
perform and also supports rapid random access to the underlying data. The main
difficult... | [
{
"version": "v1",
"created": "Mon, 20 Jun 2011 01:10:01 GMT"
}
] | 2011-06-21T00:00:00 | [
[
"Kuruppu",
"Shanika",
""
],
[
"Puglisi",
"Simon",
""
],
[
"Zobel",
"Justin",
""
]
] | TITLE: Reference Sequence Construction for Relative Compression of Genomes
ABSTRACT: Relative compression, where a set of similar strings are compressed with
respect to a reference string, is a very effective method of compressing DNA
datasets containing multiple similar sequences. Relative compression is fast to
p... |
1106.3395 | Remi Flamary | R\'emi Flamary (LITIS), Alain Rakotomamonjy (LITIS) | Decoding finger movements from ECoG signals using switching linear
models | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the major challenges of ECoG-based Brain-Machine Interfaces is the
movement prediction of a human subject. Several methods exist to predict an arm
2-D trajectory. The fourth BCI Competition gives a dataset in which the aim is
to predict individual finger movements (5-D trajectory). The difficulty lies in
the f... | [
{
"version": "v1",
"created": "Fri, 17 Jun 2011 06:53:47 GMT"
}
] | 2011-06-20T00:00:00 | [
[
"Flamary",
"Rémi",
"",
"LITIS"
],
[
"Rakotomamonjy",
"Alain",
"",
"LITIS"
]
] | TITLE: Decoding finger movements from ECoG signals using switching linear
models
ABSTRACT: One of the major challenges of ECoG-based Brain-Machine Interfaces is the
movement prediction of a human subject. Several methods exist to predict an arm
2-D trajectory. The fourth BCI Competition gives a dataset in which t... |
1106.3396 | Remi Flamary | R\'emi Flamary (LITIS), Benjamin Labb\'e (LITIS), Alain Rakotomamonjy
(LITIS) | Large margin filtering for signal sequence labeling | IEEE International Conference on Acoustics Speech and Signal
Processing (ICASSP), 2010, Dallas : United States (2010) | null | 10.1109/ICASSP.2010.5495281 | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Signal Sequence Labeling consists in predicting a sequence of labels given an
observed sequence of samples. A naive way is to filter the signal in order to
reduce the noise and to apply a classification algorithm on the filtered
samples. We propose in this paper to jointly learn the filter with the
classifier leading... | [
{
"version": "v1",
"created": "Fri, 17 Jun 2011 06:54:35 GMT"
}
] | 2011-06-20T00:00:00 | [
[
"Flamary",
"Rémi",
"",
"LITIS"
],
[
"Labbé",
"Benjamin",
"",
"LITIS"
],
[
"Rakotomamonjy",
"Alain",
"",
"LITIS"
]
] | TITLE: Large margin filtering for signal sequence labeling
ABSTRACT: Signal Sequence Labeling consists in predicting a sequence of labels given an
observed sequence of samples. A naive way is to filter the signal in order to
reduce the noise and to apply a classification algorithm on the filtered
samples. We propos... |
1106.3467 | Debotosh Bhattacharjee | Arindam Kar, Debotosh Bhattacharjee, Dipak Kumar Basu, Mita Nasipuri,
Mahantapas Kundu | High Performance Human Face Recognition using Independent High Intensity
Gabor Wavelet Responses: A Statistical Approach | Keywords: Feature extraction; Gabor Wavelets; independent
high-intensity feature (IHIF); Independent Component Analysis (ICA);
Specificity; Sensitivity; Cosine Similarity Measure; E-ISSN: 2044-6004 | International Journal of Computer Science & Emerging Technologies
pp 178-187, Volume 2, Issue 1, February 2011 | null | null | cs.CV | http://creativecommons.org/licenses/by/3.0/ | In this paper, we present a technique by which high-intensity feature vectors
extracted from the Gabor wavelet transformation of frontal face images, is
combined together with Independent Component Analysis (ICA) for enhanced face
recognition. Firstly, the high-intensity feature vectors are automatically
extracted us... | [
{
"version": "v1",
"created": "Fri, 17 Jun 2011 12:42:26 GMT"
}
] | 2011-06-20T00:00:00 | [
[
"Kar",
"Arindam",
""
],
[
"Bhattacharjee",
"Debotosh",
""
],
[
"Basu",
"Dipak Kumar",
""
],
[
"Nasipuri",
"Mita",
""
],
[
"Kundu",
"Mahantapas",
""
]
] | TITLE: High Performance Human Face Recognition using Independent High Intensity
Gabor Wavelet Responses: A Statistical Approach
ABSTRACT: In this paper, we present a technique by which high-intensity feature vectors
extracted from the Gabor wavelet transformation of frontal face images, is
combined together with ... |
1106.3166 | Jan Buytaert | J.A.N. Buytaert, W.H.M. Salih, M. Dierick, P. Jacobs and J.J.J. Dirckx | Realistic 3D computer model of the gerbil middle ear, featuring accurate
morphology of bone and soft tissue structures | 41 pages, 14 figures, to be published in JARO - Journal of the
Association for Research in Otolaryngology | null | null | null | q-bio.TO physics.bio-ph | http://creativecommons.org/licenses/by-nc-sa/3.0/ | In order to improve realism in middle ear (ME) finite element modeling (FEM),
comprehensive and precise morphological data are needed. To date, micro-scale
X-ray computed tomography (\mu CT) recordings have been used as geometric input
data for FEM models of the ME ossicles. Previously, attempts were made to
obtain t... | [
{
"version": "v1",
"created": "Thu, 16 Jun 2011 08:26:53 GMT"
}
] | 2011-06-17T00:00:00 | [
[
"Buytaert",
"J. A. N.",
""
],
[
"Salih",
"W. H. M.",
""
],
[
"Dierick",
"M.",
""
],
[
"Jacobs",
"P.",
""
],
[
"Dirckx",
"J. J. J.",
""
]
] | TITLE: Realistic 3D computer model of the gerbil middle ear, featuring accurate
morphology of bone and soft tissue structures
ABSTRACT: In order to improve realism in middle ear (ME) finite element modeling (FEM),
comprehensive and precise morphological data are needed. To date, micro-scale
X-ray computed tomogra... |
1106.2312 | Rathipriya R | R.Rathipriya, Dr. K.Thangavel and J.Bagyamani | Evolutionary Biclustering of Clickstream Data | null | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Biclustering is a two way clustering approach involving simultaneous
clustering along two dimensions of the data matrix. Finding biclusters of web
objects (i.e. web users and web pages) is an emerging topic in the context of
web usage mining. It overcomes the problem associated with traditional
clustering methods by ... | [
{
"version": "v1",
"created": "Sun, 12 Jun 2011 14:34:16 GMT"
}
] | 2011-06-14T00:00:00 | [
[
"Rathipriya",
"R.",
""
],
[
"Thangavel",
"Dr. K.",
""
],
[
"Bagyamani",
"J.",
""
]
] | TITLE: Evolutionary Biclustering of Clickstream Data
ABSTRACT: Biclustering is a two way clustering approach involving simultaneous
clustering along two dimensions of the data matrix. Finding biclusters of web
objects (i.e. web users and web pages) is an emerging topic in the context of
web usage mining. It overcom... |
1102.3937 | Victor Lee | Ruoming Jin, Victor E. Lee, Hui Hong | Axiomatic Ranking of Network Role Similarity | 17 pages, twocolumn Version 2 of this technical report fixes minor
errors in the Triangle Inequality proof, grammatical errors, and other typos.
Edited and more polished version to be published in KDD'11, August 2011 | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A key task in social network and other complex network analysis is role
analysis: describing and categorizing nodes according to how they interact with
other nodes. Two nodes have the same role if they interact with equivalent sets
of neighbors. The most fundamental role equivalence is automorphic equivalence.
Unfort... | [
{
"version": "v1",
"created": "Fri, 18 Feb 2011 23:36:05 GMT"
},
{
"version": "v2",
"created": "Fri, 10 Jun 2011 03:06:15 GMT"
}
] | 2011-06-13T00:00:00 | [
[
"Jin",
"Ruoming",
""
],
[
"Lee",
"Victor E.",
""
],
[
"Hong",
"Hui",
""
]
] | TITLE: Axiomatic Ranking of Network Role Similarity
ABSTRACT: A key task in social network and other complex network analysis is role
analysis: describing and categorizing nodes according to how they interact with
other nodes. Two nodes have the same role if they interact with equivalent sets
of neighbors. The most... |
1106.1811 | Arnab Bhattacharya | Arnab Bhattacharya and B. Palvali Teja and Sourav Dutta | Caching Stars in the Sky: A Semantic Caching Approach to Accelerate
Skyline Queries | 11 pages; will be published in DEXA 2011 | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-criteria decision making has been made possible with the advent of
skyline queries. However, processing such queries for high dimensional datasets
remains a time consuming task. Real-time applications are thus infeasible,
especially for non-indexed skyline techniques where the datasets arrive online.
In this pa... | [
{
"version": "v1",
"created": "Thu, 9 Jun 2011 13:47:34 GMT"
},
{
"version": "v2",
"created": "Fri, 10 Jun 2011 07:32:04 GMT"
}
] | 2011-06-13T00:00:00 | [
[
"Bhattacharya",
"Arnab",
""
],
[
"Teja",
"B. Palvali",
""
],
[
"Dutta",
"Sourav",
""
]
] | TITLE: Caching Stars in the Sky: A Semantic Caching Approach to Accelerate
Skyline Queries
ABSTRACT: Multi-criteria decision making has been made possible with the advent of
skyline queries. However, processing such queries for high dimensional datasets
remains a time consuming task. Real-time applications are th... |
1106.1684 | Mehmet Umut Sen Mr. | Mehmet Umut Sen and Hakan Erdogan | Max-Margin Stacking and Sparse Regularization for Linear Classifier
Combination and Selection | 8 pages, 3 figures, 6 tables, journal | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The main principle of stacked generalization (or Stacking) is using a
second-level generalizer to combine the outputs of base classifiers in an
ensemble. In this paper, we investigate different combination types under the
stacking framework; namely weighted sum (WS), class-dependent weighted sum
(CWS) and linear stac... | [
{
"version": "v1",
"created": "Wed, 8 Jun 2011 23:03:47 GMT"
}
] | 2011-06-10T00:00:00 | [
[
"Sen",
"Mehmet Umut",
""
],
[
"Erdogan",
"Hakan",
""
]
] | TITLE: Max-Margin Stacking and Sparse Regularization for Linear Classifier
Combination and Selection
ABSTRACT: The main principle of stacked generalization (or Stacking) is using a
second-level generalizer to combine the outputs of base classifiers in an
ensemble. In this paper, we investigate different combinati... |
0911.4046 | Ryota Tomioka | Ryota Tomioka, Taiji Suzuki, Masashi Sugiyama | Super-Linear Convergence of Dual Augmented-Lagrangian Algorithm for
Sparsity Regularized Estimation | 51 pages, 9 figures | Journal of Machine Learning Research, 12(May):1537-1586, 2011 | null | null | stat.ML cs.LG stat.ME | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We analyze the convergence behaviour of a recently proposed algorithm for
regularized estimation called Dual Augmented Lagrangian (DAL). Our analysis is
based on a new interpretation of DAL as a proximal minimization algorithm. We
theoretically show under some conditions that DAL converges super-linearly in a
non-asy... | [
{
"version": "v1",
"created": "Fri, 20 Nov 2009 13:44:28 GMT"
},
{
"version": "v2",
"created": "Wed, 12 May 2010 12:33:07 GMT"
},
{
"version": "v3",
"created": "Sun, 2 Jan 2011 07:04:21 GMT"
}
] | 2011-06-07T00:00:00 | [
[
"Tomioka",
"Ryota",
""
],
[
"Suzuki",
"Taiji",
""
],
[
"Sugiyama",
"Masashi",
""
]
] | TITLE: Super-Linear Convergence of Dual Augmented-Lagrangian Algorithm for
Sparsity Regularized Estimation
ABSTRACT: We analyze the convergence behaviour of a recently proposed algorithm for
regularized estimation called Dual Augmented Lagrangian (DAL). Our analysis is
based on a new interpretation of DAL as a pr... |
1106.0967 | Ping Li | Ping Li, Anshumali Shrivastava, Joshua Moore, Arnd Christian Konig | Hashing Algorithms for Large-Scale Learning | null | null | null | null | stat.ML cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we first demonstrate that b-bit minwise hashing, whose
estimators are positive definite kernels, can be naturally integrated with
learning algorithms such as SVM and logistic regression. We adopt a simple
scheme to transform the nonlinear (resemblance) kernel into linear (inner
product) kernel; and hen... | [
{
"version": "v1",
"created": "Mon, 6 Jun 2011 06:38:20 GMT"
}
] | 2011-06-07T00:00:00 | [
[
"Li",
"Ping",
""
],
[
"Shrivastava",
"Anshumali",
""
],
[
"Moore",
"Joshua",
""
],
[
"Konig",
"Arnd Christian",
""
]
] | TITLE: Hashing Algorithms for Large-Scale Learning
ABSTRACT: In this paper, we first demonstrate that b-bit minwise hashing, whose
estimators are positive definite kernels, can be naturally integrated with
learning algorithms such as SVM and logistic regression. We adopt a simple
scheme to transform the nonlinear (... |
1008.4815 | Alberto Costa | Alberto Costa, Fabio Roda | Recommender Systems by means of Information Retrieval | null | null | 10.1145/1988688.1988755 | null | cs.IR | http://creativecommons.org/licenses/by-nc-sa/3.0/ | In this paper we present a method for reformulating the Recommender Systems
problem in an Information Retrieval one. In our tests we have a dataset of
users who give ratings for some movies; we hide some values from the dataset,
and we try to predict them again using its remaining portion (the so-called
"leave-n-out ... | [
{
"version": "v1",
"created": "Fri, 27 Aug 2010 22:24:25 GMT"
}
] | 2011-06-03T00:00:00 | [
[
"Costa",
"Alberto",
""
],
[
"Roda",
"Fabio",
""
]
] | TITLE: Recommender Systems by means of Information Retrieval
ABSTRACT: In this paper we present a method for reformulating the Recommender Systems
problem in an Information Retrieval one. In our tests we have a dataset of
users who give ratings for some movies; we hide some values from the dataset,
and we try to pr... |
1106.0357 | Mohamad Tarifi | Mohamad Tarifi, Meera Sitharam, Jeffery Ho | Learning Hierarchical Sparse Representations using Iterative Dictionary
Learning and Dimension Reduction | null | null | null | null | cs.LG cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces an elemental building block which combines Dictionary
Learning and Dimension Reduction (DRDL). We show how this foundational element
can be used to iteratively construct a Hierarchical Sparse Representation (HSR)
of a sensory stream. We compare our approach to existing models showing the
general... | [
{
"version": "v1",
"created": "Thu, 2 Jun 2011 02:31:04 GMT"
}
] | 2011-06-03T00:00:00 | [
[
"Tarifi",
"Mohamad",
""
],
[
"Sitharam",
"Meera",
""
],
[
"Ho",
"Jeffery",
""
]
] | TITLE: Learning Hierarchical Sparse Representations using Iterative Dictionary
Learning and Dimension Reduction
ABSTRACT: This paper introduces an elemental building block which combines Dictionary
Learning and Dimension Reduction (DRDL). We show how this foundational element
can be used to iteratively construct ... |
1106.0219 | C. E. Brodley | C. E. Brodley, M. A. Friedl | Identifying Mislabeled Training Data | null | Journal Of Artificial Intelligence Research, Volume 11, pages
131-167, 1999 | 10.1613/jair.606 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a new approach to identifying and eliminating mislabeled
training instances for supervised learning. The goal of this approach is to
improve classification accuracies produced by learning algorithms by improving
the quality of the training data. Our approach uses a set of learning
algorithms to cr... | [
{
"version": "v1",
"created": "Wed, 1 Jun 2011 16:15:28 GMT"
}
] | 2011-06-02T00:00:00 | [
[
"Brodley",
"C. E.",
""
],
[
"Friedl",
"M. A.",
""
]
] | TITLE: Identifying Mislabeled Training Data
ABSTRACT: This paper presents a new approach to identifying and eliminating mislabeled
training instances for supervised learning. The goal of this approach is to
improve classification accuracies produced by learning algorithms by improving
the quality of the training da... |
1105.6118 | Amani Tahat | Amani Tahat, Maurice HT Ling | Mapping Relational Operations onto Hypergraph Model | 21 pages | The Python Papers 6(1): 4,2011 | null | null | cs.DB cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The relational model is the most commonly used data model for storing large
datasets, perhaps due to the simplicity of the tabular format which had
revolutionized database management systems. However, many real world objects
are recursive and associative in nature which makes storage in the relational
model difficult... | [
{
"version": "v1",
"created": "Mon, 30 May 2011 21:34:51 GMT"
}
] | 2011-06-01T00:00:00 | [
[
"Tahat",
"Amani",
""
],
[
"Ling",
"Maurice HT",
""
]
] | TITLE: Mapping Relational Operations onto Hypergraph Model
ABSTRACT: The relational model is the most commonly used data model for storing large
datasets, perhaps due to the simplicity of the tabular format which had
revolutionized database management systems. However, many real world objects
are recursive and asso... |
1105.4151 | Gautam Thakur | Gautam S. Thakur, Pan Hui, Hamed Ketabdar, Ahmed Helmy | Towards Realistic Vehicular Network Modeling Using Planet-scale Public
Webcams | null | null | null | null | cs.NI stat.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Realistic modeling of vehicular mobility has been particularly challenging
due to a lack of large libraries of measurements in the research community. In
this paper we introduce a novel method for large-scale monitoring, analysis,
and identification of spatio-temporal models for vehicular mobility using the
freely av... | [
{
"version": "v1",
"created": "Thu, 19 May 2011 12:36:46 GMT"
}
] | 2011-05-26T00:00:00 | [
[
"Thakur",
"Gautam S.",
""
],
[
"Hui",
"Pan",
""
],
[
"Ketabdar",
"Hamed",
""
],
[
"Helmy",
"Ahmed",
""
]
] | TITLE: Towards Realistic Vehicular Network Modeling Using Planet-scale Public
Webcams
ABSTRACT: Realistic modeling of vehicular mobility has been particularly challenging
due to a lack of large libraries of measurements in the research community. In
this paper we introduce a novel method for large-scale monitorin... |
1105.4256 | Gianmarco De Francisci Morales | Gianmarco De Francisci Morales (IMT Lucca), Aristides Gionis (Yahoo!
Research), Mauro Sozio (MPI Saarbruecken) | Social content matching in MapReduce | VLDB2011 | Proceedings of the VLDB Endowment (PVLDB), Vol. 4, No. 7, pp.
460-469 (2011) | null | null | cs.SI cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Matching problems are ubiquitous. They occur in economic markets, labor
markets, internet advertising, and elsewhere. In this paper we focus on an
application of matching for social media. Our goal is to distribute content
from information suppliers to information consumers. We seek to maximize the
overall relevance ... | [
{
"version": "v1",
"created": "Sat, 21 May 2011 12:11:12 GMT"
}
] | 2011-05-24T00:00:00 | [
[
"Morales",
"Gianmarco De Francisci",
"",
"IMT Lucca"
],
[
"Gionis",
"Aristides",
"",
"Yahoo!\n Research"
],
[
"Sozio",
"Mauro",
"",
"MPI Saarbruecken"
]
] | TITLE: Social content matching in MapReduce
ABSTRACT: Matching problems are ubiquitous. They occur in economic markets, labor
markets, internet advertising, and elsewhere. In this paper we focus on an
application of matching for social media. Our goal is to distribute content
from information suppliers to informati... |
1105.4004 | Miguel A. Martinez-Prieto | Sandra \'Alvarez-Garc\'ia and Nieves R. Brisaboa and Javier D.
Fern\'andez and Miguel A. Mart\'inez-Prieto | Compressed k2-Triples for Full-In-Memory RDF Engines | In Proc. of AMCIS'2011 | null | null | null | cs.IR cs.DB | http://creativecommons.org/licenses/by/3.0/ | Current "data deluge" has flooded the Web of Data with very large RDF
datasets. They are hosted and queried through SPARQL endpoints which act as
nodes of a semantic net built on the principles of the Linked Data project.
Although this is a realistic philosophy for global data publishing, its query
performance is dim... | [
{
"version": "v1",
"created": "Fri, 20 May 2011 02:11:20 GMT"
}
] | 2011-05-23T00:00:00 | [
[
"Álvarez-García",
"Sandra",
""
],
[
"Brisaboa",
"Nieves R.",
""
],
[
"Fernández",
"Javier D.",
""
],
[
"Martínez-Prieto",
"Miguel A.",
""
]
] | TITLE: Compressed k2-Triples for Full-In-Memory RDF Engines
ABSTRACT: Current "data deluge" has flooded the Web of Data with very large RDF
datasets. They are hosted and queried through SPARQL endpoints which act as
nodes of a semantic net built on the principles of the Linked Data project.
Although this is a reali... |
1105.3882 | Paolo Bajardi | Paolo Bajardi, Alain Barrat, Fabrizio Natale, Lara Savini, Vittoria
Colizza | Dynamical Patterns of Cattle Trade Movements | null | PLoS ONE 6(5): e19869(2011) | 10.1371/journal.pone.0019869 | null | physics.soc-ph cond-mat.stat-mech q-bio.PE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite their importance for the spread of zoonotic diseases, our
understanding of the dynamical aspects characterizing the movements of farmed
animal populations remains limited as these systems are traditionally studied
as static objects and through simplified approximations. By leveraging on the
network science ap... | [
{
"version": "v1",
"created": "Thu, 19 May 2011 14:25:39 GMT"
}
] | 2011-05-20T00:00:00 | [
[
"Bajardi",
"Paolo",
""
],
[
"Barrat",
"Alain",
""
],
[
"Natale",
"Fabrizio",
""
],
[
"Savini",
"Lara",
""
],
[
"Colizza",
"Vittoria",
""
]
] | TITLE: Dynamical Patterns of Cattle Trade Movements
ABSTRACT: Despite their importance for the spread of zoonotic diseases, our
understanding of the dynamical aspects characterizing the movements of farmed
animal populations remains limited as these systems are traditionally studied
as static objects and through si... |
1105.3685 | Afzal Godil | Afzal Godil, Zhouhui Lian, Helin Dutagaci, Rui Fang, Vanamali T.P.,
Chun Pan Cheung | Benchmarks, Performance Evaluation and Contests for 3D Shape Retrieval | Performance Metrics for Intelligent Systems (PerMIS'10) Workshop,
September, 2010 | null | null | null | cs.CV cs.CG | http://creativecommons.org/licenses/publicdomain/ | Benchmarking of 3D Shape retrieval allows developers and researchers to
compare the strengths of different algorithms on a standard dataset. Here we
describe the procedures involved in developing a benchmark and issues involved.
We then discuss some of the current 3D shape retrieval benchmarks efforts of
our group an... | [
{
"version": "v1",
"created": "Wed, 18 May 2011 16:48:47 GMT"
}
] | 2011-05-19T00:00:00 | [
[
"Godil",
"Afzal",
""
],
[
"Lian",
"Zhouhui",
""
],
[
"Dutagaci",
"Helin",
""
],
[
"Fang",
"Rui",
""
],
[
"P.",
"Vanamali T.",
""
],
[
"Cheung",
"Chun Pan",
""
]
] | TITLE: Benchmarks, Performance Evaluation and Contests for 3D Shape Retrieval
ABSTRACT: Benchmarking of 3D Shape retrieval allows developers and researchers to
compare the strengths of different algorithms on a standard dataset. Here we
describe the procedures involved in developing a benchmark and issues involved.... |
1105.2797 | Afzal Godil | Afzal Godil, Sandy Ressler and Patrick Grother | Face Recognition using 3D Facial Shape and Color Map Information:
Comparison and Combination | Proceedings of SPIE Vol. 5404 Biometric Technology for Human
Identification, Anil K. Jain; Nalini K. Ratha, Editors, pp.351-361, ISBN:
9780819453273 Date: 25 August 2004 | null | 10.1117/12.540754 | null | cs.CV | http://creativecommons.org/licenses/publicdomain/ | In this paper, we investigate the use of 3D surface geometry for face
recognition and compare it to one based on color map information. The 3D
surface and color map data are from the CAESAR anthropometric database. We find
that the recognition performance is not very different between 3D surface and
color map informa... | [
{
"version": "v1",
"created": "Fri, 13 May 2011 18:25:28 GMT"
}
] | 2011-05-16T00:00:00 | [
[
"Godil",
"Afzal",
""
],
[
"Ressler",
"Sandy",
""
],
[
"Grother",
"Patrick",
""
]
] | TITLE: Face Recognition using 3D Facial Shape and Color Map Information:
Comparison and Combination
ABSTRACT: In this paper, we investigate the use of 3D surface geometry for face
recognition and compare it to one based on color map information. The 3D
surface and color map data are from the CAESAR anthropometric... |
1012.5815 | Tamal Ghosh Tamal Ghosh | Tamal Ghosh, Mousumi Modak and Pranab K Dan | SAPFOCS: a metaheuristic based approach to part family formation
problems in group technology | 10 pages; 6 figures; 12 tables | nternational Journal of Management Science International Journal
of Management Science and Engineering Management, 6(3): 231-240, 2011 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This article deals with Part family formation problem which is believed to be
moderately complicated to be solved in polynomial time in the vicinity of Group
Technology (GT). In the past literature researchers investigated that the part
family formation techniques are principally based on production flow analysis
(PF... | [
{
"version": "v1",
"created": "Tue, 28 Dec 2010 18:57:04 GMT"
},
{
"version": "v2",
"created": "Wed, 11 May 2011 07:18:26 GMT"
}
] | 2011-05-12T00:00:00 | [
[
"Ghosh",
"Tamal",
""
],
[
"Modak",
"Mousumi",
""
],
[
"Dan",
"Pranab K",
""
]
] | TITLE: SAPFOCS: a metaheuristic based approach to part family formation
problems in group technology
ABSTRACT: This article deals with Part family formation problem which is believed to be
moderately complicated to be solved in polynomial time in the vicinity of Group
Technology (GT). In the past literature resea... |
1105.1926 | G\'abor Bortel | G\'abor Bortel, Mikl\'os Tegze | Common Arc Method for Diffraction Pattern Orientation | 16 pages, 10 figures | null | null | null | physics.data-an | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Very short pulses of x-ray free-electron lasers opened the way to obtain
diffraction signal from single particles beyond the radiation dose limit. For
3D structure reconstruction many patterns are recorded in the object's unknown
orientation. We describe a method for orientation of continuous diffraction
patterns of ... | [
{
"version": "v1",
"created": "Tue, 10 May 2011 12:15:44 GMT"
}
] | 2011-05-11T00:00:00 | [
[
"Bortel",
"Gábor",
""
],
[
"Tegze",
"Miklós",
""
]
] | TITLE: Common Arc Method for Diffraction Pattern Orientation
ABSTRACT: Very short pulses of x-ray free-electron lasers opened the way to obtain
diffraction signal from single particles beyond the radiation dose limit. For
3D structure reconstruction many patterns are recorded in the object's unknown
orientation. We... |
0809.0490 | Alexander Gorban | A. N. Gorban, A. Y. Zinovyev | Principal Graphs and Manifolds | 36 pages, 6 figures, minor corrections | Handbook of Research on Machine Learning Applications and Trends:
Algorithms, Methods and Techniques, Ch. 2, Information Science Reference,
2009. 28-59 | 10.4018/978-1-60566-766-9 | null | cs.LG cs.NE stat.ML | http://creativecommons.org/licenses/by/3.0/ | In many physical, statistical, biological and other investigations it is
desirable to approximate a system of points by objects of lower dimension
and/or complexity. For this purpose, Karl Pearson invented principal component
analysis in 1901 and found 'lines and planes of closest fit to system of
points'. The famous... | [
{
"version": "v1",
"created": "Tue, 2 Sep 2008 18:04:53 GMT"
},
{
"version": "v2",
"created": "Mon, 9 May 2011 13:23:08 GMT"
}
] | 2011-05-10T00:00:00 | [
[
"Gorban",
"A. N.",
""
],
[
"Zinovyev",
"A. Y.",
""
]
] | TITLE: Principal Graphs and Manifolds
ABSTRACT: In many physical, statistical, biological and other investigations it is
desirable to approximate a system of points by objects of lower dimension
and/or complexity. For this purpose, Karl Pearson invented principal component
analysis in 1901 and found 'lines and plan... |
1009.5168 | Konstantin Voevodski | Konstantin Voevodski, Maria-Florina Balcan, Heiko Roglin, Shang-Hua
Teng, Yu Xia | Efficient Clustering with Limited Distance Information | Full version of UAI 2010 paper | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a point set S and an unknown metric d on S, we study the problem of
efficiently partitioning S into k clusters while querying few distances between
the points. In our model we assume that we have access to one versus all
queries that given a point s in S return the distances between s and all other
points. We s... | [
{
"version": "v1",
"created": "Mon, 27 Sep 2010 06:29:35 GMT"
},
{
"version": "v2",
"created": "Mon, 9 May 2011 04:03:47 GMT"
}
] | 2011-05-10T00:00:00 | [
[
"Voevodski",
"Konstantin",
""
],
[
"Balcan",
"Maria-Florina",
""
],
[
"Roglin",
"Heiko",
""
],
[
"Teng",
"Shang-Hua",
""
],
[
"Xia",
"Yu",
""
]
] | TITLE: Efficient Clustering with Limited Distance Information
ABSTRACT: Given a point set S and an unknown metric d on S, we study the problem of
efficiently partitioning S into k clusters while querying few distances between
the points. In our model we assume that we have access to one versus all
queries that give... |
1011.4632 | Christos Boutsidis | Christos Boutsidis, Anastasios Zouzias, Petros Drineas | Random Projections for $k$-means Clustering | Neural Information Processing Systems (NIPS) 2010 | null | null | null | cs.AI cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper discusses the topic of dimensionality reduction for $k$-means
clustering. We prove that any set of $n$ points in $d$ dimensions (rows in a
matrix $A \in \RR^{n \times d}$) can be projected into $t = \Omega(k / \eps^2)$
dimensions, for any $\eps \in (0,1/3)$, in $O(n d \lceil \eps^{-2} k/ \log(d)
\rceil )$ ... | [
{
"version": "v1",
"created": "Sun, 21 Nov 2010 02:37:10 GMT"
}
] | 2011-05-05T00:00:00 | [
[
"Boutsidis",
"Christos",
""
],
[
"Zouzias",
"Anastasios",
""
],
[
"Drineas",
"Petros",
""
]
] | TITLE: Random Projections for $k$-means Clustering
ABSTRACT: This paper discusses the topic of dimensionality reduction for $k$-means
clustering. We prove that any set of $n$ points in $d$ dimensions (rows in a
matrix $A \in \RR^{n \times d}$) can be projected into $t = \Omega(k / \eps^2)$
dimensions, for any $\eps... |
1012.2363 | Santo Fortunato Dr | Andrea Lancichinetti, Filippo Radicchi, Jose' Javier Ramasco, Santo
Fortunato | Finding statistically significant communities in networks | 24 pages, 25 figures, 1 table. Final version published in PLoS One.
The code of OSLOM is freely available at http://www.oslom.org | PLoS One 6(4), e18961 (2011) | 10.1371/journal.pone.0018961 | null | physics.soc-ph cs.IR cs.SI q-bio.QM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Community structure is one of the main structural features of networks,
revealing both their internal organization and the similarity of their
elementary units. Despite the large variety of methods proposed to detect
communities in graphs, there is a big need for multi-purpose techniques, able
to handle different typ... | [
{
"version": "v1",
"created": "Fri, 10 Dec 2010 19:52:21 GMT"
},
{
"version": "v2",
"created": "Wed, 4 May 2011 16:00:19 GMT"
}
] | 2011-05-05T00:00:00 | [
[
"Lancichinetti",
"Andrea",
""
],
[
"Radicchi",
"Filippo",
""
],
[
"Ramasco",
"Jose' Javier",
""
],
[
"Fortunato",
"Santo",
""
]
] | TITLE: Finding statistically significant communities in networks
ABSTRACT: Community structure is one of the main structural features of networks,
revealing both their internal organization and the similarity of their
elementary units. Despite the large variety of methods proposed to detect
communities in graphs, t... |
1105.0673 | Cristian Danescu-Niculescu-Mizil | Cristian Danescu-Niculescu-Mizil, Michael Gamon, Susan Dumais | Mark My Words! Linguistic Style Accommodation in Social Media | Talk slides available at http://www.cs.cornell.edu/~cristian/www2011 | Proceedings of WWW, pp. 141--150, 2009 | 10.1145/1963405.1963509 | null | cs.CL cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The psycholinguistic theory of communication accommodation accounts for the
general observation that participants in conversations tend to converge to one
another's communicative behavior: they coordinate in a variety of dimensions
including choice of words, syntax, utterance length, pitch and gestures. In its
almost... | [
{
"version": "v1",
"created": "Tue, 3 May 2011 20:00:05 GMT"
}
] | 2011-05-05T00:00:00 | [
[
"Danescu-Niculescu-Mizil",
"Cristian",
""
],
[
"Gamon",
"Michael",
""
],
[
"Dumais",
"Susan",
""
]
] | TITLE: Mark My Words! Linguistic Style Accommodation in Social Media
ABSTRACT: The psycholinguistic theory of communication accommodation accounts for the
general observation that participants in conversations tend to converge to one
another's communicative behavior: they coordinate in a variety of dimensions
inclu... |
1105.0470 | Jai Sukhatme | Jai Sukhatme and William R. Young | The advection-condensation model and water vapour PDFs | 13 pages, 8 figures, submitted to QJRMS | null | null | null | physics.flu-dyn physics.ao-ph physics.data-an | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The statistically steady humidity distribution resulting from an interaction
of advection, modeled as an uncorrelated random walk of moist parcels on an
isentropic surface, and a vapour sink, modeled as immediate condensation
whenever the specific humidity exceeds a specified saturation humidity, is
explored with the... | [
{
"version": "v1",
"created": "Tue, 3 May 2011 03:13:07 GMT"
}
] | 2011-05-04T00:00:00 | [
[
"Sukhatme",
"Jai",
""
],
[
"Young",
"William R.",
""
]
] | TITLE: The advection-condensation model and water vapour PDFs
ABSTRACT: The statistically steady humidity distribution resulting from an interaction
of advection, modeled as an uncorrelated random walk of moist parcels on an
isentropic surface, and a vapour sink, modeled as immediate condensation
whenever the speci... |
1104.4605 | Xiaoye Jiang | Xiaoye Jiang and Yuan Yao and Han Liu and Leonidas Guibas | Compressive Network Analysis | null | null | null | null | stat.ML cs.DM cs.LG cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modern data acquisition routinely produces massive amounts of network data.
Though many methods and models have been proposed to analyze such data, the
research of network data is largely disconnected with the classical theory of
statistical learning and signal processing. In this paper, we present a new
framework fo... | [
{
"version": "v1",
"created": "Sun, 24 Apr 2011 06:06:12 GMT"
}
] | 2011-04-26T00:00:00 | [
[
"Jiang",
"Xiaoye",
""
],
[
"Yao",
"Yuan",
""
],
[
"Liu",
"Han",
""
],
[
"Guibas",
"Leonidas",
""
]
] | TITLE: Compressive Network Analysis
ABSTRACT: Modern data acquisition routinely produces massive amounts of network data.
Though many methods and models have been proposed to analyze such data, the
research of network data is largely disconnected with the classical theory of
statistical learning and signal processi... |
1104.4153 | Salah Rifai | Salah Rifai, Xavier Muller, Xavier Glorot, Gregoire Mesnil, Yoshua
Bengio and Pascal Vincent | Learning invariant features through local space contraction | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present in this paper a novel approach for training deterministic
auto-encoders. We show that by adding a well chosen penalty term to the
classical reconstruction cost function, we can achieve results that equal or
surpass those attained by other regularized auto-encoders as well as denoising
auto-encoders on a ra... | [
{
"version": "v1",
"created": "Thu, 21 Apr 2011 01:39:25 GMT"
}
] | 2011-04-22T00:00:00 | [
[
"Rifai",
"Salah",
""
],
[
"Muller",
"Xavier",
""
],
[
"Glorot",
"Xavier",
""
],
[
"Mesnil",
"Gregoire",
""
],
[
"Bengio",
"Yoshua",
""
],
[
"Vincent",
"Pascal",
""
]
] | TITLE: Learning invariant features through local space contraction
ABSTRACT: We present in this paper a novel approach for training deterministic
auto-encoders. We show that by adding a well chosen penalty term to the
classical reconstruction cost function, we can achieve results that equal or
surpass those attaine... |
1104.4038 | Guido Boffetta | G. Boffetta | El Nino signature in Alaskan river breakups | 4 pages, 2 figures; never able to publish | null | null | null | physics.geo-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A signature of El Nino-Southern Oscillation is found in the historical
dataset of the Alaskan Tanana river breakups where the average ice breaking day
is found to anticipate of about 3.4 days when conditioned over El Nino years.
This results represents a statistically significant example of ENSO
teleconnection on reg... | [
{
"version": "v1",
"created": "Wed, 20 Apr 2011 14:36:30 GMT"
}
] | 2011-04-21T00:00:00 | [
[
"Boffetta",
"G.",
""
]
] | TITLE: El Nino signature in Alaskan river breakups
ABSTRACT: A signature of El Nino-Southern Oscillation is found in the historical
dataset of the Alaskan Tanana river breakups where the average ice breaking day
is found to anticipate of about 3.4 days when conditioned over El Nino years.
This results represents a ... |
1104.3216 | Feng Niu | Feng Niu (University of Wisconsin-Madison), Christopher R\'e
(University of Wisconsin-Madison), AnHai Doan (University of
Wisconsin-Madison), Jude Shavlik (University of Wisconsin-Madison) | Tuffy: Scaling up Statistical Inference in Markov Logic Networks using
an RDBMS | VLDB2011 | Proceedings of the VLDB Endowment (PVLDB), Vol. 4, No. 6, pp.
373-384 (2011) | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Markov Logic Networks (MLNs) have emerged as a powerful framework that
combines statistical and logical reasoning; they have been applied to many data
intensive problems including information extraction, entity resolution, and
text mining. Current implementations of MLNs do not scale to large real-world
data sets, wh... | [
{
"version": "v1",
"created": "Sat, 16 Apr 2011 08:52:25 GMT"
}
] | 2011-04-19T00:00:00 | [
[
"Niu",
"Feng",
"",
"University of Wisconsin-Madison"
],
[
"Ré",
"Christopher",
"",
"University of Wisconsin-Madison"
],
[
"Doan",
"AnHai",
"",
"University of\n Wisconsin-Madison"
],
[
"Shavlik",
"Jude",
"",
"University of Wisconsin-Madis... | TITLE: Tuffy: Scaling up Statistical Inference in Markov Logic Networks using
an RDBMS
ABSTRACT: Markov Logic Networks (MLNs) have emerged as a powerful framework that
combines statistical and logical reasoning; they have been applied to many data
intensive problems including information extraction, entity resolu... |
1104.1892 | Kallam Suresh | K. Suresh | "Improved FCM algorithm for Clustering on Web Usage Mining" | ISSN(Online):1694-0814.
http://www.ijcsi.org/papers/IJCSI-8-1-42-45.pdf | IJCSI International Journal of Computer Sciencec Issues, Vol.8
Issue 1, January 2011, p42-46 | null | null | cs.IR cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we present clustering method is very sensitive to the initial
center values, requirements on the data set too high, and cannot handle noisy
data the proposal method is using information entropy to initialize the cluster
centers and introduce weighting parameters to adjust the location of cluster
centers... | [
{
"version": "v1",
"created": "Mon, 11 Apr 2011 09:38:47 GMT"
}
] | 2011-04-12T00:00:00 | [
[
"Suresh",
"K.",
""
]
] | TITLE: "Improved FCM algorithm for Clustering on Web Usage Mining"
ABSTRACT: In this paper we present clustering method is very sensitive to the initial
center values, requirements on the data set too high, and cannot handle noisy
data the proposal method is using information entropy to initialize the cluster
cente... |
1103.0120 | Srimanta Kundu | Srimanta Kundu (1), Nibaran Das and Mita Nasipuri | Automatic Detection of Ringworm using Local Binary Pattern (LBP) | International Symposium on Medical Imaging: Perspectives on
Perception and Diagnostics (MED-IMAGE 2010) organized in conjunction with the
Seventh Indian Conference on Computer Vision, Graphics and Image Processing
(ICVGIP), 9-10th December, 2010 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we present a novel approach for automatic recognition of ring
worm skin disease based on LBP (Local Binary Pattern) feature extracted from
the affected skin images. The proposed method is evaluated by extensive
experiments on the skin images collected from internet. The dataset is tested
using three dif... | [
{
"version": "v1",
"created": "Tue, 1 Mar 2011 10:06:31 GMT"
},
{
"version": "v2",
"created": "Sun, 3 Apr 2011 20:04:52 GMT"
}
] | 2011-04-05T00:00:00 | [
[
"Kundu",
"Srimanta",
""
],
[
"Das",
"Nibaran",
""
],
[
"Nasipuri",
"Mita",
""
]
] | TITLE: Automatic Detection of Ringworm using Local Binary Pattern (LBP)
ABSTRACT: In this paper we present a novel approach for automatic recognition of ring
worm skin disease based on LBP (Local Binary Pattern) feature extracted from
the affected skin images. The proposed method is evaluated by extensive
experimen... |
1104.0579 | Michael Lew | Ye Ji | Image Retrieval Method Using Top-surf Descriptor | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This report presents the results and details of a content-based image
retrieval project using the Top-surf descriptor. The experimental results are
preliminary, however, it shows the capability of deducing objects from parts of
the objects or from the objects that are similar. This paper uses a dataset
consisting of ... | [
{
"version": "v1",
"created": "Mon, 4 Apr 2011 14:14:47 GMT"
}
] | 2011-04-05T00:00:00 | [
[
"Ji",
"Ye",
""
]
] | TITLE: Image Retrieval Method Using Top-surf Descriptor
ABSTRACT: This report presents the results and details of a content-based image
retrieval project using the Top-surf descriptor. The experimental results are
preliminary, however, it shows the capability of deducing objects from parts of
the objects or from th... |
1102.4016 | Gunnar W. Klau | Sandro Andreotti, Gunnar W. Klau, Knut Reinert | Antilope - A Lagrangian Relaxation Approach to the de novo Peptide
Sequencing Problem | null | null | 10.1109/TCBB.2011.59 | null | cs.DS q-bio.QM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Peptide sequencing from mass spectrometry data is a key step in proteome
research. Especially de novo sequencing, the identification of a peptide from
its spectrum alone, is still a challenge even for state-of-the-art algorithmic
approaches. In this paper we present Antilope, a new fast and flexible approach
based on... | [
{
"version": "v1",
"created": "Sat, 19 Feb 2011 19:36:34 GMT"
}
] | 2011-03-29T00:00:00 | [
[
"Andreotti",
"Sandro",
""
],
[
"Klau",
"Gunnar W.",
""
],
[
"Reinert",
"Knut",
""
]
] | TITLE: Antilope - A Lagrangian Relaxation Approach to the de novo Peptide
Sequencing Problem
ABSTRACT: Peptide sequencing from mass spectrometry data is a key step in proteome
research. Especially de novo sequencing, the identification of a peptide from
its spectrum alone, is still a challenge even for state-of-t... |
1103.4896 | Hugo Larochelle | J\'er\^ome Louradour and Hugo Larochelle | Classification of Sets using Restricted Boltzmann Machines | 17 pages, 4 figures | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of classification when inputs correspond to sets of
vectors. This setting occurs in many problems such as the classification of
pieces of mail containing several pages, of web sites with several sections or
of images that have been pre-segmented into smaller regions. We propose
generalizations... | [
{
"version": "v1",
"created": "Fri, 25 Mar 2011 02:33:27 GMT"
}
] | 2011-03-28T00:00:00 | [
[
"Louradour",
"Jérôme",
""
],
[
"Larochelle",
"Hugo",
""
]
] | TITLE: Classification of Sets using Restricted Boltzmann Machines
ABSTRACT: We consider the problem of classification when inputs correspond to sets of
vectors. This setting occurs in many problems such as the classification of
pieces of mail containing several pages, of web sites with several sections or
of images... |
1103.4778 | Jos\'e L Balc\'azar Navarro | Jos\'e L. Balc\'azar | Formal and Computational Properties of the Confidence Boost of
Association Rules | null | null | null | null | cs.DB cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Some existing notions of redundancy among association rules allow for a
logical-style characterization and lead to irredundant bases of absolutely
minimum size. One can push the intuition of redundancy further and find an
intuitive notion of interest of an association rule, in terms of its "novelty"
with respect to o... | [
{
"version": "v1",
"created": "Thu, 24 Mar 2011 14:45:50 GMT"
}
] | 2011-03-25T00:00:00 | [
[
"Balcázar",
"José L.",
""
]
] | TITLE: Formal and Computational Properties of the Confidence Boost of
Association Rules
ABSTRACT: Some existing notions of redundancy among association rules allow for a
logical-style characterization and lead to irredundant bases of absolutely
minimum size. One can push the intuition of redundancy further and fi... |
1103.4480 | Kishor Barman | Kishor Barman, Onkar Dabeer | Clustered regression with unknown clusters | 9 pages, Submitted to KDD 2011, San Diego | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a collection of prediction experiments, which are clustered in
the sense that groups of experiments ex- hibit similar relationship between the
predictor and response variables. The experiment clusters as well as the
regres- sion relationships are unknown. The regression relation- ships define
the experime... | [
{
"version": "v1",
"created": "Wed, 23 Mar 2011 10:20:14 GMT"
}
] | 2011-03-24T00:00:00 | [
[
"Barman",
"Kishor",
""
],
[
"Dabeer",
"Onkar",
""
]
] | TITLE: Clustered regression with unknown clusters
ABSTRACT: We consider a collection of prediction experiments, which are clustered in
the sense that groups of experiments ex- hibit similar relationship between the
predictor and response variables. The experiment clusters as well as the
regres- sion relationships a... |
1103.3103 | Mohamed Yakout | Mohamed Yakout (Purdue University), Ahmed K. Elmagarmid (Qatar
Computing Research Institute), Jennifer Neville (Purdue University), Mourad
Ouzzani (Purdue University), Ihab F. Ilyas (University of Waterloo) | Guided Data Repair | VLDB2011 | Proceedings of the VLDB Endowment (PVLDB), Vol. 4, No. 5, pp.
279-289 (2011) | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we present GDR, a Guided Data Repair framework that
incorporates user feedback in the cleaning process to enhance and accelerate
existing automatic repair techniques while minimizing user involvement. GDR
consults the user on the updates that are most likely to be beneficial in
improving data quality. G... | [
{
"version": "v1",
"created": "Wed, 16 Mar 2011 05:51:51 GMT"
}
] | 2011-03-17T00:00:00 | [
[
"Yakout",
"Mohamed",
"",
"Purdue University"
],
[
"Elmagarmid",
"Ahmed K.",
"",
"Qatar\n Computing Research Institute"
],
[
"Neville",
"Jennifer",
"",
"Purdue University"
],
[
"Ouzzani",
"Mourad",
"",
"Purdue University"
],
[
"Il... | TITLE: Guided Data Repair
ABSTRACT: In this paper we present GDR, a Guided Data Repair framework that
incorporates user feedback in the cleaning process to enhance and accelerate
existing automatic repair techniques while minimizing user involvement. GDR
consults the user on the updates that are most likely to be b... |
1103.2410 | Vibhor Rastogi | Vibhor Rastogi (Yahoo! Research), Nilesh Dalvi (Yahoo! Research),
Minos Garofalakis (Technical University of Crete) | Large-Scale Collective Entity Matching | VLDB2011 | Proceedings of the VLDB Endowment (PVLDB), Vol. 4, No. 4, pp.
208-218 (2011) | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There have been several recent advancements in Machine Learning community on
the Entity Matching (EM) problem. However, their lack of scalability has
prevented them from being applied in practical settings on large real-life
datasets. Towards this end, we propose a principled framework to scale any
generic EM algorit... | [
{
"version": "v1",
"created": "Sat, 12 Mar 2011 01:09:30 GMT"
}
] | 2011-03-15T00:00:00 | [
[
"Rastogi",
"Vibhor",
"",
"Yahoo! Research"
],
[
"Dalvi",
"Nilesh",
"",
"Yahoo! Research"
],
[
"Garofalakis",
"Minos",
"",
"Technical University of Crete"
]
] | TITLE: Large-Scale Collective Entity Matching
ABSTRACT: There have been several recent advancements in Machine Learning community on
the Entity Matching (EM) problem. However, their lack of scalability has
prevented them from being applied in practical settings on large real-life
datasets. Towards this end, we prop... |
1103.1777 | Jan Egger | Jan Egger, Miriam H. A. Bauer, Daniela Kuhnt, Christoph Kappus,
Barbara Carl, Bernd Freisleben, Christopher Nimsky | A Flexible Semi-Automatic Approach for Glioblastoma multiforme
Segmentation | 4 pages, 4 figures, BIOSIGNAL, Berlin, 2010 | null | null | null | cs.CE physics.med-ph q-bio.TO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Gliomas are the most common primary brain tumors, evolving from the cerebral
supportive cells. For clinical follow-up, the evaluation of the preoperative
tumor volume is essential. Volumetric assessment of tumor volume with manual
segmentation of its outlines is a time-consuming process that can be overcome
with the ... | [
{
"version": "v1",
"created": "Wed, 9 Mar 2011 13:27:22 GMT"
}
] | 2011-03-10T00:00:00 | [
[
"Egger",
"Jan",
""
],
[
"Bauer",
"Miriam H. A.",
""
],
[
"Kuhnt",
"Daniela",
""
],
[
"Kappus",
"Christoph",
""
],
[
"Carl",
"Barbara",
""
],
[
"Freisleben",
"Bernd",
""
],
[
"Nimsky",
"Christopher",
""
]
... | TITLE: A Flexible Semi-Automatic Approach for Glioblastoma multiforme
Segmentation
ABSTRACT: Gliomas are the most common primary brain tumors, evolving from the cerebral
supportive cells. For clinical follow-up, the evaluation of the preoperative
tumor volume is essential. Volumetric assessment of tumor volume wi... |
1103.0825 | Thanh Tran | Graham Cormode, Magda Procopiuc, Divesh Srivastava, Thanh T. L. Tran | Differentially Private Publication of Sparse Data | null | null | null | null | cs.DB | http://creativecommons.org/licenses/by-nc-sa/3.0/ | The problem of privately releasing data is to provide a version of a dataset
without revealing sensitive information about the individuals who contribute to
the data. The model of differential privacy allows such private release while
providing strong guarantees on the output. A basic mechanism achieves
differential ... | [
{
"version": "v1",
"created": "Fri, 4 Mar 2011 05:02:47 GMT"
}
] | 2011-03-07T00:00:00 | [
[
"Cormode",
"Graham",
""
],
[
"Procopiuc",
"Magda",
""
],
[
"Srivastava",
"Divesh",
""
],
[
"Tran",
"Thanh T. L.",
""
]
] | TITLE: Differentially Private Publication of Sparse Data
ABSTRACT: The problem of privately releasing data is to provide a version of a dataset
without revealing sensitive information about the individuals who contribute to
the data. The model of differential privacy allows such private release while
providing stro... |
1103.0102 | Dacheng Tao | Tianyi Zhou and Dacheng Tao | Multi-label Learning via Structured Decomposition and Group Sparsity | 13 pages, 3 tables | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by-nc-sa/3.0/ | In multi-label learning, each sample is associated with several labels.
Existing works indicate that exploring correlations between labels improve the
prediction performance. However, embedding the label correlations into the
training process significantly increases the problem size. Moreover, the
mapping of the labe... | [
{
"version": "v1",
"created": "Tue, 1 Mar 2011 08:15:28 GMT"
},
{
"version": "v2",
"created": "Thu, 3 Mar 2011 00:00:13 GMT"
}
] | 2011-03-04T00:00:00 | [
[
"Zhou",
"Tianyi",
""
],
[
"Tao",
"Dacheng",
""
]
] | TITLE: Multi-label Learning via Structured Decomposition and Group Sparsity
ABSTRACT: In multi-label learning, each sample is associated with several labels.
Existing works indicate that exploring correlations between labels improve the
prediction performance. However, embedding the label correlations into the
trai... |
1103.0086 | Xin Liu | Xin Liu and Gilles Tredan and Anwitaman Datta | A generic trust framework for large-scale open systems using machine
learning | 30 pages | null | null | null | cs.DC cs.CR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In many large scale distributed systems and on the web, agents need to
interact with other unknown agents to carry out some tasks or transactions. The
ability to reason about and assess the potential risks in carrying out such
transactions is essential for providing a safe and reliable environment. A
traditional appr... | [
{
"version": "v1",
"created": "Tue, 1 Mar 2011 06:03:15 GMT"
}
] | 2011-03-02T00:00:00 | [
[
"Liu",
"Xin",
""
],
[
"Tredan",
"Gilles",
""
],
[
"Datta",
"Anwitaman",
""
]
] | TITLE: A generic trust framework for large-scale open systems using machine
learning
ABSTRACT: In many large scale distributed systems and on the web, agents need to
interact with other unknown agents to carry out some tasks or transactions. The
ability to reason about and assess the potential risks in carrying o... |
1102.4770 | Juan Guan | Juan Guan, Bo Wang, and Steve Granick | Automated Line Tracking of lambda-DNA for Single-Molecule Imaging | null | null | null | null | physics.bio-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We describe a straightforward, automated line tracking method to visualize
within optical resolution the contour of linear macromolecules as they
rearrange shape as a function of time by Brownian diffusion and under external
fields such as electrophoresis. Three sequential stages of analysis underpin
this method: fir... | [
{
"version": "v1",
"created": "Wed, 23 Feb 2011 16:00:56 GMT"
}
] | 2011-02-24T00:00:00 | [
[
"Guan",
"Juan",
""
],
[
"Wang",
"Bo",
""
],
[
"Granick",
"Steve",
""
]
] | TITLE: Automated Line Tracking of lambda-DNA for Single-Molecule Imaging
ABSTRACT: We describe a straightforward, automated line tracking method to visualize
within optical resolution the contour of linear macromolecules as they
rearrange shape as a function of time by Brownian diffusion and under external
fields s... |
1102.4104 | Gang Fang | Gang Fang, Wen Wang, Benjamin Oatley, Brian Van Ness, Michael
Steinbach, Vipin Kumar | Characterizing Discriminative Patterns | null | null | null | null | cs.DB cs.IT math.IT q-bio.GN | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Discriminative patterns are association patterns that occur with
disproportionate frequency in some classes versus others, and have been studied
under names such as emerging patterns and contrast sets. Such patterns have
demonstrated considerable value for classification and subgroup discovery, but
a detailed underst... | [
{
"version": "v1",
"created": "Sun, 20 Feb 2011 21:34:52 GMT"
}
] | 2011-02-22T00:00:00 | [
[
"Fang",
"Gang",
""
],
[
"Wang",
"Wen",
""
],
[
"Oatley",
"Benjamin",
""
],
[
"Van Ness",
"Brian",
""
],
[
"Steinbach",
"Michael",
""
],
[
"Kumar",
"Vipin",
""
]
] | TITLE: Characterizing Discriminative Patterns
ABSTRACT: Discriminative patterns are association patterns that occur with
disproportionate frequency in some classes versus others, and have been studied
under names such as emerging patterns and contrast sets. Such patterns have
demonstrated considerable value for cla... |
1102.3828 | Herve Jegou | Herv\'e J\'egou (INRIA - IRISA), Romain Tavenard (INRIA - IRISA),
Matthijs Douze (INRIA Rh\^one-Alpes / LJK Laboratoire Jean Kuntzmann, SED),
Laurent Amsaleg (INRIA - IRISA) | Searching in one billion vectors: re-rank with source coding | International Conference on Acoustics, Speech and Signal Processing,
Prague : Czech Republic (2011) | null | null | null | cs.IR cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent indexing techniques inspired by source coding have been shown
successful to index billions of high-dimensional vectors in memory. In this
paper, we propose an approach that re-ranks the neighbor hypotheses obtained by
these compressed-domain indexing methods. In contrast to the usual
post-verification scheme, ... | [
{
"version": "v1",
"created": "Fri, 18 Feb 2011 13:15:37 GMT"
}
] | 2011-02-21T00:00:00 | [
[
"Jégou",
"Hervé",
"",
"INRIA - IRISA"
],
[
"Tavenard",
"Romain",
"",
"INRIA - IRISA"
],
[
"Douze",
"Matthijs",
"",
"INRIA Rhône-Alpes / LJK Laboratoire Jean Kuntzmann, SED"
],
[
"Amsaleg",
"Laurent",
"",
"INRIA - IRISA"
]
] | TITLE: Searching in one billion vectors: re-rank with source coding
ABSTRACT: Recent indexing techniques inspired by source coding have been shown
successful to index billions of high-dimensional vectors in memory. In this
paper, we propose an approach that re-ranks the neighbor hypotheses obtained by
these compres... |
1102.2915 | Filippo Utro | Filippo Utro | Algorithms for Internal Validation Clustering Measures in the Post
Genomic Era | null | PhD Thesis, University of Palermo, Italy, 2011 | null | null | cs.DS q-bio.QM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Inferring cluster structure in microarray datasets is a fundamental task for
the -omic sciences. A fundamental question in Statistics, Data Analysis and
Classification, is the prediction of the number of clusters in a dataset,
usually established via internal validation measures. Despite the wealth of
internal measur... | [
{
"version": "v1",
"created": "Mon, 14 Feb 2011 22:13:47 GMT"
}
] | 2011-02-16T00:00:00 | [
[
"Utro",
"Filippo",
""
]
] | TITLE: Algorithms for Internal Validation Clustering Measures in the Post
Genomic Era
ABSTRACT: Inferring cluster structure in microarray datasets is a fundamental task for
the -omic sciences. A fundamental question in Statistics, Data Analysis and
Classification, is the prediction of the number of clusters in a ... |
1102.3047 | Loet Leydesdorff | Robert D. Shelton and Loet Leydesdorff | Publish or Patent: Bibliometric evidence for empirical trade-offs in
national funding strategies | null | null | null | null | cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multivariate linear regression models suggest a trade-off in allocations of
national R&D investments. Government funding, and spending in the higher
education sector, seem to encourage publications, whereas other components such
as industrial funding, and spending in the business sector, encourage
patenting. Our resu... | [
{
"version": "v1",
"created": "Tue, 15 Feb 2011 12:27:59 GMT"
}
] | 2011-02-16T00:00:00 | [
[
"Shelton",
"Robert D.",
""
],
[
"Leydesdorff",
"Loet",
""
]
] | TITLE: Publish or Patent: Bibliometric evidence for empirical trade-offs in
national funding strategies
ABSTRACT: Multivariate linear regression models suggest a trade-off in allocations of
national R&D investments. Government funding, and spending in the higher
education sector, seem to encourage publications, w... |
1102.2878 | Dongryeol Lee | Dongryeol Lee, Alexander G. Gray, and Andrew W. Moore | Dual-Tree Fast Gauss Transforms | Extended version of a conference paper. Submitted to a journal | null | null | null | stat.CO cs.DS stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Kernel density estimation (KDE) is a popular statistical technique for
estimating the underlying density distribution with minimal assumptions.
Although they can be shown to achieve asymptotic estimation optimality for any
input distribution, cross-validating for an optimal parameter requires
significant computation ... | [
{
"version": "v1",
"created": "Mon, 14 Feb 2011 20:24:01 GMT"
}
] | 2011-02-15T00:00:00 | [
[
"Lee",
"Dongryeol",
""
],
[
"Gray",
"Alexander G.",
""
],
[
"Moore",
"Andrew W.",
""
]
] | TITLE: Dual-Tree Fast Gauss Transforms
ABSTRACT: Kernel density estimation (KDE) is a popular statistical technique for
estimating the underlying density distribution with minimal assumptions.
Although they can be shown to achieve asymptotic estimation optimality for any
input distribution, cross-validating for an ... |
1010.2225 | Jere Jenkins | P.A. Sturrock, J.B. Buncher, E. Fischbach, J.T. Gruenwald, D. Javorsek
II, J.H. Jenkins, R.H. Lee, J.J. Mattes, J.R. Newport | Power Spectrum Analysis of Physikalisch-Technische Bundesanstalt
Decay-Rate Data: Evidence for Solar Rotational Modulation | 15 pages, 13 figures | Solar Physics, 2010. 267(2): p. 251-265 | 10.1007/s11207-010-9659-4 | null | astro-ph.SR nucl-ex physics.ins-det | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Evidence for an anomalous annual periodicity in certain nuclear decay data
has led to speculation concerning a possible solar influence on nuclear
processes. We have recently analyzed data concerning the decay rates of Cl-36
and Si-32, acquired at the Brookhaven National Laboratory (BNL), to search for
evidence that ... | [
{
"version": "v1",
"created": "Mon, 11 Oct 2010 20:32:52 GMT"
}
] | 2011-02-08T00:00:00 | [
[
"Sturrock",
"P. A.",
""
],
[
"Buncher",
"J. B.",
""
],
[
"Fischbach",
"E.",
""
],
[
"Gruenwald",
"J. T.",
""
],
[
"Javorsek",
"D.",
"II"
],
[
"Jenkins",
"J. H.",
""
],
[
"Lee",
"R. H.",
""
],
[
"Mat... | TITLE: Power Spectrum Analysis of Physikalisch-Technische Bundesanstalt
Decay-Rate Data: Evidence for Solar Rotational Modulation
ABSTRACT: Evidence for an anomalous annual periodicity in certain nuclear decay data
has led to speculation concerning a possible solar influence on nuclear
processes. We have recently... |
0907.3874 | Nikolaos Laoutaris | Ruben Cuevas, Nikolaos Laoutaris, Xiaoyuan Yang, Georgos Siganos,
Pablo Rodriguez | Deep Diving into BitTorrent Locality | Please cite the conference version of this paper appearing in the
Proceedings of IEEE INFOCOM'11 | null | null | null | cs.NI cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A substantial amount of work has recently gone into localizing BitTorrent
traffic within an ISP in order to avoid excessive and often times unnecessary
transit costs. Several architectures and systems have been proposed and the
initial results from specific ISPs and a few torrents have been encouraging. In
this work ... | [
{
"version": "v1",
"created": "Wed, 22 Jul 2009 16:18:44 GMT"
},
{
"version": "v2",
"created": "Thu, 23 Jul 2009 08:35:39 GMT"
},
{
"version": "v3",
"created": "Tue, 10 Nov 2009 19:40:27 GMT"
},
{
"version": "v4",
"created": "Tue, 1 Feb 2011 19:01:18 GMT"
}
] | 2011-02-02T00:00:00 | [
[
"Cuevas",
"Ruben",
""
],
[
"Laoutaris",
"Nikolaos",
""
],
[
"Yang",
"Xiaoyuan",
""
],
[
"Siganos",
"Georgos",
""
],
[
"Rodriguez",
"Pablo",
""
]
] | TITLE: Deep Diving into BitTorrent Locality
ABSTRACT: A substantial amount of work has recently gone into localizing BitTorrent
traffic within an ISP in order to avoid excessive and often times unnecessary
transit costs. Several architectures and systems have been proposed and the
initial results from specific ISPs... |
1009.1003 | Lorenzo Moneta | Lorenzo Moneta, Kevin Belasco, Kyle Cranmer, Sven Kreiss, Alfio
Lazzaro, Danilo Piparo, Gregory Schott, Wouter Verkerke, Matthias Wolf | The RooStats Project | 11 pages, 3 figures, ACAT2010 Conference Proceedings | null | null | null | physics.data-an | http://creativecommons.org/licenses/by-nc-sa/3.0/ | RooStats is a project to create advanced statistical tools required for the
analysis of LHC data, with emphasis on discoveries, confidence intervals, and
combined measurements. The idea is to provide the major statistical techniques
as a set of C++ classes with coherent interfaces, so that can be used on
arbitrary mo... | [
{
"version": "v1",
"created": "Mon, 6 Sep 2010 09:38:44 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Feb 2011 11:04:00 GMT"
}
] | 2011-02-02T00:00:00 | [
[
"Moneta",
"Lorenzo",
""
],
[
"Belasco",
"Kevin",
""
],
[
"Cranmer",
"Kyle",
""
],
[
"Kreiss",
"Sven",
""
],
[
"Lazzaro",
"Alfio",
""
],
[
"Piparo",
"Danilo",
""
],
[
"Schott",
"Gregory",
""
],
[
"Ve... | TITLE: The RooStats Project
ABSTRACT: RooStats is a project to create advanced statistical tools required for the
analysis of LHC data, with emphasis on discoveries, confidence intervals, and
combined measurements. The idea is to provide the major statistical techniques
as a set of C++ classes with coherent interfa... |
1011.2825 | Niklaus Berger | N. Berger, K. Zhu, Z. A. Liu, D. P. Jin, H. Xu, W. X. Gong, K. Wang,
G. F. Cao | Trigger efficiencies at BES III | 6 pages, 4 figures | Chin.Phys.C34:1779-1784,2010 | 10.1088/1674-1137/34/12/001 | null | hep-ex physics.ins-det | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Trigger efficiencies at BES III were determined for both the J/psi and psi'
data taking of 2009. Both dedicated runs and physics datasets are used;
efficiencies are presented for Bhabha-scattering events, generic hadronic decay
events involving charged tracks, dimuon events and psi' -> pi+pi-J/psi, J/psi
-> l+l- even... | [
{
"version": "v1",
"created": "Fri, 12 Nov 2010 04:43:48 GMT"
}
] | 2011-01-27T00:00:00 | [
[
"Berger",
"N.",
""
],
[
"Zhu",
"K.",
""
],
[
"Liu",
"Z. A.",
""
],
[
"Jin",
"D. P.",
""
],
[
"Xu",
"H.",
""
],
[
"Gong",
"W. X.",
""
],
[
"Wang",
"K.",
""
],
[
"Cao",
"G. F.",
""
]
] | TITLE: Trigger efficiencies at BES III
ABSTRACT: Trigger efficiencies at BES III were determined for both the J/psi and psi'
data taking of 2009. Both dedicated runs and physics datasets are used;
efficiencies are presented for Bhabha-scattering events, generic hadronic decay
events involving charged tracks, dimuon... |
1101.4924 | Ridwan Al Iqbal | Ridwan Al Iqbal | A Generalized Method for Integrating Rule-based Knowledge into Inductive
Methods Through Virtual Sample Creation | null | null | null | null | cs.LG cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Hybrid learning methods use theoretical knowledge of a domain and a set of
classified examples to develop a method for classification. Methods that use
domain knowledge have been shown to perform better than inductive learners.
However, there is no general method to include domain knowledge into all
inductive learnin... | [
{
"version": "v1",
"created": "Tue, 25 Jan 2011 20:42:01 GMT"
}
] | 2011-01-26T00:00:00 | [
[
"Iqbal",
"Ridwan Al",
""
]
] | TITLE: A Generalized Method for Integrating Rule-based Knowledge into Inductive
Methods Through Virtual Sample Creation
ABSTRACT: Hybrid learning methods use theoretical knowledge of a domain and a set of
classified examples to develop a method for classification. Methods that use
domain knowledge have been shown... |
1101.4573 | Alfredo Braunstein | M. Bailly-Bechet, C. Borgs, A. Braunstein, J. Chayes, A.
Dagkessamanskaia, J.-M. Fran\c{c}ois, and R. Zecchina | Finding undetected protein associations in cell signaling by belief
propagation | 6 pages, 3 figures, 1 table, Supporting Information | Published online before print December 27, 2010, doi:
10.1073/pnas.1004751108 PNAS January 11, 2011 vol. 108 no. 2 882-887 | 10.1073/pnas.1004751108 | null | q-bio.MN cond-mat.stat-mech cs.AI cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | External information propagates in the cell mainly through signaling cascades
and transcriptional activation, allowing it to react to a wide spectrum of
environmental changes. High throughput experiments identify numerous molecular
components of such cascades that may, however, interact through unknown
partners. Some... | [
{
"version": "v1",
"created": "Mon, 24 Jan 2011 15:57:48 GMT"
}
] | 2011-01-25T00:00:00 | [
[
"Bailly-Bechet",
"M.",
""
],
[
"Borgs",
"C.",
""
],
[
"Braunstein",
"A.",
""
],
[
"Chayes",
"J.",
""
],
[
"Dagkessamanskaia",
"A.",
""
],
[
"François",
"J. -M.",
""
],
[
"Zecchina",
"R.",
""
]
] | TITLE: Finding undetected protein associations in cell signaling by belief
propagation
ABSTRACT: External information propagates in the cell mainly through signaling cascades
and transcriptional activation, allowing it to react to a wide spectrum of
environmental changes. High throughput experiments identify nume... |
1101.2987 | Mahesh Pal Dr. | Mahesh Pal | Support vector machines/relevance vector machine for remote sensing
classification: A review | 19 pages | Proceeding of the Workshop on Application of advanced soft
computing Techniques in Geo-spatial Data Analysis. Department of Civil
Engineering, IIT Bombay, Sept. 22-23,2008, 211-227 | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Kernel-based machine learning algorithms are based on mapping data from the
original input feature space to a kernel feature space of higher dimensionality
to solve a linear problem in that space. Over the last decade, kernel based
classification and regression approaches such as support vector machines have
widely b... | [
{
"version": "v1",
"created": "Sat, 15 Jan 2011 13:29:12 GMT"
}
] | 2011-01-18T00:00:00 | [
[
"Pal",
"Mahesh",
""
]
] | TITLE: Support vector machines/relevance vector machine for remote sensing
classification: A review
ABSTRACT: Kernel-based machine learning algorithms are based on mapping data from the
original input feature space to a kernel feature space of higher dimensionality
to solve a linear problem in that space. Over th... |
1012.6009 | Rahmat Widia Sembiring | Rahmat Widia Sembiring, Jasni Mohamad Zain | Cluster Evaluation of Density Based Subspace Clustering | 6 pages, 15 figures | Journal of Computing, Volume 2, Issue 11, November 2010, ISSN
2151-9617 | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Clustering real world data often faced with curse of dimensionality, where
real world data often consist of many dimensions. Multidimensional data
clustering evaluation can be done through a density-based approach. Density
approaches based on the paradigm introduced by DBSCAN clustering. In this
approach, density of ... | [
{
"version": "v1",
"created": "Wed, 29 Dec 2010 19:34:11 GMT"
}
] | 2010-12-30T00:00:00 | [
[
"Sembiring",
"Rahmat Widia",
""
],
[
"Zain",
"Jasni Mohamad",
""
]
] | TITLE: Cluster Evaluation of Density Based Subspace Clustering
ABSTRACT: Clustering real world data often faced with curse of dimensionality, where
real world data often consist of many dimensions. Multidimensional data
clustering evaluation can be done through a density-based approach. Density
approaches based on ... |
1008.4619 | Richard Hill | Richard J. Hill and Gil Paz | Model independent extraction of the proton charge radius from electron
scattering | 17 pages, 4 figures. v2: references added, minor typos corrected,
version to appear in PRD | Phys.Rev.D82:113005,2010 | 10.1103/PhysRevD.82.113005 | EFI Preprint 10-21 | hep-ph nucl-ex nucl-th physics.atom-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Constraints from analyticity are combined with experimental electron-proton
scattering data to determine the proton charge radius. In contrast to previous
determinations, we provide a systematic procedure for analyzing arbitrary data
without model-dependent assumptions on the form factor shape. We also
investigate th... | [
{
"version": "v1",
"created": "Thu, 26 Aug 2010 23:38:09 GMT"
},
{
"version": "v2",
"created": "Wed, 24 Nov 2010 18:14:05 GMT"
}
] | 2010-12-24T00:00:00 | [
[
"Hill",
"Richard J.",
""
],
[
"Paz",
"Gil",
""
]
] | TITLE: Model independent extraction of the proton charge radius from electron
scattering
ABSTRACT: Constraints from analyticity are combined with experimental electron-proton
scattering data to determine the proton charge radius. In contrast to previous
determinations, we provide a systematic procedure for analyz... |
1012.4759 | Ying Ding | Bin Chen (1), David J Wild (1), Qian Zhu (1), Ying Ding (2), Xiao Dong
(1), Madhuvanthi Sankaranarayanan (1), Huijun Wang (1), Yuyin Sun (2) ((1)
School of Informatics and Computing, Indiana University, Bloomington, IN,
USA, (2) School of Library and Information Science, Indiana University,
Bloomington, IN, USA... | Chem2Bio2RDF: A Linked Open Data Portal for Chemical Biology | 8 pages, 10 figures | null | null | null | cs.IR q-bio.OT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Chem2Bio2RDF portal is a Linked Open Data (LOD) portal for systems
chemical biology aiming for facilitating drug discovery. It converts around 25
different datasets on genes, compounds, drugs, pathways, side effects,
diseases, and MEDLINE/PubMed documents into RDF triples and links them to other
LOD bubbles, such... | [
{
"version": "v1",
"created": "Tue, 21 Dec 2010 18:29:54 GMT"
}
] | 2010-12-22T00:00:00 | [
[
"Chen",
"Bin",
""
],
[
"Wild",
"David J",
""
],
[
"Zhu",
"Qian",
""
],
[
"Ding",
"Ying",
""
],
[
"Dong",
"Xiao",
""
],
[
"Sankaranarayanan",
"Madhuvanthi",
""
],
[
"Wang",
"Huijun",
""
],
[
"Sun",
... | TITLE: Chem2Bio2RDF: A Linked Open Data Portal for Chemical Biology
ABSTRACT: The Chem2Bio2RDF portal is a Linked Open Data (LOD) portal for systems
chemical biology aiming for facilitating drug discovery. It converts around 25
different datasets on genes, compounds, drugs, pathways, side effects,
diseases, and MED... |
1012.4396 | Walter Quattrociocchi | Walter Quattrociocchi, Frederic Amblard | Selection in Scientific Networks | 17 pages, 8 Figure, social network analysis, evolving structures | null | null | null | cs.SI cs.CY cs.DL nlin.AO physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the most interesting scientific challenges nowadays deals with the
analysis and the understanding of complex networks' dynamics. A major issue is
the definition of new frameworks for the exploration of the dynamics at play in
real dynamic networks. Here, we focus on scientific communities by analyzing
the "soc... | [
{
"version": "v1",
"created": "Mon, 20 Dec 2010 16:47:57 GMT"
}
] | 2010-12-21T00:00:00 | [
[
"Quattrociocchi",
"Walter",
""
],
[
"Amblard",
"Frederic",
""
]
] | TITLE: Selection in Scientific Networks
ABSTRACT: One of the most interesting scientific challenges nowadays deals with the
analysis and the understanding of complex networks' dynamics. A major issue is
the definition of new frameworks for the exploration of the dynamics at play in
real dynamic networks. Here, we f... |
1012.3805 | Yang Wang | Yang Wang, Zhikui Chen, Xiaodi Huang | Element Retrieval using Namespace Based on keyword search over XML
Documents | 9 pages | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Querying over XML elements using keyword search is steadily gaining
popularity. The traditional similarity measure is widely employed in order to
effectively retrieve various XML documents. A number of authors have already
proposed different similarity-measure methods that take advantage of the
structure and content ... | [
{
"version": "v1",
"created": "Fri, 17 Dec 2010 04:00:10 GMT"
}
] | 2010-12-20T00:00:00 | [
[
"Wang",
"Yang",
""
],
[
"Chen",
"Zhikui",
""
],
[
"Huang",
"Xiaodi",
""
]
] | TITLE: Element Retrieval using Namespace Based on keyword search over XML
Documents
ABSTRACT: Querying over XML elements using keyword search is steadily gaining
popularity. The traditional similarity measure is widely employed in order to
effectively retrieve various XML documents. A number of authors have alrea... |
0904.1366 | Jian Li | Jian Li, Barna Saha, Amol Deshpande | A Unified Approach to Ranking in Probabilistic Databases | null | null | null | null | cs.DB cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The dramatic growth in the number of application domains that naturally
generate probabilistic, uncertain data has resulted in a need for efficiently
supporting complex querying and decision-making over such data. In this paper,
we present a unified approach to ranking and top-k query processing in
probabilistic data... | [
{
"version": "v1",
"created": "Wed, 8 Apr 2009 15:30:58 GMT"
},
{
"version": "v2",
"created": "Tue, 14 Apr 2009 04:42:10 GMT"
},
{
"version": "v3",
"created": "Tue, 14 Dec 2010 19:25:42 GMT"
},
{
"version": "v4",
"created": "Wed, 15 Dec 2010 21:12:37 GMT"
}
] | 2010-12-17T00:00:00 | [
[
"Li",
"Jian",
""
],
[
"Saha",
"Barna",
""
],
[
"Deshpande",
"Amol",
""
]
] | TITLE: A Unified Approach to Ranking in Probabilistic Databases
ABSTRACT: The dramatic growth in the number of application domains that naturally
generate probabilistic, uncertain data has resulted in a need for efficiently
supporting complex querying and decision-making over such data. In this paper,
we present a ... |
1012.3476 | Guillaume Desjardins | Guillaume Desjardins, Aaron Courville, Yoshua Bengio | Adaptive Parallel Tempering for Stochastic Maximum Likelihood Learning
of RBMs | Presented at the "NIPS 2010 Workshop on Deep Learning and
Unsupervised Feature Learning" | null | null | null | stat.ML cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Restricted Boltzmann Machines (RBM) have attracted a lot of attention of
late, as one the principle building blocks of deep networks. Training RBMs
remains problematic however, because of the intractibility of their partition
function. The maximum likelihood gradient requires a very robust sampler which
can accuratel... | [
{
"version": "v1",
"created": "Wed, 15 Dec 2010 21:23:09 GMT"
}
] | 2010-12-17T00:00:00 | [
[
"Desjardins",
"Guillaume",
""
],
[
"Courville",
"Aaron",
""
],
[
"Bengio",
"Yoshua",
""
]
] | TITLE: Adaptive Parallel Tempering for Stochastic Maximum Likelihood Learning
of RBMs
ABSTRACT: Restricted Boltzmann Machines (RBM) have attracted a lot of attention of
late, as one the principle building blocks of deep networks. Training RBMs
remains problematic however, because of the intractibility of their pa... |
1010.4843 | Massimo Brescia Dr | Massimo Brescia, Giuseppe Longo, George S. Djorgovski, Stefano
Cavuoti, Raffaele D'Abrusco, Ciro Donalek, Alessandro Di Guido, Michelangelo
Fiore, Mauro Garofalo, Omar Laurino, Ashish Mahabal, Francesco Manna, Alfonso
Nocella, Giovanni d'Angelo, Maurizio Paolillo | DAME: A Web Oriented Infrastructure for Scientific Data Mining &
Exploration | 16 pages, 9 figures, software available at
http://voneural.na.infn.it/beta_info.html | null | null | null | astro-ph.IM astro-ph.GA cs.DB cs.DC cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Nowadays, many scientific areas share the same need of being able to deal
with massive and distributed datasets and to perform on them complex knowledge
extraction tasks. This simple consideration is behind the international efforts
to build virtual organizations such as, for instance, the Virtual Observatory
(VObs).... | [
{
"version": "v1",
"created": "Sat, 23 Oct 2010 04:43:13 GMT"
},
{
"version": "v2",
"created": "Wed, 8 Dec 2010 04:48:34 GMT"
}
] | 2010-12-09T00:00:00 | [
[
"Brescia",
"Massimo",
""
],
[
"Longo",
"Giuseppe",
""
],
[
"Djorgovski",
"George S.",
""
],
[
"Cavuoti",
"Stefano",
""
],
[
"D'Abrusco",
"Raffaele",
""
],
[
"Donalek",
"Ciro",
""
],
[
"Di Guido",
"Alessandro",
... | TITLE: DAME: A Web Oriented Infrastructure for Scientific Data Mining &
Exploration
ABSTRACT: Nowadays, many scientific areas share the same need of being able to deal
with massive and distributed datasets and to perform on them complex knowledge
extraction tasks. This simple consideration is behind the internati... |
1011.3728 | Curzio Basso | Curzio Basso and Matteo Santoro and Alessandro Verri and Silvia Villa | PADDLE: Proximal Algorithm for Dual Dictionaries LEarning | null | null | null | DISI-TR-2010-06 | cs.LG cs.IT math.IT stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, considerable research efforts have been devoted to the design of
methods to learn from data overcomplete dictionaries for sparse coding.
However, learned dictionaries require the solution of an optimization problem
for coding new data. In order to overcome this drawback, we propose an
algorithm aimed at lea... | [
{
"version": "v1",
"created": "Tue, 16 Nov 2010 15:31:25 GMT"
}
] | 2010-11-17T00:00:00 | [
[
"Basso",
"Curzio",
""
],
[
"Santoro",
"Matteo",
""
],
[
"Verri",
"Alessandro",
""
],
[
"Villa",
"Silvia",
""
]
] | TITLE: PADDLE: Proximal Algorithm for Dual Dictionaries LEarning
ABSTRACT: Recently, considerable research efforts have been devoted to the design of
methods to learn from data overcomplete dictionaries for sparse coding.
However, learned dictionaries require the solution of an optimization problem
for coding new d... |
1011.2807 | Jijie Wang | Jijie Wang, Lei Lin, Ting Huang, Jingjing Wang and Zengyou He | Efficient K-Nearest Neighbor Join Algorithms for High Dimensional Sparse
Data | 12 pages, This paper has been submitted to PAKDD2011 | null | null | null | cs.DB cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The K-Nearest Neighbor (KNN) join is an expensive but important operation in
many data mining algorithms. Several recent applications need to perform KNN
join for high dimensional sparse data. Unfortunately, all existing KNN join
algorithms are designed for low dimensional data. To fulfill this void, we
investigate t... | [
{
"version": "v1",
"created": "Fri, 12 Nov 2010 01:35:39 GMT"
}
] | 2010-11-15T00:00:00 | [
[
"Wang",
"Jijie",
""
],
[
"Lin",
"Lei",
""
],
[
"Huang",
"Ting",
""
],
[
"Wang",
"Jingjing",
""
],
[
"He",
"Zengyou",
""
]
] | TITLE: Efficient K-Nearest Neighbor Join Algorithms for High Dimensional Sparse
Data
ABSTRACT: The K-Nearest Neighbor (KNN) join is an expensive but important operation in
many data mining algorithms. Several recent applications need to perform KNN
join for high dimensional sparse data. Unfortunately, all existin... |
1011.2107 | Jocelyne Troccaz | Janssoone Thomas (TIMC), Gr\'egoire Chevreau (TIMC), Lucile Vadcard
(LSE), Pierre Mozer, Jocelyne Troccaz (TIMC) | Biopsym : a learning environment for transrectal ultrasound guided
prostate biopsies | null | 18th "Medecine Meets Virtual Reality", Newport beach : United
States (2011) | null | null | cs.OH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper describes a learning environment for image-guided prostate
biopsies in cancer diagnosis; it is based on an ultrasound probe simulator
virtually exploring real datasets obtained from patients. The aim is to make
the training of young physicians easier and faster with a tool that combines
lectures, biopsy si... | [
{
"version": "v1",
"created": "Mon, 8 Nov 2010 15:54:10 GMT"
}
] | 2010-11-10T00:00:00 | [
[
"Thomas",
"Janssoone",
"",
"TIMC"
],
[
"Chevreau",
"Grégoire",
"",
"TIMC"
],
[
"Vadcard",
"Lucile",
"",
"LSE"
],
[
"Mozer",
"Pierre",
"",
"TIMC"
],
[
"Troccaz",
"Jocelyne",
"",
"TIMC"
]
] | TITLE: Biopsym : a learning environment for transrectal ultrasound guided
prostate biopsies
ABSTRACT: This paper describes a learning environment for image-guided prostate
biopsies in cancer diagnosis; it is based on an ultrasound probe simulator
virtually exploring real datasets obtained from patients. The aim i... |
1011.1127 | Dan Tavrov | Oleg Chertov, Dan Tavrov | Group Anonymity: Problems and Solutions | 13 pages, 6 figures, 1 table. Published by "Lviv Polytechnica
Publishing House" in "Information Systems and Networks"
(http://vlp.com.ua/taxonomy/term/3136) | Information Systems and Networks, No. 673, pp. 3-15, 2010 | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Existing methods of providing data anonymity preserve individual privacy,
but, the task of protecting respondent groups' information in publicly
available datasets remains open. Group anonymity lies in hiding (masking) data
patterns that cannot be revealed by analyzing individual records. We discuss
main correspondin... | [
{
"version": "v1",
"created": "Thu, 4 Nov 2010 12:02:53 GMT"
}
] | 2010-11-05T00:00:00 | [
[
"Chertov",
"Oleg",
""
],
[
"Tavrov",
"Dan",
""
]
] | TITLE: Group Anonymity: Problems and Solutions
ABSTRACT: Existing methods of providing data anonymity preserve individual privacy,
but, the task of protecting respondent groups' information in publicly
available datasets remains open. Group anonymity lies in hiding (masking) data
patterns that cannot be revealed by... |
astro-ph/0601073 | Gregory V. Vereshchagin | G. V. Vereshchagin and G. Yegorian | Cosmological models with Gurzadyan-Xue dark energy | figure 3 and typos are corrected, version matches the one to appear
in Classical and Quantum Gravity | Class.Quant.Grav.23:5049-5062,2006 | 10.1088/0264-9381/23/15/020 | null | astro-ph hep-th physics.class-ph | null | The formula for dark energy density derived by Gurzadyan and Xue provides a
value of density parameter of dark energy in remarkable agreement with current
cosmological datasets, unlike numerous phenomenological dark energy scenarios
where the corresponding value is postulated. This formula suggests the
possibility of... | [
{
"version": "v1",
"created": "Wed, 4 Jan 2006 09:55:28 GMT"
},
{
"version": "v2",
"created": "Wed, 1 Feb 2006 15:27:28 GMT"
},
{
"version": "v3",
"created": "Wed, 31 May 2006 16:26:22 GMT"
},
{
"version": "v4",
"created": "Fri, 7 Jul 2006 14:27:59 GMT"
}
] | 2010-11-05T00:00:00 | [
[
"Vereshchagin",
"G. V.",
""
],
[
"Yegorian",
"G.",
""
]
] | TITLE: Cosmological models with Gurzadyan-Xue dark energy
ABSTRACT: The formula for dark energy density derived by Gurzadyan and Xue provides a
value of density parameter of dark energy in remarkable agreement with current
cosmological datasets, unlike numerous phenomenological dark energy scenarios
where the corre... |
1010.5943 | Szymon Chojnacki Mr | Szymon Chojnacki and Mieczys{\l}aw K{\l}opotek | Random Graph Generator for Bipartite Networks Modeling | null | null | null | null | cs.AI cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The purpose of this article is to introduce a new iterative algorithm with
properties resembling real life bipartite graphs. The algorithm enables us to
generate wide range of random bigraphs, which features are determined by a set
of parameters.We adapt the advances of last decade in unipartite complex
networks mode... | [
{
"version": "v1",
"created": "Thu, 28 Oct 2010 12:39:10 GMT"
},
{
"version": "v2",
"created": "Tue, 2 Nov 2010 16:47:39 GMT"
}
] | 2010-11-03T00:00:00 | [
[
"Chojnacki",
"Szymon",
""
],
[
"Kłopotek",
"Mieczysław",
""
]
] | TITLE: Random Graph Generator for Bipartite Networks Modeling
ABSTRACT: The purpose of this article is to introduce a new iterative algorithm with
properties resembling real life bipartite graphs. The algorithm enables us to
generate wide range of random bigraphs, which features are determined by a set
of parameter... |
1010.5954 | Szymon Chojnacki Mr | Szymon Chojnacki and Mieczys{\l}aw K{\l}opotek | Random Graphs for Performance Evaluation of Recommender Systems | null | null | null | null | cs.AI cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The purpose of this article is to introduce a new analytical framework
dedicated to measuring performance of recommender systems. The standard
approach is to assess the quality of a system by means of accuracy related
statistics. However, the specificity of the environments in which recommender
systems are deployed r... | [
{
"version": "v1",
"created": "Thu, 28 Oct 2010 13:10:03 GMT"
}
] | 2010-10-29T00:00:00 | [
[
"Chojnacki",
"Szymon",
""
],
[
"Kłopotek",
"Mieczysław",
""
]
] | TITLE: Random Graphs for Performance Evaluation of Recommender Systems
ABSTRACT: The purpose of this article is to introduce a new analytical framework
dedicated to measuring performance of recommender systems. The standard
approach is to assess the quality of a system by means of accuracy related
statistics. Howev... |
1010.5610 | Ju Sun | Ju Sun, Qiang Chen, Shuicheng Yan, Loong-Fah Cheong | Selective Image Super-Resolution | 20 pages, 5 figures. Submitted to Computer Vision and Image
Understanding in March 2010. Keywords: image super resolution, semantic image
segmentation, vision system, vision application | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we propose a vision system that performs image Super Resolution
(SR) with selectivity. Conventional SR techniques, either by multi-image fusion
or example-based construction, have failed to capitalize on the intrinsic
structural and semantic context in the image, and performed "blind" resolution
recover... | [
{
"version": "v1",
"created": "Wed, 27 Oct 2010 08:58:48 GMT"
}
] | 2010-10-28T00:00:00 | [
[
"Sun",
"Ju",
""
],
[
"Chen",
"Qiang",
""
],
[
"Yan",
"Shuicheng",
""
],
[
"Cheong",
"Loong-Fah",
""
]
] | TITLE: Selective Image Super-Resolution
ABSTRACT: In this paper we propose a vision system that performs image Super Resolution
(SR) with selectivity. Conventional SR techniques, either by multi-image fusion
or example-based construction, have failed to capitalize on the intrinsic
structural and semantic context in... |
1010.5426 | Shuai Zheng | Shuai Zheng and Kaiqi Huang and Tieniu Tan | Translation-Invariant Representation for Cumulative Foot Pressure Images | 6 pages | Shuai Zheng, Kaiqi Huang and Tieniu Tan. Translation Invariant
Representation for Cumulative foot pressure Image, The second CJK Joint
Workshop on Pattern Recognition(CJKPR), 2010 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Human can be distinguished by different limb movements and unique ground
reaction force. Cumulative foot pressure image is a 2-D cumulative ground
reaction force during one gait cycle. Although it contains pressure spatial
distribution information and pressure temporal distribution information, it
suffers from severa... | [
{
"version": "v1",
"created": "Tue, 26 Oct 2010 15:16:50 GMT"
}
] | 2010-10-27T00:00:00 | [
[
"Zheng",
"Shuai",
""
],
[
"Huang",
"Kaiqi",
""
],
[
"Tan",
"Tieniu",
""
]
] | TITLE: Translation-Invariant Representation for Cumulative Foot Pressure Images
ABSTRACT: Human can be distinguished by different limb movements and unique ground
reaction force. Cumulative foot pressure image is a 2-D cumulative ground
reaction force during one gait cycle. Although it contains pressure spatial
dis... |
1010.3796 | Massimo Brescia Dr | M. Brescia, G. Longo, F. Pasian | Mining Knowledge in Astrophysical Massive Data Sets | Pages 845-849 1rs International Conference on Frontiers in
Diagnostics Technologies | Elsevier, Nuclear Instruments and Methods in Physics Research
Section A: Accelerators, Spectrometers, Detectors and Associated Equipment
Volume 623, Issue 2, 11 November 2010 | 10.1016/j.nima.2010.02.002 | null | astro-ph.IM cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modern scientific data mainly consist of huge datasets gathered by a very
large number of techniques and stored in very diversified and often
incompatible data repositories. More in general, in the e-science environment,
it is considered as a critical and urgent requirement to integrate services
across distributed, h... | [
{
"version": "v1",
"created": "Tue, 19 Oct 2010 04:48:19 GMT"
}
] | 2010-10-20T00:00:00 | [
[
"Brescia",
"M.",
""
],
[
"Longo",
"G.",
""
],
[
"Pasian",
"F.",
""
]
] | TITLE: Mining Knowledge in Astrophysical Massive Data Sets
ABSTRACT: Modern scientific data mainly consist of huge datasets gathered by a very
large number of techniques and stored in very diversified and often
incompatible data repositories. More in general, in the e-science environment,
it is considered as a crit... |
1010.3053 | Lars Kolb | Lars Kolb, Andreas Thor, Erhard Rahm | Parallel Sorted Neighborhood Blocking with MapReduce | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cloud infrastructures enable the efficient parallel execution of
data-intensive tasks such as entity resolution on large datasets. We
investigate challenges and possible solutions of using the MapReduce
programming model for parallel entity resolution. In particular, we propose and
evaluate two MapReduce-based implem... | [
{
"version": "v1",
"created": "Fri, 15 Oct 2010 00:28:44 GMT"
}
] | 2010-10-18T00:00:00 | [
[
"Kolb",
"Lars",
""
],
[
"Thor",
"Andreas",
""
],
[
"Rahm",
"Erhard",
""
]
] | TITLE: Parallel Sorted Neighborhood Blocking with MapReduce
ABSTRACT: Cloud infrastructures enable the efficient parallel execution of
data-intensive tasks such as entity resolution on large datasets. We
investigate challenges and possible solutions of using the MapReduce
programming model for parallel entity resol... |
1010.1437 | Mahdi Shafiei | Mahdi Shafiei and Hugh Chipman | Mixed-Membership Stochastic Block-Models for Transactional Networks | 22 pages | null | null | null | stat.ML cs.AI cs.SI stat.AP stat.ME | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Transactional network data can be thought of as a list of one-to-many
communications(e.g., email) between nodes in a social network. Most social
network models convert this type of data into binary relations between pairs of
nodes. We develop a latent mixed membership model capable of modeling richer
forms of transac... | [
{
"version": "v1",
"created": "Thu, 7 Oct 2010 14:16:38 GMT"
}
] | 2010-10-08T00:00:00 | [
[
"Shafiei",
"Mahdi",
""
],
[
"Chipman",
"Hugh",
""
]
] | TITLE: Mixed-Membership Stochastic Block-Models for Transactional Networks
ABSTRACT: Transactional network data can be thought of as a list of one-to-many
communications(e.g., email) between nodes in a social network. Most social
network models convert this type of data into binary relations between pairs of
nodes.... |
1009.3980 | Eiko Yoneki | Mervyn P. Freeman, Nicholas W. Watkins, Eiko Yoneki, Jon Crowcroft | Rhythm and Randomness in Human Contact | null | International Conference on Advances in Social Networks Analysis
and Mining, 2010 | 10.1109/ASONAM.2010.57 | null | physics.data-an physics.bio-ph physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There is substantial interest in the effect of human mobility patterns on
opportunistic communications. Inspired by recent work revisiting some of the
early evidence for a L\'evy flight foraging strategy in animals, we analyse
datasets on human contact from real world traces. By analysing the distribution
of inter-co... | [
{
"version": "v1",
"created": "Tue, 21 Sep 2010 01:20:07 GMT"
}
] | 2010-10-01T00:00:00 | [
[
"Freeman",
"Mervyn P.",
""
],
[
"Watkins",
"Nicholas W.",
""
],
[
"Yoneki",
"Eiko",
""
],
[
"Crowcroft",
"Jon",
""
]
] | TITLE: Rhythm and Randomness in Human Contact
ABSTRACT: There is substantial interest in the effect of human mobility patterns on
opportunistic communications. Inspired by recent work revisiting some of the
early evidence for a L\'evy flight foraging strategy in animals, we analyse
datasets on human contact from re... |
0710.4975 | Yoshiharu Maeno | Yoshiharu Maeno | Node discovery problem for a social network | null | Connections vol.29, pp.62-76 (2009) | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Methods to solve a node discovery problem for a social network are presented.
Covert nodes refer to the nodes which are not observable directly. They
transmit the influence and affect the resulting collaborative activities among
the persons in a social network, but do not appear in the surveillance logs
which record ... | [
{
"version": "v1",
"created": "Fri, 26 Oct 2007 01:32:47 GMT"
},
{
"version": "v2",
"created": "Fri, 7 Aug 2009 04:18:43 GMT"
}
] | 2010-09-28T00:00:00 | [
[
"Maeno",
"Yoshiharu",
""
]
] | TITLE: Node discovery problem for a social network
ABSTRACT: Methods to solve a node discovery problem for a social network are presented.
Covert nodes refer to the nodes which are not observable directly. They
transmit the influence and affect the resulting collaborative activities among
the persons in a social ne... |
1009.4823 | Adrian Ion | Joao Carreira, Adrian Ion, and Cristian Sminchisescu | Image Segmentation by Discounted Cumulative Ranking on Maximal Cliques | 11 pages, 5 figures | null | null | TR-06-2010 | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a mid-level image segmentation framework that combines multiple
figure-ground hypothesis (FG) constrained at different locations and scales,
into interpretations that tile the entire image. The problem is cast as
optimization over sets of maximal cliques sampled from the graph connecting
non-overlapping, p... | [
{
"version": "v1",
"created": "Fri, 24 Sep 2010 12:32:02 GMT"
}
] | 2010-09-27T00:00:00 | [
[
"Carreira",
"Joao",
""
],
[
"Ion",
"Adrian",
""
],
[
"Sminchisescu",
"Cristian",
""
]
] | TITLE: Image Segmentation by Discounted Cumulative Ranking on Maximal Cliques
ABSTRACT: We propose a mid-level image segmentation framework that combines multiple
figure-ground hypothesis (FG) constrained at different locations and scales,
into interpretations that tile the entire image. The problem is cast as
opti... |
1009.3984 | Hieu Dinh | Hieu Dinh and Sanguthevar Rajasekaran | A memory-efficient data structure representing exact-match overlap
graphs with application for next generation DNA assembly | null | null | null | null | cs.DS cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An exact-match overlap graph of $n$ given strings of length $\ell$ is an
edge-weighted graph in which each vertex is associated with a string and there
is an edge $(x,y)$ of weight $\omega = \ell - |ov_{max}(x,y)|$ if and only if
$\omega \leq \lambda$, where $|ov_{max}(x,y)|$ is the length of $ov_{max}(x,y)$
and $\la... | [
{
"version": "v1",
"created": "Tue, 21 Sep 2010 02:39:34 GMT"
}
] | 2010-09-22T00:00:00 | [
[
"Dinh",
"Hieu",
""
],
[
"Rajasekaran",
"Sanguthevar",
""
]
] | TITLE: A memory-efficient data structure representing exact-match overlap
graphs with application for next generation DNA assembly
ABSTRACT: An exact-match overlap graph of $n$ given strings of length $\ell$ is an
edge-weighted graph in which each vertex is associated with a string and there
is an edge $(x,y)$ of... |
1008.0135 | Amr Hassan | A.H. Hassan, C.J. Fluke, D.G. Barnes | Interactive Visualization of the Largest Radioastronomy Cubes | 15 pages, 12 figures, Accepted New Astronomy July 2010 | New Astronomy 16 (2011), pp. 100-109 | 10.1016/j.newast.2010.07.009 | null | astro-ph.IM cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 3D visualization is an important data analysis and knowledge discovery tool,
however, interactive visualization of large 3D astronomical datasets poses a
challenge for many existing data visualization packages. We present a solution
to interactively visualize larger-than-memory 3D astronomical data cubes by
utilizing... | [
{
"version": "v1",
"created": "Sun, 1 Aug 2010 00:55:23 GMT"
}
] | 2010-09-21T00:00:00 | [
[
"Hassan",
"A. H.",
""
],
[
"Fluke",
"C. J.",
""
],
[
"Barnes",
"D. G.",
""
]
] | TITLE: Interactive Visualization of the Largest Radioastronomy Cubes
ABSTRACT: 3D visualization is an important data analysis and knowledge discovery tool,
however, interactive visualization of large 3D astronomical datasets poses a
challenge for many existing data visualization packages. We present a solution
to i... |
1009.3711 | EPTCS | Yi-Hsun Wang, Ching-Hao Mao, Hahn-Ming Lee | Structural Learning of Attack Vectors for Generating Mutated XSS Attacks | In Proceedings TAV-WEB 2010, arXiv:1009.3306 | EPTCS 35, 2010, pp. 15-26 | 10.4204/EPTCS.35.2 | null | cs.SE cs.CR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Web applications suffer from cross-site scripting (XSS) attacks that
resulting from incomplete or incorrect input sanitization. Learning the
structure of attack vectors could enrich the variety of manifestations in
generated XSS attacks. In this study, we focus on generating more threatening
XSS attacks for the state... | [
{
"version": "v1",
"created": "Mon, 20 Sep 2010 07:19:27 GMT"
}
] | 2010-09-21T00:00:00 | [
[
"Wang",
"Yi-Hsun",
""
],
[
"Mao",
"Ching-Hao",
""
],
[
"Lee",
"Hahn-Ming",
""
]
] | TITLE: Structural Learning of Attack Vectors for Generating Mutated XSS Attacks
ABSTRACT: Web applications suffer from cross-site scripting (XSS) attacks that
resulting from incomplete or incorrect input sanitization. Learning the
structure of attack vectors could enrich the variety of manifestations in
generated X... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.