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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1112.4456 | Massimiliano Dal Mas | Massimiliano Dal Mas | Cluster Analysis for a Scale-Free Folksodriven Structure Network | 9 pages, 4 figures; for details see: http://www.maxdalmas.com | null | null | null | cs.SI cs.IR physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Folksonomy is said to provide a democratic tagging system that reflects the
opinions of the general public, but it is not a classification system and it is
hard to make sense of. It would be necessary to share a representation of
contexts by all the users to develop a social and collaborative matching. The
solution c... | [
{
"version": "v1",
"created": "Mon, 19 Dec 2011 20:31:00 GMT"
}
] | 2011-12-20T00:00:00 | [
[
"Mas",
"Massimiliano Dal",
""
]
] | TITLE: Cluster Analysis for a Scale-Free Folksodriven Structure Network
ABSTRACT: Folksonomy is said to provide a democratic tagging system that reflects the
opinions of the general public, but it is not a classification system and it is
hard to make sense of. It would be necessary to share a representation of
cont... |
1112.1527 | Konstantinos Themelis | Konstantinos E. Themelis, Fr\'ed\'eric Schmidt, Olga Sykioti,
Athanasios A. Rontogiannis, Konstantinos D. Koutroumbas, Ioannis A. Daglis | On the unmixing of MEx/OMEGA hyperspectral data | null | Planetary and Space Science, 2011 | 10.1016/j.pss.2011.11.015 | null | astro-ph.IM astro-ph.EP physics.space-ph stat.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This article presents a comparative study of three different types of
estimators used for supervised linear unmixing of two MEx/OMEGA hyperspectral
cubes. The algorithms take into account the constraints of the abundance
fractions, in order to get physically interpretable results. Abundance maps
show that the Bayesia... | [
{
"version": "v1",
"created": "Wed, 7 Dec 2011 11:33:23 GMT"
}
] | 2011-12-19T00:00:00 | [
[
"Themelis",
"Konstantinos E.",
""
],
[
"Schmidt",
"Frédéric",
""
],
[
"Sykioti",
"Olga",
""
],
[
"Rontogiannis",
"Athanasios A.",
""
],
[
"Koutroumbas",
"Konstantinos D.",
""
],
[
"Daglis",
"Ioannis A.",
""
]
] | TITLE: On the unmixing of MEx/OMEGA hyperspectral data
ABSTRACT: This article presents a comparative study of three different types of
estimators used for supervised linear unmixing of two MEx/OMEGA hyperspectral
cubes. The algorithms take into account the constraints of the abundance
fractions, in order to get phy... |
1112.2774 | Tina Eliassi-Rad | Mangesh Gupte and Tina Eliassi-Rad | Measuring Tie Strength in Implicit Social Networks | 10 pages | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a set of people and a set of events they attend, we address the problem
of measuring connectedness or tie strength between each pair of persons given
that attendance at mutual events gives an implicit social network between
people. We take an axiomatic approach to this problem. Starting from a list of
axioms th... | [
{
"version": "v1",
"created": "Tue, 13 Dec 2011 02:30:22 GMT"
}
] | 2011-12-14T00:00:00 | [
[
"Gupte",
"Mangesh",
""
],
[
"Eliassi-Rad",
"Tina",
""
]
] | TITLE: Measuring Tie Strength in Implicit Social Networks
ABSTRACT: Given a set of people and a set of events they attend, we address the problem
of measuring connectedness or tie strength between each pair of persons given
that attendance at mutual events gives an implicit social network between
people. We take an... |
1008.5188 | Chunhua Shen | Chunhua Shen, Hanxi Li, Nick Barnes | Totally Corrective Boosting for Regularized Risk Minimization | This paper has been withdrawn by the author | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Consideration of the primal and dual problems together leads to important new
insights into the characteristics of boosting algorithms. In this work, we
propose a general framework that can be used to design new boosting algorithms.
A wide variety of machine learning problems essentially minimize a regularized
risk f... | [
{
"version": "v1",
"created": "Mon, 30 Aug 2010 23:40:51 GMT"
},
{
"version": "v2",
"created": "Mon, 12 Dec 2011 04:42:17 GMT"
}
] | 2011-12-13T00:00:00 | [
[
"Shen",
"Chunhua",
""
],
[
"Li",
"Hanxi",
""
],
[
"Barnes",
"Nick",
""
]
] | TITLE: Totally Corrective Boosting for Regularized Risk Minimization
ABSTRACT: Consideration of the primal and dual problems together leads to important new
insights into the characteristics of boosting algorithms. In this work, we
propose a general framework that can be used to design new boosting algorithms.
A wi... |
1109.3701 | Kevin Jamieson | Kevin G. Jamieson and Robert D. Nowak | Active Ranking using Pairwise Comparisons | 17 pages, an extended version of our NIPS 2011 paper. The new version
revises the argument of the robust section and slightly modifies the result
there to give it more impact | null | null | null | cs.LG cs.IT math.IT stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper examines the problem of ranking a collection of objects using
pairwise comparisons (rankings of two objects). In general, the ranking of $n$
objects can be identified by standard sorting methods using $n log_2 n$
pairwise comparisons. We are interested in natural situations in which
relationships among the... | [
{
"version": "v1",
"created": "Fri, 16 Sep 2011 19:35:13 GMT"
},
{
"version": "v2",
"created": "Sat, 10 Dec 2011 01:02:14 GMT"
}
] | 2011-12-13T00:00:00 | [
[
"Jamieson",
"Kevin G.",
""
],
[
"Nowak",
"Robert D.",
""
]
] | TITLE: Active Ranking using Pairwise Comparisons
ABSTRACT: This paper examines the problem of ranking a collection of objects using
pairwise comparisons (rankings of two objects). In general, the ranking of $n$
objects can be identified by standard sorting methods using $n log_2 n$
pairwise comparisons. We are inte... |
1112.2679 | Tong Zhang | Xiao-Tong Yuan and Tong Zhang | Truncated Power Method for Sparse Eigenvalue Problems | null | null | null | null | stat.ML cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper considers the sparse eigenvalue problem, which is to extract
dominant (largest) sparse eigenvectors with at most $k$ non-zero components. We
propose a simple yet effective solution called truncated power method that can
approximately solve the underlying nonconvex optimization problem. A strong
sparse reco... | [
{
"version": "v1",
"created": "Mon, 12 Dec 2011 20:11:41 GMT"
}
] | 2011-12-13T00:00:00 | [
[
"Yuan",
"Xiao-Tong",
""
],
[
"Zhang",
"Tong",
""
]
] | TITLE: Truncated Power Method for Sparse Eigenvalue Problems
ABSTRACT: This paper considers the sparse eigenvalue problem, which is to extract
dominant (largest) sparse eigenvectors with at most $k$ non-zero components. We
propose a simple yet effective solution called truncated power method that can
approximately ... |
1112.1966 | Marina Sapir | Marina Sapir | Bipartite ranking algorithm for classification and survival analysis | arXiv admin note: substantial text overlap with arXiv:1108.2820 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Unsupervised aggregation of independently built univariate predictors is
explored as an alternative regularization approach for noisy, sparse datasets.
Bipartite ranking algorithm Smooth Rank implementing this approach is
introduced. The advantages of this algorithm are demonstrated on two types of
problems. First, S... | [
{
"version": "v1",
"created": "Thu, 8 Dec 2011 21:33:38 GMT"
}
] | 2011-12-12T00:00:00 | [
[
"Sapir",
"Marina",
""
]
] | TITLE: Bipartite ranking algorithm for classification and survival analysis
ABSTRACT: Unsupervised aggregation of independently built univariate predictors is
explored as an alternative regularization approach for noisy, sparse datasets.
Bipartite ranking algorithm Smooth Rank implementing this approach is
introduc... |
1112.2020 | Rui Chen | Rui Chen, Benjamin C. M. Fung, Bipin C. Desai | Differentially Private Trajectory Data Publication | null | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the increasing prevalence of location-aware devices, trajectory data has
been generated and collected in various application domains. Trajectory data
carries rich information that is useful for many data analysis tasks. Yet,
improper publishing and use of trajectory data could jeopardize individual
privacy. Howe... | [
{
"version": "v1",
"created": "Fri, 9 Dec 2011 05:19:57 GMT"
}
] | 2011-12-12T00:00:00 | [
[
"Chen",
"Rui",
""
],
[
"Fung",
"Benjamin C. M.",
""
],
[
"Desai",
"Bipin C.",
""
]
] | TITLE: Differentially Private Trajectory Data Publication
ABSTRACT: With the increasing prevalence of location-aware devices, trajectory data has
been generated and collected in various application domains. Trajectory data
carries rich information that is useful for many data analysis tasks. Yet,
improper publishin... |
1112.2027 | JaeDeok Lim | JaeDeok Lim, ByeongCheol Choi, SeungWan Han, ChoelHoon Lee | Automatic Classification of X-rated Videos using Obscene Sound Analysis
based on a Repeated Curve-like Spectrum Feature | 18 pages, 5 figures, 11 tables, IJMA(The International Journal of
Multimedia & Its Applications) | The International Journal of Multimedia & Its Applications (IJMA)
Vol.3, No.4, November 2011, pp.1-17 | null | null | cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper addresses the automatic classification of X-rated videos by
analyzing its obscene sounds. In this paper, obscene sounds refer to audio
signals generated from sexual moans and screams during sexual scenes. By
analyzing various sound samples, we determined the distinguishable
characteristics of obscene sound... | [
{
"version": "v1",
"created": "Fri, 9 Dec 2011 07:05:49 GMT"
}
] | 2011-12-12T00:00:00 | [
[
"Lim",
"JaeDeok",
""
],
[
"Choi",
"ByeongCheol",
""
],
[
"Han",
"SeungWan",
""
],
[
"Lee",
"ChoelHoon",
""
]
] | TITLE: Automatic Classification of X-rated Videos using Obscene Sound Analysis
based on a Repeated Curve-like Spectrum Feature
ABSTRACT: This paper addresses the automatic classification of X-rated videos by
analyzing its obscene sounds. In this paper, obscene sounds refer to audio
signals generated from sexual m... |
1112.2028 | Bhawna Nigam | Bhawna Nigam, Poorvi Ahirwal, Sonal Salve, Swati Vamney | Document Classification Using Expectation Maximization with Semi
Supervised Learning | null | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As the amount of online document increases, the demand for document
classification to aid the analysis and management of document is increasing.
Text is cheap, but information, in the form of knowing what classes a document
belongs to, is expensive. The main purpose of this paper is to explain the
expectation maximiz... | [
{
"version": "v1",
"created": "Fri, 9 Dec 2011 07:09:21 GMT"
}
] | 2011-12-12T00:00:00 | [
[
"Nigam",
"Bhawna",
""
],
[
"Ahirwal",
"Poorvi",
""
],
[
"Salve",
"Sonal",
""
],
[
"Vamney",
"Swati",
""
]
] | TITLE: Document Classification Using Expectation Maximization with Semi
Supervised Learning
ABSTRACT: As the amount of online document increases, the demand for document
classification to aid the analysis and management of document is increasing.
Text is cheap, but information, in the form of knowing what classes... |
1112.2031 | Yashodhara Haribhakta | Y.V. Haribhakta and Dr. Parag Kulkarni | Learning Context for Text Categorization | 9 pages, selected in IJDKP (International Journal of Data Mining and
Knowledge Management Process) | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper describes our work which is based on discovering context for text
document categorization. The document categorization approach is derived from a
combination of a learning paradigm known as relation extraction and an
technique known as context discovery. We demonstrate the effectiveness of our
categorizati... | [
{
"version": "v1",
"created": "Fri, 9 Dec 2011 07:24:13 GMT"
}
] | 2011-12-12T00:00:00 | [
[
"Haribhakta",
"Y. V.",
""
],
[
"Kulkarni",
"Dr. Parag",
""
]
] | TITLE: Learning Context for Text Categorization
ABSTRACT: This paper describes our work which is based on discovering context for text
document categorization. The document categorization approach is derived from a
combination of a learning paradigm known as relation extraction and an
technique known as context dis... |
1112.2137 | Syed Ibrahim | S.P.Syed Ibrahim and K.R.Chandran | Compact Weighted Class Association Rule Mining using Information Gain | 13 pages; International Journal of Data Mining & Knowledge Management
Process (IJDKP) Vol.1, No.6, November 2011 | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Weighted association rule mining reflects semantic significance of item by
considering its weight. Classification constructs the classifier and predicts
the new data instance. This paper proposes compact weighted class association
rule mining method, which applies weighted association rule mining in the
classificatio... | [
{
"version": "v1",
"created": "Fri, 9 Dec 2011 16:22:00 GMT"
}
] | 2011-12-12T00:00:00 | [
[
"Ibrahim",
"S. P. Syed",
""
],
[
"Chandran",
"K. R.",
""
]
] | TITLE: Compact Weighted Class Association Rule Mining using Information Gain
ABSTRACT: Weighted association rule mining reflects semantic significance of item by
considering its weight. Classification constructs the classifier and predicts
the new data instance. This paper proposes compact weighted class associatio... |
1112.1688 | Alberto Accomazzi | Alberto Accomazzi, Sebastien Derriere, Chris Biemesderfer and Norman
Gray | Why don't we already have an Integrated Framework for the Publication
and Preservation of all Data Products? | 4 pages, submitted to the ADASS XXI proceedings | null | null | null | astro-ph.IM cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Astronomy has long had a working network of archives supporting the curation
of publications and data. The discipline has already created many of the
features which perplex other areas of science: (1) data repositories:
(supra)national institutes, dedicated to large projects; a culture of
user-contributed data; pract... | [
{
"version": "v1",
"created": "Wed, 7 Dec 2011 20:58:34 GMT"
}
] | 2011-12-08T00:00:00 | [
[
"Accomazzi",
"Alberto",
""
],
[
"Derriere",
"Sebastien",
""
],
[
"Biemesderfer",
"Chris",
""
],
[
"Gray",
"Norman",
""
]
] | TITLE: Why don't we already have an Integrated Framework for the Publication
and Preservation of all Data Products?
ABSTRACT: Astronomy has long had a working network of archives supporting the curation
of publications and data. The discipline has already created many of the
features which perplex other areas of ... |
1112.1200 | Duc Phu Chau | Duc Phu Chau (INRIA Sophia Antipolis), Fran\c{c}ois Bremond (INRIA
Sophia Antipolis), Monique Thonnat (INRIA Sophia Antipolis) | A multi-feature tracking algorithm enabling adaptation to context
variations | The International Conference on Imaging for Crime Detection and
Prevention (ICDP) (2011) | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose in this paper a tracking algorithm which is able to adapt itself
to different scene contexts. A feature pool is used to compute the matching
score between two detected objects. This feature pool includes 2D, 3D
displacement distances, 2D sizes, color histogram, histogram of oriented
gradient (HOG), color c... | [
{
"version": "v1",
"created": "Tue, 6 Dec 2011 09:19:17 GMT"
}
] | 2011-12-07T00:00:00 | [
[
"Chau",
"Duc Phu",
"",
"INRIA Sophia Antipolis"
],
[
"Bremond",
"François",
"",
"INRIA\n Sophia Antipolis"
],
[
"Thonnat",
"Monique",
"",
"INRIA Sophia Antipolis"
]
] | TITLE: A multi-feature tracking algorithm enabling adaptation to context
variations
ABSTRACT: We propose in this paper a tracking algorithm which is able to adapt itself
to different scene contexts. A feature pool is used to compute the matching
score between two detected objects. This feature pool includes 2D, 3... |
1112.0750 | Massimo Brescia Dr | M. Brescia, S. Cavuoti, R. D'Abrusco, O. Laurino, G. Longo | DAME: A Distributed Data Mining & Exploration Framework within the
Virtual Observatory | 20 pages, INGRID 2010 - 5th International Workshop on Distributed
Cooperative Laboratories: "Instrumenting" the Grid, May 12-14, 2010, Poznan,
Poland; Volume Remote Instrumentation for eScience and Related Aspects, 2011,
F. Davoli et al. (eds.), SPRINGER NY | null | null | null | astro-ph.IM cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Nowadays, many scientific areas share the same broad requirements of being
able to deal with massive and distributed datasets while, when possible, being
integrated with services and applications. In order to solve the growing gap
between the incremental generation of data and our understanding of it, it is
required ... | [
{
"version": "v1",
"created": "Sun, 4 Dec 2011 13:06:35 GMT"
}
] | 2011-12-06T00:00:00 | [
[
"Brescia",
"M.",
""
],
[
"Cavuoti",
"S.",
""
],
[
"D'Abrusco",
"R.",
""
],
[
"Laurino",
"O.",
""
],
[
"Longo",
"G.",
""
]
] | TITLE: DAME: A Distributed Data Mining & Exploration Framework within the
Virtual Observatory
ABSTRACT: Nowadays, many scientific areas share the same broad requirements of being
able to deal with massive and distributed datasets while, when possible, being
integrated with services and applications. In order to s... |
1111.7295 | Prateek Jain | Raajay Viswanathan, Prateek Jain, Srivatsan Laxman, Arvind Arasu | A Learning Framework for Self-Tuning Histograms | Submitted to VLDB-2012 | null | null | null | cs.DB cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we consider the problem of estimating self-tuning histograms
using query workloads. To this end, we propose a general learning theoretic
formulation. Specifically, we use query feedback from a workload as training
data to estimate a histogram with a small memory footprint that minimizes the
expected er... | [
{
"version": "v1",
"created": "Wed, 30 Nov 2011 20:17:29 GMT"
},
{
"version": "v2",
"created": "Fri, 2 Dec 2011 16:01:50 GMT"
}
] | 2011-12-05T00:00:00 | [
[
"Viswanathan",
"Raajay",
""
],
[
"Jain",
"Prateek",
""
],
[
"Laxman",
"Srivatsan",
""
],
[
"Arasu",
"Arvind",
""
]
] | TITLE: A Learning Framework for Self-Tuning Histograms
ABSTRACT: In this paper, we consider the problem of estimating self-tuning histograms
using query workloads. To this end, we propose a general learning theoretic
formulation. Specifically, we use query feedback from a workload as training
data to estimate a his... |
1112.0059 | Sancho McCann | Sancho McCann, David G. Lowe | Local Naive Bayes Nearest Neighbor for Image Classification | null | null | null | TR-2011-11 | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present Local Naive Bayes Nearest Neighbor, an improvement to the NBNN
image classification algorithm that increases classification accuracy and
improves its ability to scale to large numbers of object classes. The key
observation is that only the classes represented in the local neighborhood of a
descriptor contr... | [
{
"version": "v1",
"created": "Thu, 1 Dec 2011 01:19:08 GMT"
}
] | 2011-12-02T00:00:00 | [
[
"McCann",
"Sancho",
""
],
[
"Lowe",
"David G.",
""
]
] | TITLE: Local Naive Bayes Nearest Neighbor for Image Classification
ABSTRACT: We present Local Naive Bayes Nearest Neighbor, an improvement to the NBNN
image classification algorithm that increases classification accuracy and
improves its ability to scale to large numbers of object classes. The key
observation is th... |
1112.0248 | Roberto Iuppa | Roberto Iuppa | A needlet-based approach to the full-sky data analysis | 6 pages, 8 figures, eConf C110509 | null | null | null | astro-ph.HE astro-ph.IM physics.data-an | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In cosmic-ray physics, large field of view experiments are triggered by a
number of signals laying on different angular scales: point-like and extended
gamma-ray sources, diffuse emissions, as well as large and intermediate scale
cosmic-ray anisotropies. The separation of all these contributions is crucial,
mostly wh... | [
{
"version": "v1",
"created": "Thu, 1 Dec 2011 17:26:36 GMT"
}
] | 2011-12-02T00:00:00 | [
[
"Iuppa",
"Roberto",
""
]
] | TITLE: A needlet-based approach to the full-sky data analysis
ABSTRACT: In cosmic-ray physics, large field of view experiments are triggered by a
number of signals laying on different angular scales: point-like and extended
gamma-ray sources, diffuse emissions, as well as large and intermediate scale
cosmic-ray ani... |
1111.7165 | Sayan Ranu | Sayan Ranu, Ambuj K. Singh | Answering Top-k Queries Over a Mixture of Attractive and Repulsive
Dimensions | VLDB2012 | Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 3, pp.
169-180 (2011) | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we formulate a top-k query that compares objects in a database
to a user-provided query object on a novel scoring function. The proposed
scoring function combines the idea of attractive and repulsive dimensions into
a general framework to overcome the weakness of traditional distance or
similarity meas... | [
{
"version": "v1",
"created": "Wed, 30 Nov 2011 14:09:11 GMT"
}
] | 2011-12-01T00:00:00 | [
[
"Ranu",
"Sayan",
""
],
[
"Singh",
"Ambuj K.",
""
]
] | TITLE: Answering Top-k Queries Over a Mixture of Attractive and Repulsive
Dimensions
ABSTRACT: In this paper, we formulate a top-k query that compares objects in a database
to a user-provided query object on a novel scoring function. The proposed
scoring function combines the idea of attractive and repulsive dime... |
1111.7171 | Guoliang Li | Guoliang Li, Dong Deng, Jiannan Wang, Jianhua Feng | PASS-JOIN: A Partition-based Method for Similarity Joins | VLDB2012 | Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 3, pp.
253-264 (2011) | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As an essential operation in data cleaning, the similarity join has attracted
considerable attention from the database community. In this paper, we study
string similarity joins with edit-distance constraints, which find similar
string pairs from two large sets of strings whose edit distance is within a
given thresho... | [
{
"version": "v1",
"created": "Wed, 30 Nov 2011 14:12:22 GMT"
}
] | 2011-12-01T00:00:00 | [
[
"Li",
"Guoliang",
""
],
[
"Deng",
"Dong",
""
],
[
"Wang",
"Jiannan",
""
],
[
"Feng",
"Jianhua",
""
]
] | TITLE: PASS-JOIN: A Partition-based Method for Similarity Joins
ABSTRACT: As an essential operation in data cleaning, the similarity join has attracted
considerable attention from the database community. In this paper, we study
string similarity joins with edit-distance constraints, which find similar
string pairs ... |
1111.6661 | Amr Hassan | A. H. Hassan, C. J. Fluke, and D. G. Barnes | Unleashing the Power of Distributed CPU/GPU Architectures: Massive
Astronomical Data Analysis and Visualization case study | 4 Pages, 1 figures, To appear in the proceedings of ADASS XXI, ed.
P.Ballester and D.Egret, ASP Conf. Series | null | null | null | astro-ph.IM cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Upcoming and future astronomy research facilities will systematically
generate terabyte-sized data sets moving astronomy into the Petascale data era.
While such facilities will provide astronomers with unprecedented levels of
accuracy and coverage, the increases in dataset size and dimensionality will
pose serious co... | [
{
"version": "v1",
"created": "Tue, 29 Nov 2011 01:34:45 GMT"
}
] | 2011-11-30T00:00:00 | [
[
"Hassan",
"A. H.",
""
],
[
"Fluke",
"C. J.",
""
],
[
"Barnes",
"D. G.",
""
]
] | TITLE: Unleashing the Power of Distributed CPU/GPU Architectures: Massive
Astronomical Data Analysis and Visualization case study
ABSTRACT: Upcoming and future astronomy research facilities will systematically
generate terabyte-sized data sets moving astronomy into the Petascale data era.
While such facilities wi... |
1111.6677 | Chengfang Fang | Chengfang Fang and Ee-Chien Chang | Publishing Location Dataset Differential Privately with Isotonic
Regression | null | null | null | null | cs.CR cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of publishing location datasets, in particular 2D
spatial pointsets, in a differentially private manner. Many existing mechanisms
focus on frequency counts of the points in some a priori partition of the
domain that is difficult to determine. We propose an approach that adds noise
directly to ... | [
{
"version": "v1",
"created": "Tue, 29 Nov 2011 03:18:16 GMT"
}
] | 2011-11-30T00:00:00 | [
[
"Fang",
"Chengfang",
""
],
[
"Chang",
"Ee-Chien",
""
]
] | TITLE: Publishing Location Dataset Differential Privately with Isotonic
Regression
ABSTRACT: We consider the problem of publishing location datasets, in particular 2D
spatial pointsets, in a differentially private manner. Many existing mechanisms
focus on frequency counts of the points in some a priori partition ... |
1111.6553 | Jan P\"oschko | Jan P\"oschko | Exploring Twitter Hashtags | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Twitter messages often contain so-called hashtags to denote keywords related
to them. Using a dataset of 29 million messages, I explore relations among
these hashtags with respect to co-occurrences. Furthermore, I present an
attempt to classify hashtags into five intuitive classes, using a
machine-learning approach. ... | [
{
"version": "v1",
"created": "Mon, 28 Nov 2011 19:17:57 GMT"
}
] | 2011-11-29T00:00:00 | [
[
"Pöschko",
"Jan",
""
]
] | TITLE: Exploring Twitter Hashtags
ABSTRACT: Twitter messages often contain so-called hashtags to denote keywords related
to them. Using a dataset of 29 million messages, I explore relations among
these hashtags with respect to co-occurrences. Furthermore, I present an
attempt to classify hashtags into five intuitiv... |
1111.5648 | David Balduzzi | David Balduzzi | Falsification and future performance | 10 pages, 2 figures | null | null | null | stat.ML cs.IT cs.LG math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We information-theoretically reformulate two measures of capacity from
statistical learning theory: empirical VC-entropy and empirical Rademacher
complexity. We show these capacity measures count the number of hypotheses
about a dataset that a learning algorithm falsifies when it finds the
classifier in its repertoir... | [
{
"version": "v1",
"created": "Wed, 23 Nov 2011 23:25:57 GMT"
}
] | 2011-11-28T00:00:00 | [
[
"Balduzzi",
"David",
""
]
] | TITLE: Falsification and future performance
ABSTRACT: We information-theoretically reformulate two measures of capacity from
statistical learning theory: empirical VC-entropy and empirical Rademacher
complexity. We show these capacity measures count the number of hypotheses
about a dataset that a learning algorithm... |
1106.1813 | K. W. Bowyer | N. V. Chawla, K. W. Bowyer, L. O. Hall, W. P. Kegelmeyer | SMOTE: Synthetic Minority Over-sampling Technique | null | Journal Of Artificial Intelligence Research, Volume 16, pages
321-357, 2002 | 10.1613/jair.953 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An approach to the construction of classifiers from imbalanced datasets is
described. A dataset is imbalanced if the classification categories are not
approximately equally represented. Often real-world data sets are predominately
composed of "normal" examples with only a small percentage of "abnormal" or
"interestin... | [
{
"version": "v1",
"created": "Thu, 9 Jun 2011 13:53:42 GMT"
}
] | 2011-11-25T00:00:00 | [
[
"Chawla",
"N. V.",
""
],
[
"Bowyer",
"K. W.",
""
],
[
"Hall",
"L. O.",
""
],
[
"Kegelmeyer",
"W. P.",
""
]
] | TITLE: SMOTE: Synthetic Minority Over-sampling Technique
ABSTRACT: An approach to the construction of classifiers from imbalanced datasets is
described. A dataset is imbalanced if the classification categories are not
approximately equally represented. Often real-world data sets are predominately
composed of "norma... |
1111.5572 | Matei Zaharia | Matei Zaharia, William J. Bolosky, Kristal Curtis, Armando Fox, David
Patterson, Scott Shenker, Ion Stoica, Richard M. Karp, Taylor Sittler | Faster and More Accurate Sequence Alignment with SNAP | null | null | null | null | cs.DS q-bio.GN | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present the Scalable Nucleotide Alignment Program (SNAP), a new short and
long read aligner that is both more accurate (i.e., aligns more reads with
fewer errors) and 10-100x faster than state-of-the-art tools such as BWA.
Unlike recent aligners based on the Burrows-Wheeler transform, SNAP uses a
simple hash index... | [
{
"version": "v1",
"created": "Wed, 23 Nov 2011 17:46:03 GMT"
}
] | 2011-11-24T00:00:00 | [
[
"Zaharia",
"Matei",
""
],
[
"Bolosky",
"William J.",
""
],
[
"Curtis",
"Kristal",
""
],
[
"Fox",
"Armando",
""
],
[
"Patterson",
"David",
""
],
[
"Shenker",
"Scott",
""
],
[
"Stoica",
"Ion",
""
],
[
... | TITLE: Faster and More Accurate Sequence Alignment with SNAP
ABSTRACT: We present the Scalable Nucleotide Alignment Program (SNAP), a new short and
long read aligner that is both more accurate (i.e., aligns more reads with
fewer errors) and 10-100x faster than state-of-the-art tools such as BWA.
Unlike recent align... |
1111.5312 | Ryan Rossi | Ryan A. Rossi and Jennifer Neville | Representations and Ensemble Methods for Dynamic Relational
Classification | null | null | null | null | cs.AI cs.SI physics.soc-ph stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Temporal networks are ubiquitous and evolve over time by the addition,
deletion, and changing of links, nodes, and attributes. Although many
relational datasets contain temporal information, the majority of existing
techniques in relational learning focus on static snapshots and ignore the
temporal dynamics. We propo... | [
{
"version": "v1",
"created": "Tue, 22 Nov 2011 20:21:19 GMT"
}
] | 2011-11-23T00:00:00 | [
[
"Rossi",
"Ryan A.",
""
],
[
"Neville",
"Jennifer",
""
]
] | TITLE: Representations and Ensemble Methods for Dynamic Relational
Classification
ABSTRACT: Temporal networks are ubiquitous and evolve over time by the addition,
deletion, and changing of links, nodes, and attributes. Although many
relational datasets contain temporal information, the majority of existing
techni... |
1111.4645 | Yaniv Altshuler | Yaniv Altshuler, Nadav Aharony, Michael Fire, Yuval Elovici, Alex
Pentland | Incremental Learning with Accuracy Prediction of Social and Individual
Properties from Mobile-Phone Data | 10 pages | null | null | null | cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mobile phones are quickly becoming the primary source for social, behavioral,
and environmental sensing and data collection. Today's smartphones are equipped
with increasingly more sensors and accessible data types that enable the
collection of literally dozens of signals related to the phone, its user, and
its envir... | [
{
"version": "v1",
"created": "Sun, 20 Nov 2011 16:10:53 GMT"
}
] | 2011-11-22T00:00:00 | [
[
"Altshuler",
"Yaniv",
""
],
[
"Aharony",
"Nadav",
""
],
[
"Fire",
"Michael",
""
],
[
"Elovici",
"Yuval",
""
],
[
"Pentland",
"Alex",
""
]
] | TITLE: Incremental Learning with Accuracy Prediction of Social and Individual
Properties from Mobile-Phone Data
ABSTRACT: Mobile phones are quickly becoming the primary source for social, behavioral,
and environmental sensing and data collection. Today's smartphones are equipped
with increasingly more sensors and... |
1111.4650 | Yaniv Altshuler | Yaniv Altshuler, Wei Pan, Alex Pentland | Trends Prediction Using Social Diffusion Models | 6 Pages + Appendix | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The importance of the ability of predict trends in social media has been
growing rapidly in the past few years with the growing dominance of social
media in our everyday's life. Whereas many works focus on the detection of
anomalies in networks, there exist little theoretical work on the prediction of
the likelihood ... | [
{
"version": "v1",
"created": "Sun, 20 Nov 2011 17:09:21 GMT"
}
] | 2011-11-22T00:00:00 | [
[
"Altshuler",
"Yaniv",
""
],
[
"Pan",
"Wei",
""
],
[
"Pentland",
"Alex",
""
]
] | TITLE: Trends Prediction Using Social Diffusion Models
ABSTRACT: The importance of the ability of predict trends in social media has been
growing rapidly in the past few years with the growing dominance of social
media in our everyday's life. Whereas many works focus on the detection of
anomalies in networks, there... |
1111.3689 | Anish Das Sarma | Anish Das Sarma, Ankur Jain, Ashwin Machanavajjhala, Philip Bohannon | CBLOCK: An Automatic Blocking Mechanism for Large-Scale De-duplication
Tasks | null | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | De-duplication---identification of distinct records referring to the same
real-world entity---is a well-known challenge in data integration. Since very
large datasets prohibit the comparison of every pair of records, {\em blocking}
has been identified as a technique of dividing the dataset for pairwise
comparisons, t... | [
{
"version": "v1",
"created": "Tue, 15 Nov 2011 23:32:34 GMT"
}
] | 2011-11-17T00:00:00 | [
[
"Sarma",
"Anish Das",
""
],
[
"Jain",
"Ankur",
""
],
[
"Machanavajjhala",
"Ashwin",
""
],
[
"Bohannon",
"Philip",
""
]
] | TITLE: CBLOCK: An Automatic Blocking Mechanism for Large-Scale De-duplication
Tasks
ABSTRACT: De-duplication---identification of distinct records referring to the same
real-world entity---is a well-known challenge in data integration. Since very
large datasets prohibit the comparison of every pair of records, {\e... |
1107.2462 | Timothy Rubin | Timothy N. Rubin, America Chambers, Padhraic Smyth and Mark Steyvers | Statistical Topic Models for Multi-Label Document Classification | 44 Pages (Including Appendices). To be published in: The Machine
Learning Journal, special issue on Learning from Multi-Label Data. Version 2
corrects some typos, updates some of the notation used in the paper for
clarification of some equations, and incorporates several relatively minor
changes to the text thr... | null | null | null | stat.ML cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Machine learning approaches to multi-label document classification have to
date largely relied on discriminative modeling techniques such as support
vector machines. A drawback of these approaches is that performance rapidly
drops off as the total number of labels and the number of labels per document
increase. This ... | [
{
"version": "v1",
"created": "Wed, 13 Jul 2011 04:28:32 GMT"
},
{
"version": "v2",
"created": "Thu, 10 Nov 2011 04:24:38 GMT"
}
] | 2011-11-11T00:00:00 | [
[
"Rubin",
"Timothy N.",
""
],
[
"Chambers",
"America",
""
],
[
"Smyth",
"Padhraic",
""
],
[
"Steyvers",
"Mark",
""
]
] | TITLE: Statistical Topic Models for Multi-Label Document Classification
ABSTRACT: Machine learning approaches to multi-label document classification have to
date largely relied on discriminative modeling techniques such as support
vector machines. A drawback of these approaches is that performance rapidly
drops off... |
0707.1646 | Tam\'as Nepusz | Tam\'as Nepusz, Andrea Petr\'oczi, L\'aszl\'o N\'egyessy, F\"ul\"op
Bazs\'o | Fuzzy communities and the concept of bridgeness in complex networks | 13 pages, 9 figures. Quality of Fig. 4 reduced due to file size
considerations | Phys Rev E, 77:016107, 2008 | 10.1103/PhysRevE.77.016107 | null | physics.soc-ph | null | We consider the problem of fuzzy community detection in networks, which
complements and expands the concept of overlapping community structure. Our
approach allows each vertex of the graph to belong to multiple communities at
the same time, determined by exact numerical membership degrees, even in the
presence of unc... | [
{
"version": "v1",
"created": "Wed, 11 Jul 2007 15:34:00 GMT"
},
{
"version": "v2",
"created": "Mon, 23 Jul 2007 17:39:39 GMT"
},
{
"version": "v3",
"created": "Wed, 28 Nov 2007 18:34:41 GMT"
}
] | 2011-11-10T00:00:00 | [
[
"Nepusz",
"Tamás",
""
],
[
"Petróczi",
"Andrea",
""
],
[
"Négyessy",
"László",
""
],
[
"Bazsó",
"Fülöp",
""
]
] | TITLE: Fuzzy communities and the concept of bridgeness in complex networks
ABSTRACT: We consider the problem of fuzzy community detection in networks, which
complements and expands the concept of overlapping community structure. Our
approach allows each vertex of the graph to belong to multiple communities at
the s... |
0710.3979 | William Yurcik | William Yurcik, Clay Woolam, Greg Hellings, Latifur Khan, Bhavani
Thuraisingham | Toward Trusted Sharing of Network Packet Traces Using Anonymization:
Single-Field Privacy/Analysis Tradeoffs | 8 pages,1 figure, 4 tables | null | null | null | cs.CR cs.NI | null | Network data needs to be shared for distributed security analysis.
Anonymization of network data for sharing sets up a fundamental tradeoff
between privacy protection versus security analysis capability. This
privacy/analysis tradeoff has been acknowledged by many researchers but this is
the first paper to provide em... | [
{
"version": "v1",
"created": "Mon, 22 Oct 2007 19:18:11 GMT"
},
{
"version": "v2",
"created": "Fri, 26 Oct 2007 14:55:08 GMT"
}
] | 2011-11-10T00:00:00 | [
[
"Yurcik",
"William",
""
],
[
"Woolam",
"Clay",
""
],
[
"Hellings",
"Greg",
""
],
[
"Khan",
"Latifur",
""
],
[
"Thuraisingham",
"Bhavani",
""
]
] | TITLE: Toward Trusted Sharing of Network Packet Traces Using Anonymization:
Single-Field Privacy/Analysis Tradeoffs
ABSTRACT: Network data needs to be shared for distributed security analysis.
Anonymization of network data for sharing sets up a fundamental tradeoff
between privacy protection versus security analy... |
1111.2092 | Sanmay Das | Sanmay Das, Allen Lavoie, and Malik Magdon-Ismail | Pushing Your Point of View: Behavioral Measures of Manipulation in
Wikipedia | null | null | null | null | cs.SI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As a major source for information on virtually any topic, Wikipedia serves an
important role in public dissemination and consumption of knowledge. As a
result, it presents tremendous potential for people to promulgate their own
points of view; such efforts may be more subtle than typical vandalism. In this
paper, we ... | [
{
"version": "v1",
"created": "Wed, 9 Nov 2011 03:22:16 GMT"
}
] | 2011-11-10T00:00:00 | [
[
"Das",
"Sanmay",
""
],
[
"Lavoie",
"Allen",
""
],
[
"Magdon-Ismail",
"Malik",
""
]
] | TITLE: Pushing Your Point of View: Behavioral Measures of Manipulation in
Wikipedia
ABSTRACT: As a major source for information on virtually any topic, Wikipedia serves an
important role in public dissemination and consumption of knowledge. As a
result, it presents tremendous potential for people to promulgate th... |
q-bio/0603007 | Francesc Rossell\'o | Jairo Rocha, Francesc Rossell\'o, Joan Segura | Compression ratios based on the Universal Similarity Metric still yield
protein distances far from CATH distances | 11 pages; It replaces the former "The Universal Similarity Metric
does not detect domain similarity." This version reports on more extensive
tests | null | null | null | q-bio.QM cs.CE physics.data-an q-bio.OT | null | Kolmogorov complexity has inspired several alignment-free distance measures,
based on the comparison of lengths of compressions, which have been applied
successfully in many areas. One of these measures, the so-called Universal
Similarity Metric (USM), has been used by Krasnogor and Pelta to compare simple
protein co... | [
{
"version": "v1",
"created": "Mon, 6 Mar 2006 12:00:41 GMT"
},
{
"version": "v2",
"created": "Fri, 20 Oct 2006 09:35:04 GMT"
}
] | 2011-11-10T00:00:00 | [
[
"Rocha",
"Jairo",
""
],
[
"Rosselló",
"Francesc",
""
],
[
"Segura",
"Joan",
""
]
] | TITLE: Compression ratios based on the Universal Similarity Metric still yield
protein distances far from CATH distances
ABSTRACT: Kolmogorov complexity has inspired several alignment-free distance measures,
based on the comparison of lengths of compressions, which have been applied
successfully in many areas. On... |
1111.2018 | Lionel Tabourier | Bivas Mitra, Lionel Tabourier and Camille Roth | Intrinsically Dynamic Network Communities | 27 pages, 11 figures | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Community finding algorithms for networks have recently been extended to
dynamic data. Most of these recent methods aim at exhibiting community
partitions from successive graph snapshots and thereafter connecting or
smoothing these partitions using clever time-dependent features and sampling
techniques. These approac... | [
{
"version": "v1",
"created": "Tue, 8 Nov 2011 19:12:43 GMT"
}
] | 2011-11-09T00:00:00 | [
[
"Mitra",
"Bivas",
""
],
[
"Tabourier",
"Lionel",
""
],
[
"Roth",
"Camille",
""
]
] | TITLE: Intrinsically Dynamic Network Communities
ABSTRACT: Community finding algorithms for networks have recently been extended to
dynamic data. Most of these recent methods aim at exhibiting community
partitions from successive graph snapshots and thereafter connecting or
smoothing these partitions using clever t... |
nlin/0609042 | Haluk Bingol | Amac Herdagdelen, Eser Aygun, Haluk Bingol | A Formal Treatment of Generalized Preferential Attachment and its
Empirical Validation | null | EPL 78 No 6 (June 2007) 60007 | 10.1209/0295-5075/78/60007 | null | nlin.AO cond-mat.stat-mech cs.CY physics.data-an | null | Generalized preferential attachment is defined as the tendency of a vertex to
acquire new links in the future with respect to a particular vertex property.
Understanding which properties influence link acquisition tendency (LAT) gives
us a predictive power to estimate the future growth of network and insight
about th... | [
{
"version": "v1",
"created": "Fri, 15 Sep 2006 20:08:23 GMT"
},
{
"version": "v2",
"created": "Mon, 16 Jul 2007 17:09:44 GMT"
}
] | 2011-11-09T00:00:00 | [
[
"Herdagdelen",
"Amac",
""
],
[
"Aygun",
"Eser",
""
],
[
"Bingol",
"Haluk",
""
]
] | TITLE: A Formal Treatment of Generalized Preferential Attachment and its
Empirical Validation
ABSTRACT: Generalized preferential attachment is defined as the tendency of a vertex to
acquire new links in the future with respect to a particular vertex property.
Understanding which properties influence link acquisit... |
1111.1562 | Mahmoud Yassien Shams el den Eng | M. Y. Shams, M. Z. Rashad, O. Nomir, and R. M. El-Awady | Iris Recognition Based on LBP and Combined LVQ Classifier | 12 Pages, 12 Figures | International Journal of Computer Science & Information Technology
(IJCSIT) Vol 3, No 5, Oct 2011 | 10.5121/ijcsit.2011.3506 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Iris recognition is considered as one of the best biometric methods used for
human identification and verification, this is because of its unique features
that differ from one person to another, and its importance in the security
field. This paper proposes an algorithm for iris recognition and classification
using a ... | [
{
"version": "v1",
"created": "Mon, 7 Nov 2011 12:35:29 GMT"
}
] | 2011-11-08T00:00:00 | [
[
"Shams",
"M. Y.",
""
],
[
"Rashad",
"M. Z.",
""
],
[
"Nomir",
"O.",
""
],
[
"El-Awady",
"R. M.",
""
]
] | TITLE: Iris Recognition Based on LBP and Combined LVQ Classifier
ABSTRACT: Iris recognition is considered as one of the best biometric methods used for
human identification and verification, this is because of its unique features
that differ from one person to another, and its importance in the security
field. This... |
1111.0045 | I. Bhattacharya | I. Bhattacharya, L. Getoor | Query-time Entity Resolution | null | Journal Of Artificial Intelligence Research, Volume 30, pages
621-657, 2007 | 10.1613/jair.2290 | null | cs.DB cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Entity resolution is the problem of reconciling database references
corresponding to the same real-world entities. Given the abundance of publicly
available databases that have unresolved entities, we motivate the problem of
query-time entity resolution quick and accurate resolution for answering
queries over such un... | [
{
"version": "v1",
"created": "Mon, 31 Oct 2011 21:48:16 GMT"
}
] | 2011-11-02T00:00:00 | [
[
"Bhattacharya",
"I.",
""
],
[
"Getoor",
"L.",
""
]
] | TITLE: Query-time Entity Resolution
ABSTRACT: Entity resolution is the problem of reconciling database references
corresponding to the same real-world entities. Given the abundance of publicly
available databases that have unresolved entities, we motivate the problem of
query-time entity resolution quick and accura... |
1111.0051 | George M. Coghill | George M. Coghill, Ross D. King, Ashwin Srinivasan | Qualitative System Identification from Imperfect Data | null | Journal Of Artificial Intelligence Research, Volume 32, pages
825-877, 2008 | 10.1613/jair.2374 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Experience in the physical sciences suggests that the only realistic means of
understanding complex systems is through the use of mathematical models.
Typically, this has come to mean the identification of quantitative models
expressed as differential equations. Quantitative modelling works best when the
structure of... | [
{
"version": "v1",
"created": "Mon, 31 Oct 2011 22:02:30 GMT"
}
] | 2011-11-02T00:00:00 | [
[
"Coghill",
"George M.",
""
],
[
"King",
"Ross D.",
""
],
[
"Srinivasan",
"Ashwin",
""
]
] | TITLE: Qualitative System Identification from Imperfect Data
ABSTRACT: Experience in the physical sciences suggests that the only realistic means of
understanding complex systems is through the use of mathematical models.
Typically, this has come to mean the identification of quantitative models
expressed as differ... |
1111.0158 | Sanaa Elyassami | Sanaa Elyassami and Ali Idri | Applying Fuzzy ID3 Decision Tree for Software Effort Estimation | null | IJCSI International Journal of Computer Science Issues, Vol. 8,
Issue 4, No 1, 131-138 (2011) | null | null | cs.SE cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Web Effort Estimation is a process of predicting the efforts and cost in
terms of money, schedule and staff for any software project system. Many
estimation models have been proposed over the last three decades and it is
believed that it is a must for the purpose of: Budgeting, risk analysis,
project planning and con... | [
{
"version": "v1",
"created": "Tue, 1 Nov 2011 09:58:08 GMT"
}
] | 2011-11-02T00:00:00 | [
[
"Elyassami",
"Sanaa",
""
],
[
"Idri",
"Ali",
""
]
] | TITLE: Applying Fuzzy ID3 Decision Tree for Software Effort Estimation
ABSTRACT: Web Effort Estimation is a process of predicting the efforts and cost in
terms of money, schedule and staff for any software project system. Many
estimation models have been proposed over the last three decades and it is
believed that ... |
1107.3350 | Yang Li Daniel | Yang D. Li, Zhenjie Zhang, Marianne Winslett, Yin Yang | Compressive Mechanism: Utilizing Sparse Representation in Differential
Privacy | 20 pages, 6 figures | WPES '11 Proceedings of the 10th annual ACM workshop on Privacy in
the electronic society ACM New York, NY, USA (2011), pages 177-182 | 10.1145/2046556.2046581 | null | cs.DS cs.CR cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Differential privacy provides the first theoretical foundation with provable
privacy guarantee against adversaries with arbitrary prior knowledge. The main
idea to achieve differential privacy is to inject random noise into statistical
query results. Besides correctness, the most important goal in the design of a
dif... | [
{
"version": "v1",
"created": "Mon, 18 Jul 2011 03:20:58 GMT"
}
] | 2011-11-01T00:00:00 | [
[
"Li",
"Yang D.",
""
],
[
"Zhang",
"Zhenjie",
""
],
[
"Winslett",
"Marianne",
""
],
[
"Yang",
"Yin",
""
]
] | TITLE: Compressive Mechanism: Utilizing Sparse Representation in Differential
Privacy
ABSTRACT: Differential privacy provides the first theoretical foundation with provable
privacy guarantee against adversaries with arbitrary prior knowledge. The main
idea to achieve differential privacy is to inject random noise... |
1110.6649 | Feifei Li | Jeffrey Jestes, Ke Yi, Feifei Li | Building Wavelet Histograms on Large Data in MapReduce | VLDB2012 | Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 2, pp.
109-120 (2011) | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | MapReduce is becoming the de facto framework for storing and processing
massive data, due to its excellent scalability, reliability, and elasticity. In
many MapReduce applications, obtaining a compact accurate summary of data is
essential. Among various data summarization tools, histograms have proven to be
particula... | [
{
"version": "v1",
"created": "Sun, 30 Oct 2011 20:21:30 GMT"
}
] | 2011-11-01T00:00:00 | [
[
"Jestes",
"Jeffrey",
""
],
[
"Yi",
"Ke",
""
],
[
"Li",
"Feifei",
""
]
] | TITLE: Building Wavelet Histograms on Large Data in MapReduce
ABSTRACT: MapReduce is becoming the de facto framework for storing and processing
massive data, due to its excellent scalability, reliability, and elasticity. In
many MapReduce applications, obtaining a compact accurate summary of data is
essential. Amon... |
1110.6652 | Guimei Liu | Guimei Liu, Haojun Zhang, Limsoon Wong | Controlling False Positives in Association Rule Mining | VLDB2012 | Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 2, pp.
145-156 (2011) | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Association rule mining is an important problem in the data mining area. It
enumerates and tests a large number of rules on a dataset and outputs rules
that satisfy user-specified constraints. Due to the large number of rules being
tested, rules that do not represent real systematic effect in the data can
satisfy the... | [
{
"version": "v1",
"created": "Sun, 30 Oct 2011 20:22:00 GMT"
}
] | 2011-11-01T00:00:00 | [
[
"Liu",
"Guimei",
""
],
[
"Zhang",
"Haojun",
""
],
[
"Wong",
"Limsoon",
""
]
] | TITLE: Controlling False Positives in Association Rule Mining
ABSTRACT: Association rule mining is an important problem in the data mining area. It
enumerates and tests a large number of rules on a dataset and outputs rules
that satisfy user-specified constraints. Due to the large number of rules being
tested, rule... |
1002.4058 | Lev Reyzin | Alina Beygelzimer, John Langford, Lihong Li, Lev Reyzin, and Robert E.
Schapire | Contextual Bandit Algorithms with Supervised Learning Guarantees | 10 pages | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We address the problem of learning in an online, bandit setting where the
learner must repeatedly select among $K$ actions, but only receives partial
feedback based on its choices. We establish two new facts: First, using a new
algorithm called Exp4.P, we show that it is possible to compete with the best
in a set of ... | [
{
"version": "v1",
"created": "Mon, 22 Feb 2010 07:11:39 GMT"
},
{
"version": "v2",
"created": "Wed, 7 Jul 2010 21:25:22 GMT"
},
{
"version": "v3",
"created": "Thu, 27 Oct 2011 19:28:49 GMT"
}
] | 2011-10-28T00:00:00 | [
[
"Beygelzimer",
"Alina",
""
],
[
"Langford",
"John",
""
],
[
"Li",
"Lihong",
""
],
[
"Reyzin",
"Lev",
""
],
[
"Schapire",
"Robert E.",
""
]
] | TITLE: Contextual Bandit Algorithms with Supervised Learning Guarantees
ABSTRACT: We address the problem of learning in an online, bandit setting where the
learner must repeatedly select among $K$ actions, but only receives partial
feedback based on its choices. We establish two new facts: First, using a new
algori... |
1110.5688 | Nicholas M. Ball | Nicholas M. Ball (Herzberg Institute of Astrophysics, Victoria, BC,
Canada) | Discussion on "Techniques for Massive-Data Machine Learning in
Astronomy" by A. Gray | 6 pages, 1 figure. Invited commentary, Statistical Challenges in
Modern Astronomy V, Penn State, Jun 2011 | null | null | null | astro-ph.IM astro-ph.CO cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Astronomy is increasingly encountering two fundamental truths: (1) The field
is faced with the task of extracting useful information from extremely large,
complex, and high dimensional datasets; (2) The techniques of astroinformatics
and astrostatistics are the only way to make this tractable, and bring the
required ... | [
{
"version": "v1",
"created": "Wed, 26 Oct 2011 00:22:36 GMT"
}
] | 2011-10-28T00:00:00 | [
[
"Ball",
"Nicholas M.",
"",
"Herzberg Institute of Astrophysics, Victoria, BC,\n Canada"
]
] | TITLE: Discussion on "Techniques for Massive-Data Machine Learning in
Astronomy" by A. Gray
ABSTRACT: Astronomy is increasingly encountering two fundamental truths: (1) The field
is faced with the task of extracting useful information from extremely large,
complex, and high dimensional datasets; (2) The technique... |
1110.4723 | Xinran He | Xinran He, Guojie Song, Wei Chen, Qingye Jiang | Influence Blocking Maximization in Social Networks under the Competitive
Linear Threshold Model Technical Report | Full version technical report of Paper "Influence Blocking
Maximization in Social Networks under the Competitive Linear Threshold Model"
which has been submitted to SDM2012. 14 pages | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In many real-world situations, different and often opposite opinions,
innovations, or products are competing with one another for their social
influence in a networked society. In this paper, we study competitive influence
propagation in social networks under the competitive linear threshold (CLT)
model, an extension... | [
{
"version": "v1",
"created": "Fri, 21 Oct 2011 07:59:37 GMT"
}
] | 2011-10-24T00:00:00 | [
[
"He",
"Xinran",
""
],
[
"Song",
"Guojie",
""
],
[
"Chen",
"Wei",
""
],
[
"Jiang",
"Qingye",
""
]
] | TITLE: Influence Blocking Maximization in Social Networks under the Competitive
Linear Threshold Model Technical Report
ABSTRACT: In many real-world situations, different and often opposite opinions,
innovations, or products are competing with one another for their social
influence in a networked society. In this... |
1110.4474 | Sebastiano Vigna | Paolo Boldi, Marco Rosa, Sebastiano Vigna | Robustness of Social Networks: Comparative Results Based on Distance
Distributions | null | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a social network, which of its nodes have a stronger impact in
determining its structure? More formally: which node-removal order has the
greatest impact on the network structure? We approach this well-known problem
for the first time in a setting that combines both web graphs and social
networks, using dataset... | [
{
"version": "v1",
"created": "Thu, 20 Oct 2011 08:49:01 GMT"
}
] | 2011-10-21T00:00:00 | [
[
"Boldi",
"Paolo",
""
],
[
"Rosa",
"Marco",
""
],
[
"Vigna",
"Sebastiano",
""
]
] | TITLE: Robustness of Social Networks: Comparative Results Based on Distance
Distributions
ABSTRACT: Given a social network, which of its nodes have a stronger impact in
determining its structure? More formally: which node-removal order has the
greatest impact on the network structure? We approach this well-known ... |
1110.4278 | Marina Sokol | Konstantin Avrachenkov (INRIA Sophia Antipolis), Paulo Gon\c{c}alves
(LIP), Alexey Mishenin, Marina Sokol (INRIA Sophia Antipolis) | Generalized Optimization Framework for Graph-based Semi-supervised
Learning | null | null | null | RR-7774 | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We develop a generalized optimization framework for graph-based
semi-supervised learning. The framework gives as particular cases the Standard
Laplacian, Normalized Laplacian and PageRank based methods. We have also
provided new probabilistic interpretation based on random walks and
characterized the limiting behavio... | [
{
"version": "v1",
"created": "Wed, 19 Oct 2011 13:29:32 GMT"
}
] | 2011-10-20T00:00:00 | [
[
"Avrachenkov",
"Konstantin",
"",
"INRIA Sophia Antipolis"
],
[
"Gonçalves",
"Paulo",
"",
"LIP"
],
[
"Mishenin",
"Alexey",
"",
"INRIA Sophia Antipolis"
],
[
"Sokol",
"Marina",
"",
"INRIA Sophia Antipolis"
]
] | TITLE: Generalized Optimization Framework for Graph-based Semi-supervised
Learning
ABSTRACT: We develop a generalized optimization framework for graph-based
semi-supervised learning. The framework gives as particular cases the Standard
Laplacian, Normalized Laplacian and PageRank based methods. We have also
provi... |
1110.4012 | Maria Emilia Ruiz | M. E. Ruiz (Instituto de Astronom\'ia y F\'isica del Espacio
(CONICET-Universidad de Buenos Aires), Argentina), S. Dasso (Instituto de
Astronom\'ia y F\'isica del Espacio (CONICET-Universidad de Buenos Aires) and
Departamento de F\'isica, Facultad de Ciencias Exactas y Naturales,
Universidad de Buenos Aires, Ar... | Aging of anisotropy of solar wind magnetic fluctuations in the inner
heliosphere | Published | J. Geophys. Res., 116, (2011) A10102 | 10.1029/2011JA016697 | null | astro-ph.SR physics.space-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We analyze the evolution of the interplanetary magnetic field spatial
structure by examining the inner heliospheric autocorrelation function, using
Helios 1 and Helios 2 "in situ" observations. We focus on the evolution of the
integral length scale (\lambda) anisotropy associated with the turbulent
magnetic fluctuati... | [
{
"version": "v1",
"created": "Tue, 18 Oct 2011 14:59:23 GMT"
}
] | 2011-10-19T00:00:00 | [
[
"Ruiz",
"M. E.",
"",
"Instituto de Astronomía y Física del Espacio"
],
[
"Dasso",
"S.",
"",
"Instituto de\n Astronomía y Física del Espacio"
],
[
"Matthaeus",
"W. H.",
"",
"Department of\n Geography, Bartol Research Institute, University of Delaware, Newar... | TITLE: Aging of anisotropy of solar wind magnetic fluctuations in the inner
heliosphere
ABSTRACT: We analyze the evolution of the interplanetary magnetic field spatial
structure by examining the inner heliospheric autocorrelation function, using
Helios 1 and Helios 2 "in situ" observations. We focus on the evolut... |
1006.2322 | Yoshiharu Maeno | Yoshiharu Maeno | Discovery of a missing disease spreader | in press | Physica A vol.390, pp.3412-3426 (2011) | 10.1016/j.physa.2011.05.005 | null | cs.AI cs.SI physics.bio-ph physics.soc-ph q-bio.PE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This study presents a method to discover an outbreak of an infectious disease
in a region for which data are missing, but which is at work as a disease
spreader. Node discovery for the spread of an infectious disease is defined as
discriminating between the nodes which are neighboring to a missing disease
spreader no... | [
{
"version": "v1",
"created": "Fri, 11 Jun 2010 14:33:18 GMT"
},
{
"version": "v2",
"created": "Mon, 27 Sep 2010 13:49:21 GMT"
},
{
"version": "v3",
"created": "Mon, 20 Dec 2010 13:39:48 GMT"
},
{
"version": "v4",
"created": "Thu, 9 Jun 2011 07:09:13 GMT"
}
] | 2011-10-18T00:00:00 | [
[
"Maeno",
"Yoshiharu",
""
]
] | TITLE: Discovery of a missing disease spreader
ABSTRACT: This study presents a method to discover an outbreak of an infectious disease
in a region for which data are missing, but which is at work as a disease
spreader. Node discovery for the spread of an infectious disease is defined as
discriminating between the n... |
1110.3569 | Rahmat Widia Sembiring | Rahmat Widia Sembiring, Jasni Mohamad Zain, Abdullah Embong | Dimension Reduction of Health Data Clustering | 10 pages, 9 figures, published at International Journal on New
Computer Architectures and Their Applications (IJNCAA) | International Journal on New Computer Architectures and Their
Applications (IJNCAA), 2011, Vol.1, No.4, 1041-1050 | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The current data tends to be more complex than conventional data and need
dimension reduction. Dimension reduction is important in cluster analysis and
creates a smaller data in volume and has the same analytical results as the
original representation. A clustering process needs data reduction to obtain an
efficient ... | [
{
"version": "v1",
"created": "Mon, 17 Oct 2011 03:40:07 GMT"
}
] | 2011-10-18T00:00:00 | [
[
"Sembiring",
"Rahmat Widia",
""
],
[
"Zain",
"Jasni Mohamad",
""
],
[
"Embong",
"Abdullah",
""
]
] | TITLE: Dimension Reduction of Health Data Clustering
ABSTRACT: The current data tends to be more complex than conventional data and need
dimension reduction. Dimension reduction is important in cluster analysis and
creates a smaller data in volume and has the same analytical results as the
original representation. ... |
1011.1043 | Xin Liu | Xin Liu and Tsuyoshi Murata | Detecting Communities in Tripartite Hypergraphs | 4 pages, 3 figures | Journal of Computer Science and Technology, vol.26, no.5,
pp.778-791, Sep 2011 | 10.1007/s11390-011-0177-0 | vol.26, no.5, pp.778-791 | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In social tagging systems, also known as folksonomies, users collaboratively
manage tags to annotate resources. Naturally, social tagging systems can be
modeled as a tripartite hypergraph, where there are three different types of
nodes, namely users, resources and tags, and each hyperedge has three end
nodes, connect... | [
{
"version": "v1",
"created": "Thu, 4 Nov 2010 01:24:07 GMT"
}
] | 2011-10-17T00:00:00 | [
[
"Liu",
"Xin",
""
],
[
"Murata",
"Tsuyoshi",
""
]
] | TITLE: Detecting Communities in Tripartite Hypergraphs
ABSTRACT: In social tagging systems, also known as folksonomies, users collaboratively
manage tags to annotate resources. Naturally, social tagging systems can be
modeled as a tripartite hypergraph, where there are three different types of
nodes, namely users, ... |
1110.2162 | Ruben Sipos | Ruben Sipos, Pannaga Shivaswamy, Thorsten Joachims | Large-Margin Learning of Submodular Summarization Methods | update: improved formatting (figure placement) and algorithm
pseudocode clarity (Fig. 3) | null | null | null | cs.AI cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we present a supervised learning approach to training
submodular scoring functions for extractive multi-document summarization. By
taking a structured predicition approach, we provide a large-margin method that
directly optimizes a convex relaxation of the desired performance measure. The
learning meth... | [
{
"version": "v1",
"created": "Mon, 10 Oct 2011 19:54:57 GMT"
},
{
"version": "v2",
"created": "Thu, 13 Oct 2011 17:51:20 GMT"
}
] | 2011-10-14T00:00:00 | [
[
"Sipos",
"Ruben",
""
],
[
"Shivaswamy",
"Pannaga",
""
],
[
"Joachims",
"Thorsten",
""
]
] | TITLE: Large-Margin Learning of Submodular Summarization Methods
ABSTRACT: In this paper, we present a supervised learning approach to training
submodular scoring functions for extractive multi-document summarization. By
taking a structured predicition approach, we provide a large-margin method that
directly optimi... |
0912.4196 | Tamon Stephen | Cedric Chauve, Utz-Uwe Haus, Tamon Stephen, Vivija P. You | Minimal Conflicting Sets for the Consecutive Ones Property in ancestral
genome reconstruction | 20 pages, 3 figures | J Comput Biol. 2010 Sep;17(9):1167-81 | 10.1089/cmb.2010.0113 | null | q-bio.GN cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A binary matrix has the Consecutive Ones Property (C1P) if its columns can be
ordered in such a way that all 1's on each row are consecutive. A Minimal
Conflicting Set is a set of rows that does not have the C1P, but every proper
subset has the C1P. Such submatrices have been considered in comparative
genomics applic... | [
{
"version": "v1",
"created": "Mon, 21 Dec 2009 16:03:06 GMT"
}
] | 2011-10-13T00:00:00 | [
[
"Chauve",
"Cedric",
""
],
[
"Haus",
"Utz-Uwe",
""
],
[
"Stephen",
"Tamon",
""
],
[
"You",
"Vivija P.",
""
]
] | TITLE: Minimal Conflicting Sets for the Consecutive Ones Property in ancestral
genome reconstruction
ABSTRACT: A binary matrix has the Consecutive Ones Property (C1P) if its columns can be
ordered in such a way that all 1's on each row are consecutive. A Minimal
Conflicting Set is a set of rows that does not have... |
1110.2626 | Kuruba Usha Rani | K. Usha Rani | Analysis of Heart Diseases Dataset using Neural Network Approach | 8 pages, 2 figures, 1 table; International Journal of Data Mining &
Knowledge Management Process (IJDKP) Vol.1, No.5, September 2011 | null | 10.5121/ijdkp.2011.1501 | null | cs.LG cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the important techniques of Data mining is Classification. Many real
world problems in various fields such as business, science, industry and
medicine can be solved by using classification approach. Neural Networks have
emerged as an important tool for classification. The advantages of Neural
Networks helps fo... | [
{
"version": "v1",
"created": "Wed, 12 Oct 2011 10:56:29 GMT"
}
] | 2011-10-13T00:00:00 | [
[
"Rani",
"K. Usha",
""
]
] | TITLE: Analysis of Heart Diseases Dataset using Neural Network Approach
ABSTRACT: One of the important techniques of Data mining is Classification. Many real
world problems in various fields such as business, science, industry and
medicine can be solved by using classification approach. Neural Networks have
emerged... |
1110.2396 | Riccardo Albertoni | Riccardo Albertoni, Monica De Martino | Semantic Technology to Exploit Digital Content Exposed as Linked Data | Published in eChallenges e-2011 Conference Proceedings Paul
Cunningham and Miriam Cunningham (Eds) IIMC International Information
Management Corporation, 2011 ISBN: 978-1-905824-27-4 | null | null | null | cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The paper illustrates the research result of the application of semantic
technology to ease the use and reuse of digital contents exposed as Linked Data
on the web. It focuses on the specific issue of explorative research for the
resource selection: a context dependent semantic similarity assessment is
proposed in or... | [
{
"version": "v1",
"created": "Tue, 11 Oct 2011 15:20:15 GMT"
}
] | 2011-10-12T00:00:00 | [
[
"Albertoni",
"Riccardo",
""
],
[
"De Martino",
"Monica",
""
]
] | TITLE: Semantic Technology to Exploit Digital Content Exposed as Linked Data
ABSTRACT: The paper illustrates the research result of the application of semantic
technology to ease the use and reuse of digital contents exposed as Linked Data
on the web. It focuses on the specific issue of explorative research for the... |
0710.0958 | Valerio Lucarini | Valerio Lucarini | Response Theory for Equilibrium and Non-Equilibrium Statistical
Mechanics: Causality and Generalized Kramers-Kronig relations | 22 pages | J. Stat. Phys.,131, 543-558 (2008) | 10.1007/s10955-008-9498-y | null | cond-mat.stat-mech cond-mat.str-el math-ph math.MP nlin.CD physics.flu-dyn | null | We consider the general response theory proposed by Ruelle for describing the
impact of small perturbations to the non-equilibrium steady states resulting
from Axiom A dynamical systems. We show that the causality of the response
functions allows for writing a set of Kramers-Kronig relations for the
corresponding sus... | [
{
"version": "v1",
"created": "Thu, 4 Oct 2007 09:14:21 GMT"
}
] | 2011-10-11T00:00:00 | [
[
"Lucarini",
"Valerio",
""
]
] | TITLE: Response Theory for Equilibrium and Non-Equilibrium Statistical
Mechanics: Causality and Generalized Kramers-Kronig relations
ABSTRACT: We consider the general response theory proposed by Ruelle for describing the
impact of small perturbations to the non-equilibrium steady states resulting
from Axiom A dyn... |
1110.1863 | Stefano Forte | The NNPDF Collaboration: Richard D.Ball, Valerio Bertone, Francesco
Cerutti, Luigi Del Debbio, Stefano Forte, Alberto Guffanti, Jose I.Latorre,
Juan Rojo and Maria Ubiali | Parton distributions: determining probabilities in a space of functions | 11 pages, 8 figures, presented by Stefano Forte at PHYSTAT 2011 (to
be published in the proceedings) | null | null | IFUM-988-FT, TTK-11-48 | hep-ph physics.data-an | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We discuss the statistical properties of parton distributions within the
framework of the NNPDF methodology. We present various tests of statistical
consistency, in particular that the distribution of results does not depend on
the underlying parametrization and that it behaves according to Bayes' theorem
upon the ad... | [
{
"version": "v1",
"created": "Sun, 9 Oct 2011 17:51:23 GMT"
}
] | 2011-10-11T00:00:00 | [
[
"The NNPDF Collaboration",
"",
""
],
[
"Ball",
"Richard D.",
""
],
[
"Bertone",
"Valerio",
""
],
[
"Cerutti",
"Francesco",
""
],
[
"Del Debbio",
"Luigi",
""
],
[
"Forte",
"Stefano",
""
],
[
"Guffanti",
"Alberto... | TITLE: Parton distributions: determining probabilities in a space of functions
ABSTRACT: We discuss the statistical properties of parton distributions within the
framework of the NNPDF methodology. We present various tests of statistical
consistency, in particular that the distribution of results does not depend on... |
physics/0612222 | Valerio Lucarini | Valerio Lucarini, Robert Danihlik, Ida Kriegerova, Antonio Speranza | Does the Danube exist? Versions of reality given by various regional
climate models and climatological datasets | 25 pages 8 figures, 5 tables | J. Geophys. Res., 112, D13103 (2007) | 10.1029/2006JD008360 | null | physics.ao-ph physics.data-an physics.geo-ph physics.soc-ph | null | We present an intercomparison and verification analysis of several regional
climate models (RCMs) nested into the same run of the same Atmospheric Global
Circulation Model (AGCM) regarding their representation of the statistical
properties of the hydrological balance of the Danube river basin for 1961-1990.
We also c... | [
{
"version": "v1",
"created": "Fri, 22 Dec 2006 12:02:41 GMT"
}
] | 2011-10-11T00:00:00 | [
[
"Lucarini",
"Valerio",
""
],
[
"Danihlik",
"Robert",
""
],
[
"Kriegerova",
"Ida",
""
],
[
"Speranza",
"Antonio",
""
]
] | TITLE: Does the Danube exist? Versions of reality given by various regional
climate models and climatological datasets
ABSTRACT: We present an intercomparison and verification analysis of several regional
climate models (RCMs) nested into the same run of the same Atmospheric Global
Circulation Model (AGCM) regard... |
1110.1513 | Abdul Kadir | Abdul Kadir, Lukito Edi Nugroho, Adhi Susanto, Paulus Insap Santosa | Foliage Plant Retrieval using Polar Fourier Transform, Color Moments and
Vein Features | 13 pages; Signal & Image Processing : An International Journal
(SIPIJ) Vol.2, No.3, September 2011 | null | 10.5121/sipij.2011.2301 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper proposed a method that combines Polar Fourier Transform, color
moments, and vein features to retrieve leaf images based on a leaf image. The
method is very useful to help people in recognizing foliage plants. Foliage
plants are plants that have various colors and unique patterns in the leaf.
Therefore, the... | [
{
"version": "v1",
"created": "Fri, 7 Oct 2011 13:00:03 GMT"
}
] | 2011-10-10T00:00:00 | [
[
"Kadir",
"Abdul",
""
],
[
"Nugroho",
"Lukito Edi",
""
],
[
"Susanto",
"Adhi",
""
],
[
"Santosa",
"Paulus Insap",
""
]
] | TITLE: Foliage Plant Retrieval using Polar Fourier Transform, Color Moments and
Vein Features
ABSTRACT: This paper proposed a method that combines Polar Fourier Transform, color
moments, and vein features to retrieve leaf images based on a leaf image. The
method is very useful to help people in recognizing foliag... |
1110.1303 | Stamatia Bibi | Makrina Viola Kosti, Sofia Lazaridou, Nikoleta Bourazani, Lefteris
Angelis | Discovering patterns of correlation and similarities in software project
data with the Circos visualization tool | 4th Workshop on Intelligent Techniques in Software Engineering, 5
September 2011 at the European Conference on Machine Learning and Principles
and Practices of Knowledge Discovery in Databases (ECML-PKDD) | null | null | null | cs.SE cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Software cost estimation based on multivariate data from completed projects
requires the building of efficient models. These models essentially describe
relations in the data, either on the basis of correlations between variables or
of similarities between the projects. The continuous growth of the amount of
data gat... | [
{
"version": "v1",
"created": "Thu, 6 Oct 2011 15:48:11 GMT"
}
] | 2011-10-07T00:00:00 | [
[
"Kosti",
"Makrina Viola",
""
],
[
"Lazaridou",
"Sofia",
""
],
[
"Bourazani",
"Nikoleta",
""
],
[
"Angelis",
"Lefteris",
""
]
] | TITLE: Discovering patterns of correlation and similarities in software project
data with the Circos visualization tool
ABSTRACT: Software cost estimation based on multivariate data from completed projects
requires the building of efficient models. These models essentially describe
relations in the data, either o... |
1110.0879 | Subhransu Maji | Subhransu Maji | Linearized Additive Classifiers | null | null | null | null | cs.CV cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We revisit the additive model learning literature and adapt a penalized
spline formulation due to Eilers and Marx, to train additive classifiers
efficiently. We also propose two new embeddings based two classes of orthogonal
basis with orthogonal derivatives, which can also be used to efficiently learn
additive class... | [
{
"version": "v1",
"created": "Wed, 5 Oct 2011 02:11:38 GMT"
}
] | 2011-10-06T00:00:00 | [
[
"Maji",
"Subhransu",
""
]
] | TITLE: Linearized Additive Classifiers
ABSTRACT: We revisit the additive model learning literature and adapt a penalized
spline formulation due to Eilers and Marx, to train additive classifiers
efficiently. We also propose two new embeddings based two classes of orthogonal
basis with orthogonal derivatives, which c... |
1110.0585 | Jacob Whitehill | Jacob Whitehill and Javier Movellan | Discriminately Decreasing Discriminability with Learned Image Filters | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In machine learning and computer vision, input images are often filtered to
increase data discriminability. In some situations, however, one may wish to
purposely decrease discriminability of one classification task (a "distractor"
task), while simultaneously preserving information relevant to another (the
task-of-in... | [
{
"version": "v1",
"created": "Tue, 4 Oct 2011 06:48:29 GMT"
}
] | 2011-10-05T00:00:00 | [
[
"Whitehill",
"Jacob",
""
],
[
"Movellan",
"Javier",
""
]
] | TITLE: Discriminately Decreasing Discriminability with Learned Image Filters
ABSTRACT: In machine learning and computer vision, input images are often filtered to
increase data discriminability. In some situations, however, one may wish to
purposely decrease discriminability of one classification task (a "distracto... |
1108.0748 | Rathipriya R | R. Rathipriya, K. Thangavel, J. Bagyamani | Binary Particle Swarm Optimization based Biclustering of Web usage Data | null | null | 10.5120/3001-4036 | null | cs.IR cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Web mining is the nontrivial process to discover valid, novel, potentially
useful knowledge from web data using the data mining techniques or methods. It
may give information that is useful for improving the services offered by web
portals and information access and retrieval tools. With the rapid development
of bicl... | [
{
"version": "v1",
"created": "Wed, 3 Aug 2011 05:54:26 GMT"
},
{
"version": "v2",
"created": "Fri, 30 Sep 2011 06:42:45 GMT"
}
] | 2011-10-03T00:00:00 | [
[
"Rathipriya",
"R.",
""
],
[
"Thangavel",
"K.",
""
],
[
"Bagyamani",
"J.",
""
]
] | TITLE: Binary Particle Swarm Optimization based Biclustering of Web usage Data
ABSTRACT: Web mining is the nontrivial process to discover valid, novel, potentially
useful knowledge from web data using the data mining techniques or methods. It
may give information that is useful for improving the services offered by... |
1109.6726 | Rathipriya R | R.Rathipriya, K.Thangavel | A Fuzzy Co-Clustering approach for Clickstream Data Pattern | null | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Web Usage mining is a very important tool to extract the hidden business
intelligence data from large databases. The extracted information provides the
organizations with the ability to produce results more effectively to improve
their businesses and increasing of sales. Co-clustering is a powerful
bipartition techni... | [
{
"version": "v1",
"created": "Fri, 30 Sep 2011 06:45:41 GMT"
}
] | 2011-10-03T00:00:00 | [
[
"Rathipriya",
"R.",
""
],
[
"Thangavel",
"K.",
""
]
] | TITLE: A Fuzzy Co-Clustering approach for Clickstream Data Pattern
ABSTRACT: Web Usage mining is a very important tool to extract the hidden business
intelligence data from large databases. The extracted information provides the
organizations with the ability to produce results more effectively to improve
their bus... |
1109.6881 | Adam Marcus | Adam Marcus, Eugene Wu, David Karger, Samuel Madden, Robert Miller | Human-powered Sorts and Joins | VLDB2012 | Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 1, pp.
13-24 (2011) | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Crowdsourcing markets like Amazon's Mechanical Turk (MTurk) make it possible
to task people with small jobs, such as labeling images or looking up phone
numbers, via a programmatic interface. MTurk tasks for processing datasets with
humans are currently designed with significant reimplementation of common
workflows a... | [
{
"version": "v1",
"created": "Fri, 30 Sep 2011 16:24:47 GMT"
}
] | 2011-10-03T00:00:00 | [
[
"Marcus",
"Adam",
""
],
[
"Wu",
"Eugene",
""
],
[
"Karger",
"David",
""
],
[
"Madden",
"Samuel",
""
],
[
"Miller",
"Robert",
""
]
] | TITLE: Human-powered Sorts and Joins
ABSTRACT: Crowdsourcing markets like Amazon's Mechanical Turk (MTurk) make it possible
to task people with small jobs, such as labeling images or looking up phone
numbers, via a programmatic interface. MTurk tasks for processing datasets with
humans are currently designed with s... |
0908.2061 | Sebastian Roch | Sebastien Roch | Sequence-Length Requirement of Distance-Based Phylogeny Reconstruction:
Breaking the Polynomial Barrier | null | null | null | null | math.PR cs.CE cs.DS math.ST q-bio.PE q-bio.QM stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a new distance-based phylogeny reconstruction technique which
provably achieves, at sufficiently short branch lengths, a polylogarithmic
sequence-length requirement -- improving significantly over previous polynomial
bounds for distance-based methods. The technique is based on an averaging
procedure that... | [
{
"version": "v1",
"created": "Fri, 14 Aug 2009 13:20:44 GMT"
}
] | 2011-09-30T00:00:00 | [
[
"Roch",
"Sebastien",
""
]
] | TITLE: Sequence-Length Requirement of Distance-Based Phylogeny Reconstruction:
Breaking the Polynomial Barrier
ABSTRACT: We introduce a new distance-based phylogeny reconstruction technique which
provably achieves, at sufficiently short branch lengths, a polylogarithmic
sequence-length requirement -- improving si... |
1108.5781 | Sebastian Roch | Sebastien Roch | Phase Transition in Distance-Based Phylogeny Reconstruction | null | null | null | null | math.PR cs.CE cs.DS math.ST q-bio.PE stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a new distance-based phylogeny reconstruction technique which
provably achieves, at sufficiently short branch lengths, a logarithmic
sequence-length requirement---improving significantly over previous polynomial
bounds for distance-based methods and matching existing results for general
methods. The tech... | [
{
"version": "v1",
"created": "Mon, 29 Aug 2011 23:59:24 GMT"
}
] | 2011-09-30T00:00:00 | [
[
"Roch",
"Sebastien",
""
]
] | TITLE: Phase Transition in Distance-Based Phylogeny Reconstruction
ABSTRACT: We introduce a new distance-based phylogeny reconstruction technique which
provably achieves, at sufficiently short branch lengths, a logarithmic
sequence-length requirement---improving significantly over previous polynomial
bounds for dis... |
1109.5286 | Dimitrios Giannakis | Peter Schwander, Chun Hong Yoon, Abbas Ourmazd, and Dimitrios
Giannakis | The symmetries of image formation by scattering. II. Applications | 12 pages, 47 references, 6 figures, 5 tables. Movies available at
http://www.cims.nyu.edu/~dimitris | null | null | null | physics.comp-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show that the symmetries of image formation by scattering enable
graph-theoretic manifold-embedding techniques to extract structural and timing
information from simulated and experimental snapshots at extremely low signal.
The approach constitutes a physically-based, computationally efficient, and
noise-robust rou... | [
{
"version": "v1",
"created": "Sat, 24 Sep 2011 16:43:04 GMT"
}
] | 2011-09-27T00:00:00 | [
[
"Schwander",
"Peter",
""
],
[
"Yoon",
"Chun Hong",
""
],
[
"Ourmazd",
"Abbas",
""
],
[
"Giannakis",
"Dimitrios",
""
]
] | TITLE: The symmetries of image formation by scattering. II. Applications
ABSTRACT: We show that the symmetries of image formation by scattering enable
graph-theoretic manifold-embedding techniques to extract structural and timing
information from simulated and experimental snapshots at extremely low signal.
The app... |
1009.3240 | Hugh Brendan McMahan | H. Brendan McMahan | A Unified View of Regularized Dual Averaging and Mirror Descent with
Implicit Updates | Extensively updated version of earlier draft with new analysis
including a general treatment of composite objectives and experiments. Also
fixes a small bug in some of one of the proofs in the early version | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study three families of online convex optimization algorithms:
follow-the-proximally-regularized-leader (FTRL-Proximal), regularized dual
averaging (RDA), and composite-objective mirror descent. We first prove
equivalence theorems that show all of these algorithms are instantiations of a
general FTRL update. This ... | [
{
"version": "v1",
"created": "Thu, 16 Sep 2010 18:40:32 GMT"
},
{
"version": "v2",
"created": "Tue, 20 Sep 2011 18:38:13 GMT"
}
] | 2011-09-21T00:00:00 | [
[
"McMahan",
"H. Brendan",
""
]
] | TITLE: A Unified View of Regularized Dual Averaging and Mirror Descent with
Implicit Updates
ABSTRACT: We study three families of online convex optimization algorithms:
follow-the-proximally-regularized-leader (FTRL-Proximal), regularized dual
averaging (RDA), and composite-objective mirror descent. We first prov... |
1109.3650 | Rohan Agrawal | Rohan Agrawal | Bi-Objective Community Detection (BOCD) in Networks using Genetic
Algorithm | 11 pages, 3 Figures, 3 Tables. arXiv admin note: substantial text
overlap with arXiv:0906.0612 | null | 10.1007/978-3-642-22606-9_5 | null | cs.SI cs.AI cs.NE physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A lot of research effort has been put into community detection from all
corners of academic interest such as physics, mathematics and computer science.
In this paper I have proposed a Bi-Objective Genetic Algorithm for community
detection which maximizes modularity and community score. Then the results
obtained for b... | [
{
"version": "v1",
"created": "Fri, 16 Sep 2011 15:48:29 GMT"
}
] | 2011-09-19T00:00:00 | [
[
"Agrawal",
"Rohan",
""
]
] | TITLE: Bi-Objective Community Detection (BOCD) in Networks using Genetic
Algorithm
ABSTRACT: A lot of research effort has been put into community detection from all
corners of academic interest such as physics, mathematics and computer science.
In this paper I have proposed a Bi-Objective Genetic Algorithm for co... |
1109.3138 | Massimiliano Dal Mas | Massimiliano Dal Mas | Folksodriven Structure Network | 4 pages, 2 figures; for details see: http://www.maxdalmas.com | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Nowadays folksonomy is used as a system derived from user-generated
electronic tags or keywords that annotate and describe online content. But it
is not a classification system as an ontology. To consider it as a
classification system it would be necessary to share a representation of
contexts by all the users. This ... | [
{
"version": "v1",
"created": "Wed, 14 Sep 2011 17:06:21 GMT"
}
] | 2011-09-15T00:00:00 | [
[
"Mas",
"Massimiliano Dal",
""
]
] | TITLE: Folksodriven Structure Network
ABSTRACT: Nowadays folksonomy is used as a system derived from user-generated
electronic tags or keywords that annotate and describe online content. But it
is not a classification system as an ontology. To consider it as a
classification system it would be necessary to share a ... |
1109.2388 | Emre Akbas | Emre Akbas, Bernard Ghanem, Narendra Ahuja | MIS-Boost: Multiple Instance Selection Boosting | null | null | null | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we present a new multiple instance learning (MIL) method,
called MIS-Boost, which learns discriminative instance prototypes by explicit
instance selection in a boosting framework. Unlike previous instance selection
based MIL methods, we do not restrict the prototypes to a discrete set of
training insta... | [
{
"version": "v1",
"created": "Mon, 12 Sep 2011 07:31:34 GMT"
}
] | 2011-09-13T00:00:00 | [
[
"Akbas",
"Emre",
""
],
[
"Ghanem",
"Bernard",
""
],
[
"Ahuja",
"Narendra",
""
]
] | TITLE: MIS-Boost: Multiple Instance Selection Boosting
ABSTRACT: In this paper, we present a new multiple instance learning (MIL) method,
called MIS-Boost, which learns discriminative instance prototypes by explicit
instance selection in a boosting framework. Unlike previous instance selection
based MIL methods, we... |
1008.1635 | Roberto Alamino | Roberto C. Alamino | A Bayesian Foundation for Physical Theories | 33 pages, 2 figures | null | null | null | physics.data-an gr-qc physics.hist-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Bayesian probability theory is used as a framework to develop a formalism for
the scientific method based on principles of inductive reasoning. The formalism
allows for precise definitions of the key concepts in theories of physics and
also leads to a well-defined procedure to select one or more theories among a
fami... | [
{
"version": "v1",
"created": "Tue, 10 Aug 2010 05:25:31 GMT"
},
{
"version": "v2",
"created": "Tue, 30 Nov 2010 13:48:21 GMT"
},
{
"version": "v3",
"created": "Thu, 8 Sep 2011 20:02:33 GMT"
}
] | 2011-09-12T00:00:00 | [
[
"Alamino",
"Roberto C.",
""
]
] | TITLE: A Bayesian Foundation for Physical Theories
ABSTRACT: Bayesian probability theory is used as a framework to develop a formalism for
the scientific method based on principles of inductive reasoning. The formalism
allows for precise definitions of the key concepts in theories of physics and
also leads to a wel... |
1109.2047 | N. V. Chawla | N. V. Chawla, Grigoris Karakoulas | Learning From Labeled And Unlabeled Data: An Empirical Study Across
Techniques And Domains | null | Journal Of Artificial Intelligence Research, Volume 23, pages
331-366, 2005 | 10.1613/jair.1509 | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There has been increased interest in devising learning techniques that
combine unlabeled data with labeled data ? i.e. semi-supervised learning.
However, to the best of our knowledge, no study has been performed across
various techniques and different types and amounts of labeled and unlabeled
data. Moreover, most of... | [
{
"version": "v1",
"created": "Fri, 9 Sep 2011 15:56:58 GMT"
}
] | 2011-09-12T00:00:00 | [
[
"Chawla",
"N. V.",
""
],
[
"Karakoulas",
"Grigoris",
""
]
] | TITLE: Learning From Labeled And Unlabeled Data: An Empirical Study Across
Techniques And Domains
ABSTRACT: There has been increased interest in devising learning techniques that
combine unlabeled data with labeled data ? i.e. semi-supervised learning.
However, to the best of our knowledge, no study has been perf... |
1109.1579 | Benjmain Moseley | Alina Ene, Sungjin Im, Benjamin Moseley | Fast Clustering using MapReduce | Accepted to KDD 2011 | null | null | null | cs.DC cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Clustering problems have numerous applications and are becoming more
challenging as the size of the data increases. In this paper, we consider
designing clustering algorithms that can be used in MapReduce, the most popular
programming environment for processing large datasets. We focus on the
practical and popular cl... | [
{
"version": "v1",
"created": "Wed, 7 Sep 2011 21:10:36 GMT"
}
] | 2011-09-09T00:00:00 | [
[
"Ene",
"Alina",
""
],
[
"Im",
"Sungjin",
""
],
[
"Moseley",
"Benjamin",
""
]
] | TITLE: Fast Clustering using MapReduce
ABSTRACT: Clustering problems have numerous applications and are becoming more
challenging as the size of the data increases. In this paper, we consider
designing clustering algorithms that can be used in MapReduce, the most popular
programming environment for processing large... |
1109.1664 | Daniel Roggen | Daniel Roggen, Martin Wirz, Gerhard Tr\"oster, Dirk Helbing | Recognition of Crowd Behavior from Mobile Sensors with Pattern Analysis
and Graph Clustering Methods | null | Networks and Heterogenous Media, 6(3), 2011, pages 521-544 | 10.3934/nhm.2011.6.521 | null | physics.soc-ph cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mobile on-body sensing has distinct advantages for the analysis and
understanding of crowd dynamics: sensing is not geographically restricted to a
specific instrumented area, mobile phones offer on-body sensing and they are
already deployed on a large scale, and the rich sets of sensors they contain
allows one to cha... | [
{
"version": "v1",
"created": "Thu, 8 Sep 2011 09:06:04 GMT"
}
] | 2011-09-09T00:00:00 | [
[
"Roggen",
"Daniel",
""
],
[
"Wirz",
"Martin",
""
],
[
"Tröster",
"Gerhard",
""
],
[
"Helbing",
"Dirk",
""
]
] | TITLE: Recognition of Crowd Behavior from Mobile Sensors with Pattern Analysis
and Graph Clustering Methods
ABSTRACT: Mobile on-body sensing has distinct advantages for the analysis and
understanding of crowd dynamics: sensing is not geographically restricted to a
specific instrumented area, mobile phones offer o... |
1109.1068 | Karteeka Pavan Kanadam | K. Karteeka Pavan, Allam Appa Rao, A. V. Dattatreya Rao | An Automatic Clustering Technique for Optimal Clusters | 12 pages, 5 figures, 2 tables | International journal of Computer Sciene Engineering and
Applications, Vol., No.4, 2011, pp 133-144 | 10.5121/ijcsea.2011.1412 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper proposes a simple, automatic and efficient clustering algorithm,
namely, Automatic Merging for Optimal Clusters (AMOC) which aims to generate
nearly optimal clusters for the given datasets automatically. The AMOC is an
extension to standard k-means with a two phase iterative procedure combining
certain val... | [
{
"version": "v1",
"created": "Tue, 6 Sep 2011 05:34:28 GMT"
}
] | 2011-09-07T00:00:00 | [
[
"Pavan",
"K. Karteeka",
""
],
[
"Rao",
"Allam Appa",
""
],
[
"Rao",
"A. V. Dattatreya",
""
]
] | TITLE: An Automatic Clustering Technique for Optimal Clusters
ABSTRACT: This paper proposes a simple, automatic and efficient clustering algorithm,
namely, Automatic Merging for Optimal Clusters (AMOC) which aims to generate
nearly optimal clusters for the given datasets automatically. The AMOC is an
extension to s... |
1109.0714 | Till Moritz Karbach | Till Moritz Karbach | Feldman-Cousins Confidence Levels - Toy MC Method | 4 pages, 5 figures | null | null | null | physics.data-an hep-ex | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In particle physics, the likelihood ratio ordering principle is frequently
used to determine confidence regions. This method has statistical properties
that are superior to that of other confidence regions. But it often requires
intensive computations involving thousands of toy Monte Carlo datasets. The
original pape... | [
{
"version": "v1",
"created": "Sun, 4 Sep 2011 13:57:32 GMT"
}
] | 2011-09-06T00:00:00 | [
[
"Karbach",
"Till Moritz",
""
]
] | TITLE: Feldman-Cousins Confidence Levels - Toy MC Method
ABSTRACT: In particle physics, the likelihood ratio ordering principle is frequently
used to determine confidence regions. This method has statistical properties
that are superior to that of other confidence regions. But it often requires
intensive computatio... |
1109.0758 | Mao Ye | Mao Ye and Xingjie Liu and Wang-Chien Lee | Exploring Social Influence for Recommendation - A Probabilistic
Generative Model Approach | null | null | null | null | cs.SI cs.IR physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a probabilistic generative model, called unified
model, which naturally unifies the ideas of social influence, collaborative
filtering and content-based methods for item recommendation. To address the
issue of hidden social influence, we devise new algorithms to learn the model
parameters of... | [
{
"version": "v1",
"created": "Sun, 4 Sep 2011 21:15:12 GMT"
}
] | 2011-09-06T00:00:00 | [
[
"Ye",
"Mao",
""
],
[
"Liu",
"Xingjie",
""
],
[
"Lee",
"Wang-Chien",
""
]
] | TITLE: Exploring Social Influence for Recommendation - A Probabilistic
Generative Model Approach
ABSTRACT: In this paper, we propose a probabilistic generative model, called unified
model, which naturally unifies the ideas of social influence, collaborative
filtering and content-based methods for item recommendat... |
1109.0094 | Heba Affify | Heba Afify, Muhammad Islam and Manal Abdel Wahed | DNA Lossless Differential Compression Algorithm based on Similarity of
Genomic Sequence Database | null | null | null | null | cs.DS cs.CE cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modern biological science produces vast amounts of genomic sequence data.
This is fuelling the need for efficient algorithms for sequence compression and
analysis. Data compression and the associated techniques coming from
information theory are often perceived as being of interest for data
communication and storage.... | [
{
"version": "v1",
"created": "Thu, 1 Sep 2011 05:39:35 GMT"
}
] | 2011-09-05T00:00:00 | [
[
"Afify",
"Heba",
""
],
[
"Islam",
"Muhammad",
""
],
[
"Wahed",
"Manal Abdel",
""
]
] | TITLE: DNA Lossless Differential Compression Algorithm based on Similarity of
Genomic Sequence Database
ABSTRACT: Modern biological science produces vast amounts of genomic sequence data.
This is fuelling the need for efficient algorithms for sequence compression and
analysis. Data compression and the associated ... |
1108.5002 | Yoshitaka Kameya | Yoshitaka Kameya, Satoru Nakamura, Tatsuya Iwasaki and Taisuke Sato | Verbal Characterization of Probabilistic Clusters using Minimal
Discriminative Propositions | 13 pages including 3 figures. This is the full version of a paper at
ICTAI-2011 (http://www.cse.fau.edu/ictai2011/) | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In a knowledge discovery process, interpretation and evaluation of the mined
results are indispensable in practice. In the case of data clustering, however,
it is often difficult to see in what aspect each cluster has been formed. This
paper proposes a method for automatic and objective characterization or
"verbaliza... | [
{
"version": "v1",
"created": "Thu, 25 Aug 2011 03:41:26 GMT"
},
{
"version": "v2",
"created": "Wed, 31 Aug 2011 02:48:36 GMT"
}
] | 2011-09-01T00:00:00 | [
[
"Kameya",
"Yoshitaka",
""
],
[
"Nakamura",
"Satoru",
""
],
[
"Iwasaki",
"Tatsuya",
""
],
[
"Sato",
"Taisuke",
""
]
] | TITLE: Verbal Characterization of Probabilistic Clusters using Minimal
Discriminative Propositions
ABSTRACT: In a knowledge discovery process, interpretation and evaluation of the mined
results are indispensable in practice. In the case of data clustering, however,
it is often difficult to see in what aspect each... |
1108.5397 | Charles Bergeron PhD | Charles Bergeron, Theresa Hepburn, C. Matthew Sundling, Michael Krein,
Bill Katt, Nagamani Sukumar, Curt M. Breneman, Kristin P. Bennett | Prediction of peptide bonding affinity: kernel methods for nonlinear
modeling | null | null | null | null | stat.ML cs.LG q-bio.QM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents regression models obtained from a process of blind
prediction of peptide binding affinity from provided descriptors for several
distinct datasets as part of the 2006 Comparative Evaluation of Prediction
Algorithms (COEPRA) contest. This paper finds that kernel partial least
squares, a nonlinear pa... | [
{
"version": "v1",
"created": "Fri, 26 Aug 2011 21:21:51 GMT"
}
] | 2011-08-30T00:00:00 | [
[
"Bergeron",
"Charles",
""
],
[
"Hepburn",
"Theresa",
""
],
[
"Sundling",
"C. Matthew",
""
],
[
"Krein",
"Michael",
""
],
[
"Katt",
"Bill",
""
],
[
"Sukumar",
"Nagamani",
""
],
[
"Breneman",
"Curt M.",
""
... | TITLE: Prediction of peptide bonding affinity: kernel methods for nonlinear
modeling
ABSTRACT: This paper presents regression models obtained from a process of blind
prediction of peptide binding affinity from provided descriptors for several
distinct datasets as part of the 2006 Comparative Evaluation of Predict... |
1108.5592 | Sivakumar Madesan | Abhishek Taneja, R.K.Chauhan | A Performance Study of Data Mining Techniques: Multiple Linear
Regression vs. Factor Analysis | Data mining, Multiple Linear Regression, Factor Analysis, Principal
Component Regression, Maximum Liklihood Regression, Generalized Least Square
Regression | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The growing volume of data usually creates an interesting challenge for the
need of data analysis tools that discover regularities in these data. Data
mining has emerged as disciplines that contribute tools for data analysis,
discovery of hidden knowledge, and autonomous decision making in many
application domains. T... | [
{
"version": "v1",
"created": "Fri, 26 Aug 2011 07:08:13 GMT"
}
] | 2011-08-30T00:00:00 | [
[
"Taneja",
"Abhishek",
""
],
[
"Chauhan",
"R. K.",
""
]
] | TITLE: A Performance Study of Data Mining Techniques: Multiple Linear
Regression vs. Factor Analysis
ABSTRACT: The growing volume of data usually creates an interesting challenge for the
need of data analysis tools that discover regularities in these data. Data
mining has emerged as disciplines that contribute to... |
1108.5217 | Hieu Dinh | Dolly Sharma and Sanguthevar Rajasekaran and Hieu Dinh | An Experimental Comparison of PMSPrune and Other Algorithms for Motif
Search | null | null | null | null | q-bio.QM cs.CE q-bio.GN | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Extracting meaningful patterns from voluminous amount of biological data is a
very big challenge. Motifs are biological patterns of great interest to
biologists. Many different versions of the motif finding problem have been
identified by researchers. Examples include the Planted $(l, d)$ Motif version,
those based o... | [
{
"version": "v1",
"created": "Fri, 26 Aug 2011 00:26:44 GMT"
}
] | 2011-08-29T00:00:00 | [
[
"Sharma",
"Dolly",
""
],
[
"Rajasekaran",
"Sanguthevar",
""
],
[
"Dinh",
"Hieu",
""
]
] | TITLE: An Experimental Comparison of PMSPrune and Other Algorithms for Motif
Search
ABSTRACT: Extracting meaningful patterns from voluminous amount of biological data is a
very big challenge. Motifs are biological patterns of great interest to
biologists. Many different versions of the motif finding problem have ... |
1106.0288 | Hang-Hyun Jo | Hang-Hyun Jo, Raj Kumar Pan, and Kimmo Kaski | Emergence of Bursts and Communities in Evolving Weighted Networks | 9 pages, 6 figures | PLoS ONE 6(8): e22687 (2011) | 10.1371/journal.pone.0022687 | null | physics.soc-ph cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Understanding the patterns of human dynamics and social interaction, and the
way they lead to the formation of an organized and functional society are
important issues especially for techno-social development. Addressing these
issues of social networks has recently become possible through large scale data
analysis of... | [
{
"version": "v1",
"created": "Wed, 1 Jun 2011 19:26:18 GMT"
}
] | 2011-08-26T00:00:00 | [
[
"Jo",
"Hang-Hyun",
""
],
[
"Pan",
"Raj Kumar",
""
],
[
"Kaski",
"Kimmo",
""
]
] | TITLE: Emergence of Bursts and Communities in Evolving Weighted Networks
ABSTRACT: Understanding the patterns of human dynamics and social interaction, and the
way they lead to the formation of an organized and functional society are
important issues especially for techno-social development. Addressing these
issues... |
0803.4063 | Arne Kesting | Arne Kesting and Martin Treiber | Calibrating Car-Following Models using Trajectory Data: Methodological
Study | null | Transportation Research Record: Journal of the Transportation
Research Board, Volume 2088, Pages 148-156 (2008) | 10.3141/2088-16 | null | physics.soc-ph physics.pop-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The car-following behavior of individual drivers in real city traffic is
studied on the basis of (publicly available) trajectory datasets recorded by a
vehicle equipped with an radar sensor. By means of a nonlinear optimization
procedure based on a genetic algorithm, we calibrate the Intelligent Driver
Model and the ... | [
{
"version": "v1",
"created": "Fri, 28 Mar 2008 08:40:37 GMT"
}
] | 2011-08-25T00:00:00 | [
[
"Kesting",
"Arne",
""
],
[
"Treiber",
"Martin",
""
]
] | TITLE: Calibrating Car-Following Models using Trajectory Data: Methodological
Study
ABSTRACT: The car-following behavior of individual drivers in real city traffic is
studied on the basis of (publicly available) trajectory datasets recorded by a
vehicle equipped with an radar sensor. By means of a nonlinear optim... |
1108.4041 | Daniel Lemire | Daniel Lemire and Andre Vellino | Extracting, Transforming and Archiving Scientific Data | 8 pages, Fourth Workshop on Very Large Digital Libraries, 2011 | null | null | null | cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is becoming common to archive research datasets that are not only large
but also numerous. In addition, their corresponding metadata and the software
required to analyse or display them need to be archived. Yet the manual
curation of research data can be difficult and expensive, particularly in very
large digital ... | [
{
"version": "v1",
"created": "Fri, 19 Aug 2011 20:16:02 GMT"
},
{
"version": "v2",
"created": "Tue, 23 Aug 2011 02:21:59 GMT"
}
] | 2011-08-24T00:00:00 | [
[
"Lemire",
"Daniel",
""
],
[
"Vellino",
"Andre",
""
]
] | TITLE: Extracting, Transforming and Archiving Scientific Data
ABSTRACT: It is becoming common to archive research datasets that are not only large
but also numerous. In addition, their corresponding metadata and the software
required to analyse or display them need to be archived. Yet the manual
curation of researc... |
1108.4551 | Tshilidzi Marwala | Mlungisi Duma, Bhekisipho Twala, Tshilidzi Marwala | Improving the performance of the ripper in insurance risk classification
: A comparitive study using feature selection | ICINCO 2011: 8th International Conference on Informatics in Control,
Automation and Robotics | null | null | null | cs.LG cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Ripper algorithm is designed to generate rule sets for large datasets
with many features. However, it was shown that the algorithm struggles with
classification performance in the presence of missing data. The algorithm
struggles to classify instances when the quality of the data deteriorates as a
result of incre... | [
{
"version": "v1",
"created": "Tue, 23 Aug 2011 10:52:18 GMT"
}
] | 2011-08-24T00:00:00 | [
[
"Duma",
"Mlungisi",
""
],
[
"Twala",
"Bhekisipho",
""
],
[
"Marwala",
"Tshilidzi",
""
]
] | TITLE: Improving the performance of the ripper in insurance risk classification
: A comparitive study using feature selection
ABSTRACT: The Ripper algorithm is designed to generate rule sets for large datasets
with many features. However, it was shown that the algorithm struggles with
classification performance i... |
1108.4079 | Jason J Corso | Jason J. Corso | Toward Parts-Based Scene Understanding with Pixel-Support Parts-Sparse
Pictorial Structures | null | null | null | null | cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Scene understanding remains a significant challenge in the computer vision
community. The visual psychophysics literature has demonstrated the importance
of interdependence among parts of the scene. Yet, the majority of methods in
computer vision remain local. Pictorial structures have arisen as a fundamental
parts-b... | [
{
"version": "v1",
"created": "Sat, 20 Aug 2011 02:08:45 GMT"
}
] | 2011-08-23T00:00:00 | [
[
"Corso",
"Jason J.",
""
]
] | TITLE: Toward Parts-Based Scene Understanding with Pixel-Support Parts-Sparse
Pictorial Structures
ABSTRACT: Scene understanding remains a significant challenge in the computer vision
community. The visual psychophysics literature has demonstrated the importance
of interdependence among parts of the scene. Yet, t... |
1108.3974 | Dylan Harp | Dylan R. Harp and Velimir V. Vesselinov | Accounting for the influence of aquifer heterogeneity on spatial
propagation of pumping drawdown | null | null | null | LA-UR 10-06334 | physics.geo-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It has been previously observed that during a pumping test in heterogeneous
media, drawdown data from different time periods collected at a single location
produce different estimates of aquifer properties and that Theis type-curve
inferences are more variable than late-time Cooper-Jacob inferences. In order
to obtai... | [
{
"version": "v1",
"created": "Fri, 19 Aug 2011 14:41:31 GMT"
}
] | 2011-08-22T00:00:00 | [
[
"Harp",
"Dylan R.",
""
],
[
"Vesselinov",
"Velimir V.",
""
]
] | TITLE: Accounting for the influence of aquifer heterogeneity on spatial
propagation of pumping drawdown
ABSTRACT: It has been previously observed that during a pumping test in heterogeneous
media, drawdown data from different time periods collected at a single location
produce different estimates of aquifer prope... |
1108.0442 | Feng Wang | Feng Wang, Haiyan Wang, Kuai Xu | Diffusive Logistic Model Towards Predicting Information Diffusion in
Online Social Networks | null | null | null | null | cs.SI math.AP physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Online social networks have recently become an effective and innovative
channel for spreading information and influence among hundreds of millions of
end users. Many prior work have carried out empirical studies and proposed
diffusion models to understand the information diffusion process in online
social networks. H... | [
{
"version": "v1",
"created": "Mon, 1 Aug 2011 22:04:45 GMT"
}
] | 2011-08-20T00:00:00 | [
[
"Wang",
"Feng",
""
],
[
"Wang",
"Haiyan",
""
],
[
"Xu",
"Kuai",
""
]
] | TITLE: Diffusive Logistic Model Towards Predicting Information Diffusion in
Online Social Networks
ABSTRACT: Online social networks have recently become an effective and innovative
channel for spreading information and influence among hundreds of millions of
end users. Many prior work have carried out empirical s... |
1108.3154 | Stephane Ross | Stephane Ross, J. Andrew Bagnell | Stability Conditions for Online Learnability | 16 pages. Earlier version of this work submitted (but rejected) to
COLT 2011 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Stability is a general notion that quantifies the sensitivity of a learning
algorithm's output to small change in the training dataset (e.g. deletion or
replacement of a single training sample). Such conditions have recently been
shown to be more powerful to characterize learnability in the general learning
setting u... | [
{
"version": "v1",
"created": "Tue, 16 Aug 2011 05:11:54 GMT"
},
{
"version": "v2",
"created": "Wed, 17 Aug 2011 17:01:35 GMT"
}
] | 2011-08-18T00:00:00 | [
[
"Ross",
"Stephane",
""
],
[
"Bagnell",
"J. Andrew",
""
]
] | TITLE: Stability Conditions for Online Learnability
ABSTRACT: Stability is a general notion that quantifies the sensitivity of a learning
algorithm's output to small change in the training dataset (e.g. deletion or
replacement of a single training sample). Such conditions have recently been
shown to be more powerfu... |
1108.3072 | Ping Li | Ping Li, Anshumali Shrivastava, Christian Konig | Training Logistic Regression and SVM on 200GB Data Using b-Bit Minwise
Hashing and Comparisons with Vowpal Wabbit (VW) | null | null | null | null | cs.LG stat.ME stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We generated a dataset of 200 GB with 10^9 features, to test our recent b-bit
minwise hashing algorithms for training very large-scale logistic regression
and SVM. The results confirm our prior work that, compared with the VW hashing
algorithm (which has the same variance as random projections), b-bit minwise
hashing... | [
{
"version": "v1",
"created": "Mon, 15 Aug 2011 19:53:55 GMT"
}
] | 2011-08-16T00:00:00 | [
[
"Li",
"Ping",
""
],
[
"Shrivastava",
"Anshumali",
""
],
[
"Konig",
"Christian",
""
]
] | TITLE: Training Logistic Regression and SVM on 200GB Data Using b-Bit Minwise
Hashing and Comparisons with Vowpal Wabbit (VW)
ABSTRACT: We generated a dataset of 200 GB with 10^9 features, to test our recent b-bit
minwise hashing algorithms for training very large-scale logistic regression
and SVM. The results co... |
1108.1351 | Raied Salman Dr | Raied Salman, Vojislav Kecman, Qi Li, Robert Strack and Erik Test | Fast k-means algorithm clustering | 16 pages, Wimo2011; International Journal of Computer Networks &
Communications (IJCNC) Vol.3, No.4, July 2011 | null | 10.5121/ijcnc.2011.3402 | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | k-means has recently been recognized as one of the best algorithms for
clustering unsupervised data. Since k-means depends mainly on distance
calculation between all data points and the centers, the time cost will be high
when the size of the dataset is large (for example more than 500millions of
points). We propose ... | [
{
"version": "v1",
"created": "Fri, 5 Aug 2011 15:37:23 GMT"
}
] | 2011-08-08T00:00:00 | [
[
"Salman",
"Raied",
""
],
[
"Kecman",
"Vojislav",
""
],
[
"Li",
"Qi",
""
],
[
"Strack",
"Robert",
""
],
[
"Test",
"Erik",
""
]
] | TITLE: Fast k-means algorithm clustering
ABSTRACT: k-means has recently been recognized as one of the best algorithms for
clustering unsupervised data. Since k-means depends mainly on distance
calculation between all data points and the centers, the time cost will be high
when the size of the dataset is large (for ... |
1108.1353 | Susheel Kumar k | K.Susheel Kumar, Vijay Bhaskar Semwal, R C Tripathi | Real time face recognition using adaboost improved fast PCA algorithm | 14 pages; ISSN : 0975-900X (Online), 0976-2191 (Print) | International Journal of Artificial Intelligence & Applications
(IJAIA), Vol.2, No.3, July 2011, 45-58 | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents an automated system for human face recognition in a real
time background world for a large homemade dataset of persons face. The task is
very difficult as the real time background subtraction in an image is still a
challenge. Addition to this there is a huge variation in human face image in
terms ... | [
{
"version": "v1",
"created": "Fri, 5 Aug 2011 15:41:31 GMT"
}
] | 2011-08-08T00:00:00 | [
[
"Kumar",
"K. Susheel",
""
],
[
"Semwal",
"Vijay Bhaskar",
""
],
[
"Tripathi",
"R C",
""
]
] | TITLE: Real time face recognition using adaboost improved fast PCA algorithm
ABSTRACT: This paper presents an automated system for human face recognition in a real
time background world for a large homemade dataset of persons face. The task is
very difficult as the real time background subtraction in an image is st... |
1107.5628 | Timothy Dubois | Alex Skvortsov, Milan Jamriska and Timothy C. DuBois | Scaling laws of passive tracer dispersion in the turbulent surface layer | 5 pages, 3 figures, 1 table | Phys. Rev. E 82, 056304 (2010) | 10.1103/PhysRevE.82.056304 | null | nlin.CD physics.ao-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Experimental results for passive tracer dispersion in the turbulent surface
layer under stable conditions are presented. In this case, the dispersion of
tracer particles is determined by the interplay of three mechanisms: relative
dispersion (celebrated Richardson's mechanism), shear dispersion (particle
separation d... | [
{
"version": "v1",
"created": "Thu, 28 Jul 2011 05:55:35 GMT"
}
] | 2011-07-29T00:00:00 | [
[
"Skvortsov",
"Alex",
""
],
[
"Jamriska",
"Milan",
""
],
[
"DuBois",
"Timothy C.",
""
]
] | TITLE: Scaling laws of passive tracer dispersion in the turbulent surface layer
ABSTRACT: Experimental results for passive tracer dispersion in the turbulent surface
layer under stable conditions are presented. In this case, the dispersion of
tracer particles is determined by the interplay of three mechanisms: rela... |
1107.4557 | Myle Ott | Myle Ott, Yejin Choi, Claire Cardie, Jeffrey T. Hancock | Finding Deceptive Opinion Spam by Any Stretch of the Imagination | 11 pages, 5 tables, data available at:
http://www.cs.cornell.edu/~myleott | Proceedings of ACL 2011: HLT, pp. 309-319 | null | null | cs.CL cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Consumers increasingly rate, review and research products online.
Consequently, websites containing consumer reviews are becoming targets of
opinion spam. While recent work has focused primarily on manually identifiable
instances of opinion spam, in this work we study deceptive opinion
spam---fictitious opinions that... | [
{
"version": "v1",
"created": "Fri, 22 Jul 2011 16:02:06 GMT"
}
] | 2011-07-25T00:00:00 | [
[
"Ott",
"Myle",
""
],
[
"Choi",
"Yejin",
""
],
[
"Cardie",
"Claire",
""
],
[
"Hancock",
"Jeffrey T.",
""
]
] | TITLE: Finding Deceptive Opinion Spam by Any Stretch of the Imagination
ABSTRACT: Consumers increasingly rate, review and research products online.
Consequently, websites containing consumer reviews are becoming targets of
opinion spam. While recent work has focused primarily on manually identifiable
instances of o... |
1104.0651 | Mariano Tepper | Mariano Tepper, Pablo Mus\'e, Andr\'es Almansa | Meaningful Clustered Forest: an Automatic and Robust Clustering
Algorithm | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a new clustering technique that can be regarded as a numerical
method to compute the proximity gestalt. The method analyzes edge length
statistics in the MST of the dataset and provides an a contrario cluster
detection criterion. The approach is fully parametric on the chosen distance
and can detect arbitr... | [
{
"version": "v1",
"created": "Mon, 4 Apr 2011 19:04:25 GMT"
},
{
"version": "v2",
"created": "Thu, 16 Jun 2011 22:30:03 GMT"
},
{
"version": "v3",
"created": "Tue, 19 Jul 2011 14:39:35 GMT"
}
] | 2011-07-20T00:00:00 | [
[
"Tepper",
"Mariano",
""
],
[
"Musé",
"Pablo",
""
],
[
"Almansa",
"Andrés",
""
]
] | TITLE: Meaningful Clustered Forest: an Automatic and Robust Clustering
Algorithm
ABSTRACT: We propose a new clustering technique that can be regarded as a numerical
method to compute the proximity gestalt. The method analyzes edge length
statistics in the MST of the dataset and provides an a contrario cluster
det... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.