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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1204.2718 | David Vallet David Vallet | Andreas Thalhammer, Ioan Toma, Antonio Roa-Valverde and Dieter Fensel | Leveraging Usage Data for Linked Data Movie Entity Summarization | 2nd International Workshop on Usage Analysis and the Web of Data
(USEWOD2012) in the 21st International World Wide Web Conference (WWW2012),
Lyon, France, April 17th, 2012 | null | null | WWW2012USEWOD/2012/thtorofe | cs.AI cs.HC cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Novel research in the field of Linked Data focuses on the problem of entity
summarization. This field addresses the problem of ranking features according
to their importance for the task of identifying a particular entity. Next to a
more human friendly presentation, these summarizations can play a central role
for se... | [
{
"version": "v1",
"created": "Thu, 12 Apr 2012 13:31:52 GMT"
}
] | 2012-04-13T00:00:00 | [
[
"Thalhammer",
"Andreas",
""
],
[
"Toma",
"Ioan",
""
],
[
"Roa-Valverde",
"Antonio",
""
],
[
"Fensel",
"Dieter",
""
]
] | TITLE: Leveraging Usage Data for Linked Data Movie Entity Summarization
ABSTRACT: Novel research in the field of Linked Data focuses on the problem of entity
summarization. This field addresses the problem of ranking features according
to their importance for the task of identifying a particular entity. Next to a
m... |
1204.2404 | Sanaa Elyassami | Sanaa Elyassami and Ali Idri | Investigating Effort Prediction of Software Projects on the ISBSG
Dataset | International Journal of Artificial Intelligence & Applications
(IJAIA), Vol.3, No.2, March 2012 | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many cost estimation models have been proposed over the last three decades.
In this study, we investigate fuzzy ID3 decision tree as a method for software
effort estimation. Fuzzy ID software effort estimation model is designed by
incorporating the principles of ID3 decision tree and the concepts of the fuzzy
settheo... | [
{
"version": "v1",
"created": "Wed, 11 Apr 2012 10:36:12 GMT"
}
] | 2012-04-12T00:00:00 | [
[
"Elyassami",
"Sanaa",
""
],
[
"Idri",
"Ali",
""
]
] | TITLE: Investigating Effort Prediction of Software Projects on the ISBSG
Dataset
ABSTRACT: Many cost estimation models have been proposed over the last three decades.
In this study, we investigate fuzzy ID3 decision tree as a method for software
effort estimation. Fuzzy ID software effort estimation model is desi... |
1204.2114 | Yong Haur Tay | Jun Yee Ng and Yong Haur Tay | Image-based Vehicle Classification System | The 11th Asia-Pacific ITS Forum and Exhibition (ITS-AP 2011),
Kaoshiung, Taiwan. June 8-11, 2011 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Electronic toll collection (ETC) system has been a common trend used for toll
collection on toll road nowadays. The implementation of electronic toll
collection allows vehicles to travel at low or full speed during the toll
payment, which help to avoid the traffic delay at toll road. One of the major
components of an... | [
{
"version": "v1",
"created": "Tue, 10 Apr 2012 11:59:10 GMT"
}
] | 2012-04-11T00:00:00 | [
[
"Ng",
"Jun Yee",
""
],
[
"Tay",
"Yong Haur",
""
]
] | TITLE: Image-based Vehicle Classification System
ABSTRACT: Electronic toll collection (ETC) system has been a common trend used for toll
collection on toll road nowadays. The implementation of electronic toll
collection allows vehicles to travel at low or full speed during the toll
payment, which help to avoid the ... |
1203.3586 | Mohsen Pourvali | Mohsen Pourvali and Mohammad Saniee Abadeh | Automated Text Summarization Base on Lexicales Chain and graph Using of
WordNet and Wikipedia Knowledge Base | null | IJCSI International Journal of Computer Science Issues, Vol. 9,
Issue 1, No 3, January 2012 | null | null | cs.IR cs.CL | http://creativecommons.org/licenses/by/3.0/ | The technology of automatic document summarization is maturing and may
provide a solution to the information overload problem. Nowadays, document
summarization plays an important role in information retrieval. With a large
volume of documents, presenting the user with a summary of each document
greatly facilitates th... | [
{
"version": "v1",
"created": "Thu, 15 Mar 2012 22:56:29 GMT"
}
] | 2012-04-10T00:00:00 | [
[
"Pourvali",
"Mohsen",
""
],
[
"Abadeh",
"Mohammad Saniee",
""
]
] | TITLE: Automated Text Summarization Base on Lexicales Chain and graph Using of
WordNet and Wikipedia Knowledge Base
ABSTRACT: The technology of automatic document summarization is maturing and may
provide a solution to the information overload problem. Nowadays, document
summarization plays an important role in i... |
1204.1611 | Choon Boon Ng | Choon Boon Ng, Yong Haur Tay, Bok Min Goi | Vision-based Human Gender Recognition: A Survey | 30 pages | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Gender is an important demographic attribute of people. This paper provides a
survey of human gender recognition in computer vision. A review of approaches
exploiting information from face and whole body (either from a still image or
gait sequence) is presented. We highlight the challenges faced and survey the
repres... | [
{
"version": "v1",
"created": "Sat, 7 Apr 2012 08:17:40 GMT"
}
] | 2012-04-10T00:00:00 | [
[
"Ng",
"Choon Boon",
""
],
[
"Tay",
"Yong Haur",
""
],
[
"Goi",
"Bok Min",
""
]
] | TITLE: Vision-based Human Gender Recognition: A Survey
ABSTRACT: Gender is an important demographic attribute of people. This paper provides a
survey of human gender recognition in computer vision. A review of approaches
exploiting information from face and whole body (either from a still image or
gait sequence) is... |
1204.1949 | Zi-Ke Zhang Mr. | Xiao Hu, Chuibo Chen, Xiaolong Chen, Zi-Ke Zhang | Social Recommender Systems Based on Coupling Network Structure Analysis | null | null | null | null | cs.IR cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The past few years has witnessed the great success of recommender systems,
which can significantly help users find relevant and interesting items for them
in the information era. However, a vast class of researches in this area mainly
focus on predicting missing links in bipartite user-item networks (represented
as b... | [
{
"version": "v1",
"created": "Mon, 9 Apr 2012 18:46:53 GMT"
}
] | 2012-04-10T00:00:00 | [
[
"Hu",
"Xiao",
""
],
[
"Chen",
"Chuibo",
""
],
[
"Chen",
"Xiaolong",
""
],
[
"Zhang",
"Zi-Ke",
""
]
] | TITLE: Social Recommender Systems Based on Coupling Network Structure Analysis
ABSTRACT: The past few years has witnessed the great success of recommender systems,
which can significantly help users find relevant and interesting items for them
in the information era. However, a vast class of researches in this area... |
1204.1336 | Md. Abu Naser Bikas | Mohammad Sazzadul Hoque, Md. Abdul Mukit and Md. Abu Naser Bikas | An Implementation of Intrusion Detection System Using Genetic Algorithm | null | International Journal of Network Security & Its Applications,
Volume 4, Number 2, pages 109 - 120, March 2012 | 10.5121/ijnsa.2012.4208 | null | cs.CR cs.NE cs.NI | http://creativecommons.org/licenses/by-nc-sa/3.0/ | Nowadays it is very important to maintain a high level security to ensure
safe and trusted communication of information between various organizations.
But secured data communication over internet and any other network is always
under threat of intrusions and misuses. So Intrusion Detection Systems have
become a needf... | [
{
"version": "v1",
"created": "Thu, 5 Apr 2012 11:40:21 GMT"
}
] | 2012-04-09T00:00:00 | [
[
"Hoque",
"Mohammad Sazzadul",
""
],
[
"Mukit",
"Md. Abdul",
""
],
[
"Bikas",
"Md. Abu Naser",
""
]
] | TITLE: An Implementation of Intrusion Detection System Using Genetic Algorithm
ABSTRACT: Nowadays it is very important to maintain a high level security to ensure
safe and trusted communication of information between various organizations.
But secured data communication over internet and any other network is always... |
1204.1393 | Raquel Urtasun | Koichiro Yamaguchi and Tamir Hazan and David McAllester and Raquel
Urtasun | Continuous Markov Random Fields for Robust Stereo Estimation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we present a novel slanted-plane MRF model which reasons
jointly about occlusion boundaries as well as depth. We formulate the problem
as the one of inference in a hybrid MRF composed of both continuous (i.e.,
slanted 3D planes) and discrete (i.e., occlusion boundaries) random variables.
This allows us ... | [
{
"version": "v1",
"created": "Fri, 6 Apr 2012 01:40:21 GMT"
}
] | 2012-04-09T00:00:00 | [
[
"Yamaguchi",
"Koichiro",
""
],
[
"Hazan",
"Tamir",
""
],
[
"McAllester",
"David",
""
],
[
"Urtasun",
"Raquel",
""
]
] | TITLE: Continuous Markov Random Fields for Robust Stereo Estimation
ABSTRACT: In this paper we present a novel slanted-plane MRF model which reasons
jointly about occlusion boundaries as well as depth. We formulate the problem
as the one of inference in a hybrid MRF composed of both continuous (i.e.,
slanted 3D pla... |
1204.1528 | Thomas Sandholm | Leandro Balby Marinho, Cl\'audio de Souza Baptista, Thomas Sandholm,
Iury Nunes, Caio N\'obrega, Jord\~ao Ara\'ujo | Extracting Geospatial Preferences Using Relational Neighbors | null | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the increasing popularity of location-based social media applications
and devices that automatically tag generated content with locations, large
repositories of collaborative geo-referenced data are appearing on-line.
Efficiently extracting user preferences from these data to determine what
information to recomm... | [
{
"version": "v1",
"created": "Fri, 6 Apr 2012 18:15:55 GMT"
}
] | 2012-04-09T00:00:00 | [
[
"Marinho",
"Leandro Balby",
""
],
[
"Baptista",
"Cláudio de Souza",
""
],
[
"Sandholm",
"Thomas",
""
],
[
"Nunes",
"Iury",
""
],
[
"Nóbrega",
"Caio",
""
],
[
"Araújo",
"Jordão",
""
]
] | TITLE: Extracting Geospatial Preferences Using Relational Neighbors
ABSTRACT: With the increasing popularity of location-based social media applications
and devices that automatically tag generated content with locations, large
repositories of collaborative geo-referenced data are appearing on-line.
Efficiently ext... |
1201.3382 | Ian Goodfellow | Ian J. Goodfellow and Aaron Courville and Yoshua Bengio | Spike-and-Slab Sparse Coding for Unsupervised Feature Discovery | null | null | null | null | stat.ML cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of using a factor model we call {\em spike-and-slab
sparse coding} (S3C) to learn features for a classification task. The S3C model
resembles both the spike-and-slab RBM and sparse coding. Since exact inference
in this model is intractable, we derive a structured variational inference
procedur... | [
{
"version": "v1",
"created": "Mon, 16 Jan 2012 22:00:07 GMT"
},
{
"version": "v2",
"created": "Tue, 3 Apr 2012 22:48:52 GMT"
}
] | 2012-04-05T00:00:00 | [
[
"Goodfellow",
"Ian J.",
""
],
[
"Courville",
"Aaron",
""
],
[
"Bengio",
"Yoshua",
""
]
] | TITLE: Spike-and-Slab Sparse Coding for Unsupervised Feature Discovery
ABSTRACT: We consider the problem of using a factor model we call {\em spike-and-slab
sparse coding} (S3C) to learn features for a classification task. The S3C model
resembles both the spike-and-slab RBM and sparse coding. Since exact inference
... |
1110.2096 | Philipp Herrmann | Philipp N. Herrmann, Dennis O. Kundisch, Mohammad S. Rahman | Beating Irrationality: Does Delegating to IT Alleviate the Sunk Cost
Effect? | null | null | null | null | cs.HC cs.CY cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this research, we investigate the impact of delegating decision making to
information technology (IT) on an important human decision bias - the sunk cost
effect. To address our research question, we use a unique and very rich dataset
containing actual market transaction data for approximately 7,000 pay-per-bid
auc... | [
{
"version": "v1",
"created": "Mon, 10 Oct 2011 16:23:18 GMT"
},
{
"version": "v2",
"created": "Tue, 3 Apr 2012 15:34:53 GMT"
}
] | 2012-04-04T00:00:00 | [
[
"Herrmann",
"Philipp N.",
""
],
[
"Kundisch",
"Dennis O.",
""
],
[
"Rahman",
"Mohammad S.",
""
]
] | TITLE: Beating Irrationality: Does Delegating to IT Alleviate the Sunk Cost
Effect?
ABSTRACT: In this research, we investigate the impact of delegating decision making to
information technology (IT) on an important human decision bias - the sunk cost
effect. To address our research question, we use a unique and v... |
1204.0033 | Ryan Rossi | Ryan A. Rossi, Luke K. McDowell, David W. Aha and Jennifer Neville | Transforming Graph Representations for Statistical Relational Learning | null | null | null | null | stat.ML cs.AI cs.LG cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Relational data representations have become an increasingly important topic
due to the recent proliferation of network datasets (e.g., social, biological,
information networks) and a corresponding increase in the application of
statistical relational learning (SRL) algorithms to these domains. In this
article, we exa... | [
{
"version": "v1",
"created": "Fri, 30 Mar 2012 21:38:52 GMT"
}
] | 2012-04-03T00:00:00 | [
[
"Rossi",
"Ryan A.",
""
],
[
"McDowell",
"Luke K.",
""
],
[
"Aha",
"David W.",
""
],
[
"Neville",
"Jennifer",
""
]
] | TITLE: Transforming Graph Representations for Statistical Relational Learning
ABSTRACT: Relational data representations have become an increasingly important topic
due to the recent proliferation of network datasets (e.g., social, biological,
information networks) and a corresponding increase in the application of
... |
1204.0184 | Youssef Bassil | Youssef Bassil | Parallel Spell-Checking Algorithm Based on Yahoo! N-Grams Dataset | LACSC - Lebanese Association for Computational Sciences,
http://www.lacsc.org/; International Journal of Research and Reviews in
Computer Science (IJRRCS), Vol. 3, No. 1, February 2012 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Spell-checking is the process of detecting and sometimes providing
suggestions for incorrectly spelled words in a text. Basically, the larger the
dictionary of a spell-checker is, the higher is the error detection rate;
otherwise, misspellings would pass undetected. Unfortunately, traditional
dictionaries suffer from... | [
{
"version": "v1",
"created": "Sun, 1 Apr 2012 09:28:20 GMT"
}
] | 2012-04-03T00:00:00 | [
[
"Bassil",
"Youssef",
""
]
] | TITLE: Parallel Spell-Checking Algorithm Based on Yahoo! N-Grams Dataset
ABSTRACT: Spell-checking is the process of detecting and sometimes providing
suggestions for incorrectly spelled words in a text. Basically, the larger the
dictionary of a spell-checker is, the higher is the error detection rate;
otherwise, mi... |
1204.0233 | O. Paul Isikaku-Ironkwe | O. Paul Isikaku-Ironkwe | Transition Temperatures of Superconductors estimated from Periodic Table
Properties | 28 pages,10 Tables, 5 figures | null | null | null | physics.gen-ph cond-mat.supr-con | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Predicting the transition temperature, Tc, of a superconductor from Periodic
Table normal state properties is regarded as one of the grand challenges of
superconductivity. By studying the correlations of Periodic Table properties
with known superconductors, it is possible to estimate their transition
temperatures. St... | [
{
"version": "v1",
"created": "Sun, 25 Mar 2012 06:39:25 GMT"
}
] | 2012-04-03T00:00:00 | [
[
"Isikaku-Ironkwe",
"O. Paul",
""
]
] | TITLE: Transition Temperatures of Superconductors estimated from Periodic Table
Properties
ABSTRACT: Predicting the transition temperature, Tc, of a superconductor from Periodic
Table normal state properties is regarded as one of the grand challenges of
superconductivity. By studying the correlations of Periodic ... |
1110.1328 | Venu Satuluri | Venu Satuluri and Srinivasan Parthasarathy | Bayesian Locality Sensitive Hashing for Fast Similarity Search | 13 pages, 5 Tables, 21 figures. Added acknowledgments in v3. A
slightly shorter version of this paper without the appendix has been
published in the PVLDB journal, 5(5):430-441, 2012.
http://vldb.org/pvldb/vol5/p430_venusatuluri_vldb2012.pdf | PVLDB 5(5):430-441, 2012 | null | null | cs.DB cs.AI cs.DS cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a collection of objects and an associated similarity measure, the
all-pairs similarity search problem asks us to find all pairs of objects with
similarity greater than a certain user-specified threshold. Locality-sensitive
hashing (LSH) based methods have become a very popular approach for this
problem. However... | [
{
"version": "v1",
"created": "Thu, 6 Oct 2011 17:13:48 GMT"
},
{
"version": "v2",
"created": "Sun, 11 Dec 2011 17:46:46 GMT"
},
{
"version": "v3",
"created": "Wed, 28 Mar 2012 19:34:39 GMT"
}
] | 2012-03-29T00:00:00 | [
[
"Satuluri",
"Venu",
""
],
[
"Parthasarathy",
"Srinivasan",
""
]
] | TITLE: Bayesian Locality Sensitive Hashing for Fast Similarity Search
ABSTRACT: Given a collection of objects and an associated similarity measure, the
all-pairs similarity search problem asks us to find all pairs of objects with
similarity greater than a certain user-specified threshold. Locality-sensitive
hashing... |
1203.5474 | Yanhua Li | Yanhua Li, Zhi-Li Zhang, Jie Bao | Mutual or Unrequited Love: Identifying Stable Clusters in Social
Networks with Uni- and Bi-directional Links | 10pages. A short version appears in 9th Workshop on Algorithms and
Models for the Web Graph (WAW 2012) | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many social networks, e.g., Slashdot and Twitter, can be represented as
directed graphs (digraphs) with two types of links between entities: mutual
(bi-directional) and one-way (uni-directional) connections. Social science
theories reveal that mutual connections are more stable than one-way
connections, and one-way c... | [
{
"version": "v1",
"created": "Sun, 25 Mar 2012 07:22:14 GMT"
}
] | 2012-03-27T00:00:00 | [
[
"Li",
"Yanhua",
""
],
[
"Zhang",
"Zhi-Li",
""
],
[
"Bao",
"Jie",
""
]
] | TITLE: Mutual or Unrequited Love: Identifying Stable Clusters in Social
Networks with Uni- and Bi-directional Links
ABSTRACT: Many social networks, e.g., Slashdot and Twitter, can be represented as
directed graphs (digraphs) with two types of links between entities: mutual
(bi-directional) and one-way (uni-direct... |
1111.0680 | Daniele Marinazzo | Daniele Marinazzo, Mario Pellicoro, Sebastiano Stramaglia | Causal information approach to partial conditioning in multivariate data
sets | accepted for publication in Computational and Mathematical Methods in
Medicine, special issue on "Methodological Advances in Brain Connectivity" | null | null | null | physics.data-an cond-mat.dis-nn | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | When evaluating causal influence from one time series to another in a
multivariate dataset it is necessary to take into account the conditioning
effect of the other variables. In the presence of many variables, and possibly
of a reduced number of samples, full conditioning can lead to computational and
numerical prob... | [
{
"version": "v1",
"created": "Wed, 2 Nov 2011 22:17:43 GMT"
},
{
"version": "v2",
"created": "Fri, 23 Mar 2012 16:11:35 GMT"
}
] | 2012-03-26T00:00:00 | [
[
"Marinazzo",
"Daniele",
""
],
[
"Pellicoro",
"Mario",
""
],
[
"Stramaglia",
"Sebastiano",
""
]
] | TITLE: Causal information approach to partial conditioning in multivariate data
sets
ABSTRACT: When evaluating causal influence from one time series to another in a
multivariate dataset it is necessary to take into account the conditioning
effect of the other variables. In the presence of many variables, and poss... |
1203.5124 | Liang Zhang | Rajiv Khanna, Liang Zhang, Deepak Agarwal, Beechung Chen | Parallel Matrix Factorization for Binary Response | null | null | null | null | cs.LG stat.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Predicting user affinity to items is an important problem in applications
like content optimization, computational advertising, and many more. While
bilinear random effect models (matrix factorization) provide state-of-the-art
performance when minimizing RMSE through a Gaussian response model on explicit
ratings data... | [
{
"version": "v1",
"created": "Thu, 22 Mar 2012 20:54:53 GMT"
}
] | 2012-03-26T00:00:00 | [
[
"Khanna",
"Rajiv",
""
],
[
"Zhang",
"Liang",
""
],
[
"Agarwal",
"Deepak",
""
],
[
"Chen",
"Beechung",
""
]
] | TITLE: Parallel Matrix Factorization for Binary Response
ABSTRACT: Predicting user affinity to items is an important problem in applications
like content optimization, computational advertising, and many more. While
bilinear random effect models (matrix factorization) provide state-of-the-art
performance when minim... |
1203.5262 | Youssef Bassil | Youssef Bassil, Paul Semaan | ASR Context-Sensitive Error Correction Based on Microsoft N-Gram Dataset | LACSC - Lebanese Association for Computational Sciences -
http://www.lacsc.org | Journal of Computing, Vol.4, No.1, January 2012 | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | At the present time, computers are employed to solve complex tasks and
problems ranging from simple calculations to intensive digital image processing
and intricate algorithmic optimization problems to computationally-demanding
weather forecasting problems. ASR short for Automatic Speech Recognition is yet
another ty... | [
{
"version": "v1",
"created": "Fri, 23 Mar 2012 14:51:05 GMT"
}
] | 2012-03-26T00:00:00 | [
[
"Bassil",
"Youssef",
""
],
[
"Semaan",
"Paul",
""
]
] | TITLE: ASR Context-Sensitive Error Correction Based on Microsoft N-Gram Dataset
ABSTRACT: At the present time, computers are employed to solve complex tasks and
problems ranging from simple calculations to intensive digital image processing
and intricate algorithmic optimization problems to computationally-demandin... |
1203.4135 | Eric Seidel | Eric L. Seidel | Metadata Management in Scientific Computing | 8 pages, 5 figures | null | null | null | cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Complex scientific codes and the datasets they generate are in need of a
sophisticated categorization environment that allows the community to store,
search, and enhance metadata in an open, dynamic system. Currently, data is
often presented in a read-only format, distilled and curated by a select group
of researcher... | [
{
"version": "v1",
"created": "Mon, 19 Mar 2012 15:35:36 GMT"
}
] | 2012-03-20T00:00:00 | [
[
"Seidel",
"Eric L.",
""
]
] | TITLE: Metadata Management in Scientific Computing
ABSTRACT: Complex scientific codes and the datasets they generate are in need of a
sophisticated categorization environment that allows the community to store,
search, and enhance metadata in an open, dynamic system. Currently, data is
often presented in a read-onl... |
1203.3463 | Amr Ahmed | Amr Ahmed, Eric P. Xing | Timeline: A Dynamic Hierarchical Dirichlet Process Model for Recovering
Birth/Death and Evolution of Topics in Text Stream | Appears in Proceedings of the Twenty-Sixth Conference on Uncertainty
in Artificial Intelligence (UAI2010) | null | null | UAI-P-2010-PG-20-29 | cs.IR cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Topic models have proven to be a useful tool for discovering latent
structures in document collections. However, most document collections often
come as temporal streams and thus several aspects of the latent structure such
as the number of topics, the topics' distribution and popularity are
time-evolving. Several mo... | [
{
"version": "v1",
"created": "Thu, 15 Mar 2012 11:17:56 GMT"
}
] | 2012-03-19T00:00:00 | [
[
"Ahmed",
"Amr",
""
],
[
"Xing",
"Eric P.",
""
]
] | TITLE: Timeline: A Dynamic Hierarchical Dirichlet Process Model for Recovering
Birth/Death and Evolution of Topics in Text Stream
ABSTRACT: Topic models have proven to be a useful tool for discovering latent
structures in document collections. However, most document collections often
come as temporal streams and ... |
1203.3483 | Mithun Das Gupta | Mithun Das Gupta, Thomas S. Huang | Regularized Maximum Likelihood for Intrinsic Dimension Estimation | Appears in Proceedings of the Twenty-Sixth Conference on Uncertainty
in Artificial Intelligence (UAI2010) | null | null | UAI-P-2010-PG-220-227 | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a new method for estimating the intrinsic dimension of a dataset
by applying the principle of regularized maximum likelihood to the distances
between close neighbors. We propose a regularization scheme which is motivated
by divergence minimization principles. We derive the estimator by a Poisson
process ap... | [
{
"version": "v1",
"created": "Thu, 15 Mar 2012 11:17:56 GMT"
}
] | 2012-03-19T00:00:00 | [
[
"Gupta",
"Mithun Das",
""
],
[
"Huang",
"Thomas S.",
""
]
] | TITLE: Regularized Maximum Likelihood for Intrinsic Dimension Estimation
ABSTRACT: We propose a new method for estimating the intrinsic dimension of a dataset
by applying the principle of regularized maximum likelihood to the distances
between close neighbors. We propose a regularization scheme which is motivated
b... |
1203.3486 | Berk Kapicioglu | Berk Kapicioglu, Robert E. Schapire, Martin Wikelski, Tamara Broderick | Combining Spatial and Telemetric Features for Learning Animal Movement
Models | Appears in Proceedings of the Twenty-Sixth Conference on Uncertainty
in Artificial Intelligence (UAI2010) | null | null | UAI-P-2010-PG-260-267 | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a new graphical model for tracking radio-tagged animals and
learning their movement patterns. The model provides a principled way to
combine radio telemetry data with an arbitrary set of userdefined, spatial
features. We describe an efficient stochastic gradient algorithm for fitting
model parameters to ... | [
{
"version": "v1",
"created": "Thu, 15 Mar 2012 11:17:56 GMT"
}
] | 2012-03-19T00:00:00 | [
[
"Kapicioglu",
"Berk",
""
],
[
"Schapire",
"Robert E.",
""
],
[
"Wikelski",
"Martin",
""
],
[
"Broderick",
"Tamara",
""
]
] | TITLE: Combining Spatial and Telemetric Features for Learning Animal Movement
Models
ABSTRACT: We introduce a new graphical model for tracking radio-tagged animals and
learning their movement patterns. The model provides a principled way to
combine radio telemetry data with an arbitrary set of userdefined, spatia... |
1203.3495 | Qi Mao | Qi Mao, Ivor W. Tsang | Parameter-Free Spectral Kernel Learning | Appears in Proceedings of the Twenty-Sixth Conference on Uncertainty
in Artificial Intelligence (UAI2010) | null | null | UAI-P-2010-PG-350-357 | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Due to the growing ubiquity of unlabeled data, learning with unlabeled data
is attracting increasing attention in machine learning. In this paper, we
propose a novel semi-supervised kernel learning method which can seamlessly
combine manifold structure of unlabeled data and Regularized Least-Squares
(RLS) to learn a ... | [
{
"version": "v1",
"created": "Thu, 15 Mar 2012 11:17:56 GMT"
}
] | 2012-03-19T00:00:00 | [
[
"Mao",
"Qi",
""
],
[
"Tsang",
"Ivor W.",
""
]
] | TITLE: Parameter-Free Spectral Kernel Learning
ABSTRACT: Due to the growing ubiquity of unlabeled data, learning with unlabeled data
is attracting increasing attention in machine learning. In this paper, we
propose a novel semi-supervised kernel learning method which can seamlessly
combine manifold structure of unl... |
1203.3496 | Marina Meila | Marina Meila, Harr Chen | Dirichlet Process Mixtures of Generalized Mallows Models | Appears in Proceedings of the Twenty-Sixth Conference on Uncertainty
in Artificial Intelligence (UAI2010) | null | null | UAI-P-2010-PG-358-367 | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a Dirichlet process mixture model over discrete incomplete
rankings and study two Gibbs sampling inference techniques for estimating
posterior clusterings. The first approach uses a slice sampling subcomponent
for estimating cluster parameters. The second approach marginalizes out several
cluster parameter... | [
{
"version": "v1",
"created": "Thu, 15 Mar 2012 11:17:56 GMT"
}
] | 2012-03-19T00:00:00 | [
[
"Meila",
"Marina",
""
],
[
"Chen",
"Harr",
""
]
] | TITLE: Dirichlet Process Mixtures of Generalized Mallows Models
ABSTRACT: We present a Dirichlet process mixture model over discrete incomplete
rankings and study two Gibbs sampling inference techniques for estimating
posterior clusterings. The first approach uses a slice sampling subcomponent
for estimating cluste... |
1203.3507 | Yuan (Alan) Qi | Yuan (Alan) Qi, Ahmed H. Abdel-Gawad, Thomas P. Minka | Sparse-posterior Gaussian Processes for general likelihoods | Appears in Proceedings of the Twenty-Sixth Conference on Uncertainty
in Artificial Intelligence (UAI2010) | null | null | UAI-P-2010-PG-450-457 | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Gaussian processes (GPs) provide a probabilistic nonparametric representation
of functions in regression, classification, and other problems. Unfortunately,
exact learning with GPs is intractable for large datasets. A variety of
approximate GP methods have been proposed that essentially map the large
dataset into a s... | [
{
"version": "v1",
"created": "Thu, 15 Mar 2012 11:17:56 GMT"
}
] | 2012-03-19T00:00:00 | [
[
"Yuan",
"",
"",
"Alan"
],
[
"Qi",
"",
""
],
[
"Abdel-Gawad",
"Ahmed H.",
""
],
[
"Minka",
"Thomas P.",
""
]
] | TITLE: Sparse-posterior Gaussian Processes for general likelihoods
ABSTRACT: Gaussian processes (GPs) provide a probabilistic nonparametric representation
of functions in regression, classification, and other problems. Unfortunately,
exact learning with GPs is intractable for large datasets. A variety of
approximat... |
1203.3516 | Aleksandr Simma | Aleksandr Simma, Michael I. Jordan | Modeling Events with Cascades of Poisson Processes | Appears in Proceedings of the Twenty-Sixth Conference on Uncertainty
in Artificial Intelligence (UAI2010) | null | null | UAI-P-2010-PG-546-555 | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a probabilistic model of events in continuous time in which each
event triggers a Poisson process of successor events. The ensemble of observed
events is thereby modeled as a superposition of Poisson processes. Efficient
inference is feasible under this model with an EM algorithm. Moreover, the EM
algorith... | [
{
"version": "v1",
"created": "Thu, 15 Mar 2012 11:17:56 GMT"
}
] | 2012-03-19T00:00:00 | [
[
"Simma",
"Aleksandr",
""
],
[
"Jordan",
"Michael I.",
""
]
] | TITLE: Modeling Events with Cascades of Poisson Processes
ABSTRACT: We present a probabilistic model of events in continuous time in which each
event triggers a Poisson process of successor events. The ensemble of observed
events is thereby modeled as a superposition of Poisson processes. Efficient
inference is fea... |
1203.3584 | Tarek El-Shishtawy Ahmed | Tarek El-Shishtawy and Fatma El-Ghannam | An Accurate Arabic Root-Based Lemmatizer for Information Retrieval
Purposes | 9 pages | IJCSI International Journal of Computer Science Issues, Vol. 9,
Issue 1, No 3, January 2012 ISSN (Online): 1694-0814 | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In spite of its robust syntax, semantic cohesion, and less ambiguity, lemma
level analysis and generation does not yet focused in Arabic NLP literatures.
In the current research, we propose the first non-statistical accurate Arabic
lemmatizer algorithm that is suitable for information retrieval (IR) systems.
The prop... | [
{
"version": "v1",
"created": "Thu, 15 Mar 2012 22:49:20 GMT"
}
] | 2012-03-19T00:00:00 | [
[
"El-Shishtawy",
"Tarek",
""
],
[
"El-Ghannam",
"Fatma",
""
]
] | TITLE: An Accurate Arabic Root-Based Lemmatizer for Information Retrieval
Purposes
ABSTRACT: In spite of its robust syntax, semantic cohesion, and less ambiguity, lemma
level analysis and generation does not yet focused in Arabic NLP literatures.
In the current research, we propose the first non-statistical accur... |
1203.3092 | Riccardo Murri | S\'ebastien Moretti, Riccardo Murri, Sergio Maffioletti, Arnold
Kuzniar, Bris\'e\"is Castella, Nicolas Salamin, Marc Robinson-Rechavi, and
Heinz Stockinger | gcodeml: A Grid-enabled Tool for Detecting Positive Selection in
Biological Evolution | 10 pages, 4 figures. To appear in the HealthGrid 2012 conf | null | null | null | cs.DC cs.CE q-bio.PE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the important questions in biological evolution is to know if certain
changes along protein coding genes have contributed to the adaptation of
species. This problem is known to be biologically complex and computationally
very expensive. It, therefore, requires efficient Grid or cluster solutions to
overcome th... | [
{
"version": "v1",
"created": "Wed, 14 Mar 2012 14:08:12 GMT"
}
] | 2012-03-15T00:00:00 | [
[
"Moretti",
"Sébastien",
""
],
[
"Murri",
"Riccardo",
""
],
[
"Maffioletti",
"Sergio",
""
],
[
"Kuzniar",
"Arnold",
""
],
[
"Castella",
"Briséïs",
""
],
[
"Salamin",
"Nicolas",
""
],
[
"Robinson-Rechavi",
"Marc"... | TITLE: gcodeml: A Grid-enabled Tool for Detecting Positive Selection in
Biological Evolution
ABSTRACT: One of the important questions in biological evolution is to know if certain
changes along protein coding genes have contributed to the adaptation of
species. This problem is known to be biologically complex and... |
1203.3170 | Shampa Sengupta | Shampa Sengupta and Asit Kr. Das | Single Reduct Generation Based on Relative Indiscernibility of Rough Set
Theory | 13 pages | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In real world everything is an object which represents particular classes.
Every object can be fully described by its attributes. Any real world dataset
contains large number of attributes and objects. Classifiers give poor
performance when these huge datasets are given as input to it for proper
classification. So fr... | [
{
"version": "v1",
"created": "Wed, 14 Mar 2012 18:34:05 GMT"
}
] | 2012-03-15T00:00:00 | [
[
"Sengupta",
"Shampa",
""
],
[
"Das",
"Asit Kr.",
""
]
] | TITLE: Single Reduct Generation Based on Relative Indiscernibility of Rough Set
Theory
ABSTRACT: In real world everything is an object which represents particular classes.
Every object can be fully described by its attributes. Any real world dataset
contains large number of attributes and objects. Classifiers giv... |
1109.5235 | James Fowler | Nicholas A. Christakis, James H. Fowler | Social Contagion Theory: Examining Dynamic Social Networks and Human
Behavior | null | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Here, we review the research we have done on social contagion. We describe
the methods we have employed (and the assumptions they have entailed) in order
to examine several datasets with complementary strengths and weaknesses,
including the Framingham Heart Study, the National Longitudinal Study of
Adolescent Health,... | [
{
"version": "v1",
"created": "Sat, 24 Sep 2011 06:19:43 GMT"
},
{
"version": "v2",
"created": "Tue, 13 Mar 2012 14:03:00 GMT"
}
] | 2012-03-14T00:00:00 | [
[
"Christakis",
"Nicholas A.",
""
],
[
"Fowler",
"James H.",
""
]
] | TITLE: Social Contagion Theory: Examining Dynamic Social Networks and Human
Behavior
ABSTRACT: Here, we review the research we have done on social contagion. We describe
the methods we have employed (and the assumptions they have entailed) in order
to examine several datasets with complementary strengths and weak... |
1201.2925 | Geetha Manjunath | Geetha Manjunatha, M Narasimha Murty, Dinkar Sitaram | Combining Heterogeneous Classifiers for Relational Databases | Withdrawn - as that was a trial upload only. Non public information | null | null | null | cs.LG cs.DB | http://creativecommons.org/licenses/by/3.0/ | Most enterprise data is distributed in multiple relational databases with
expert-designed schema. Using traditional single-table machine learning
techniques over such data not only incur a computational penalty for converting
to a 'flat' form (mega-join), even the human-specified semantic information
present in the r... | [
{
"version": "v1",
"created": "Fri, 13 Jan 2012 19:54:27 GMT"
},
{
"version": "v2",
"created": "Mon, 12 Mar 2012 20:23:24 GMT"
}
] | 2012-03-14T00:00:00 | [
[
"Manjunatha",
"Geetha",
""
],
[
"Murty",
"M Narasimha",
""
],
[
"Sitaram",
"Dinkar",
""
]
] | TITLE: Combining Heterogeneous Classifiers for Relational Databases
ABSTRACT: Most enterprise data is distributed in multiple relational databases with
expert-designed schema. Using traditional single-table machine learning
techniques over such data not only incur a computational penalty for converting
to a 'flat' ... |
1203.2675 | Yaoyun Shi | Yaoyun Shi | Quantum Simpsons Paradox and High Order Bell-Tsirelson Inequalities | null | null | null | null | quant-ph cs.IT math-ph math.IT math.MP math.ST stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The well-known Simpson's Paradox, or Yule-Simpson Effect, in statistics is
often illustrated by the following thought experiment: A drug may be found in a
trial to increase the survival rate for both men and women, but decrease the
rate for all the subjects as a whole. This paradoxical reversal effect has been
found ... | [
{
"version": "v1",
"created": "Mon, 12 Mar 2012 23:36:44 GMT"
}
] | 2012-03-14T00:00:00 | [
[
"Shi",
"Yaoyun",
""
]
] | TITLE: Quantum Simpsons Paradox and High Order Bell-Tsirelson Inequalities
ABSTRACT: The well-known Simpson's Paradox, or Yule-Simpson Effect, in statistics is
often illustrated by the following thought experiment: A drug may be found in a
trial to increase the survival rate for both men and women, but decrease the... |
1203.2839 | Jan Egger | Jan Egger, Tina Kapur, Thomas Dukatz, Malgorzata Kolodziej, Dzenan
Zukic, Bernd Freisleben, Christopher Nimsky | Square-Cut: A Segmentation Algorithm on the Basis of a Rectangle Shape | 13 pages, 17 figures, 2 tables, 3 equations, 42 references | Egger J, Kapur T, Dukatz T, Kolodziej M, Zukic D, et al. (2012)
Square-Cut: A Segmentation Algorithm on the Basis of a Rectangle Shape. PLoS
ONE 7(2): e31064 | 10.1371/journal.pone.0031064 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a rectangle-based segmentation algorithm that sets up a graph and
performs a graph cut to separate an object from the background. However,
graph-based algorithms distribute the graph's nodes uniformly and equidistantly
on the image. Then, a smoothness term is added to force the cut to prefer a
particular s... | [
{
"version": "v1",
"created": "Tue, 13 Mar 2012 15:41:14 GMT"
}
] | 2012-03-14T00:00:00 | [
[
"Egger",
"Jan",
""
],
[
"Kapur",
"Tina",
""
],
[
"Dukatz",
"Thomas",
""
],
[
"Kolodziej",
"Malgorzata",
""
],
[
"Zukic",
"Dzenan",
""
],
[
"Freisleben",
"Bernd",
""
],
[
"Nimsky",
"Christopher",
""
]
] | TITLE: Square-Cut: A Segmentation Algorithm on the Basis of a Rectangle Shape
ABSTRACT: We present a rectangle-based segmentation algorithm that sets up a graph and
performs a graph cut to separate an object from the background. However,
graph-based algorithms distribute the graph's nodes uniformly and equidistantl... |
1203.2886 | Medha Atre | Medha Atre, Vineet Chaoji, Mohammed J. Zaki | BitPath -- Label Order Constrained Reachability Queries over Large
Graphs | null | null | null | RPI-CS 12-02 | cs.DB cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we focus on the following constrained reachability problem over
edge-labeled graphs like RDF -- "given source node x, destination node y, and a
sequence of edge labels (a, b, c, d), is there a path between the two nodes
such that the edge labels on the path satisfy a regular expression
"*a.*b.*c.*d.*". ... | [
{
"version": "v1",
"created": "Tue, 13 Mar 2012 18:11:55 GMT"
}
] | 2012-03-14T00:00:00 | [
[
"Atre",
"Medha",
""
],
[
"Chaoji",
"Vineet",
""
],
[
"Zaki",
"Mohammed J.",
""
]
] | TITLE: BitPath -- Label Order Constrained Reachability Queries over Large
Graphs
ABSTRACT: In this paper we focus on the following constrained reachability problem over
edge-labeled graphs like RDF -- "given source node x, destination node y, and a
sequence of edge labels (a, b, c, d), is there a path between the... |
1203.1985 | Zhaowen Wang | Zhaowen Wang, Jinjun Wang, Jing Xiao, Kai-Hsiang Lin, Thomas Huang | Substructure and Boundary Modeling for Continuous Action Recognition | Detailed version of the CVPR 2012 paper. 15 pages, 6 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces a probabilistic graphical model for continuous action
recognition with two novel components: substructure transition model and
discriminative boundary model. The first component encodes the sparse and
global temporal transition prior between action primitives in state-space model
to handle the l... | [
{
"version": "v1",
"created": "Fri, 9 Mar 2012 04:16:33 GMT"
}
] | 2012-03-12T00:00:00 | [
[
"Wang",
"Zhaowen",
""
],
[
"Wang",
"Jinjun",
""
],
[
"Xiao",
"Jing",
""
],
[
"Lin",
"Kai-Hsiang",
""
],
[
"Huang",
"Thomas",
""
]
] | TITLE: Substructure and Boundary Modeling for Continuous Action Recognition
ABSTRACT: This paper introduces a probabilistic graphical model for continuous action
recognition with two novel components: substructure transition model and
discriminative boundary model. The first component encodes the sparse and
global ... |
1203.2021 | Sylvain Lespinats | Sylvain Lespinats, Anke Meyer-Baese, Michael Aupetit | A new supervised non-linear mapping | 2 pages | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Supervised mapping methods project multi-dimensional labeled data onto a
2-dimensional space attempting to preserve both data similarities and topology
of classes. Supervised mappings are expected to help the user to understand the
underlying original class structure and to classify new data visually. Several
methods... | [
{
"version": "v1",
"created": "Fri, 9 Mar 2012 09:15:43 GMT"
}
] | 2012-03-12T00:00:00 | [
[
"Lespinats",
"Sylvain",
""
],
[
"Meyer-Baese",
"Anke",
""
],
[
"Aupetit",
"Michael",
""
]
] | TITLE: A new supervised non-linear mapping
ABSTRACT: Supervised mapping methods project multi-dimensional labeled data onto a
2-dimensional space attempting to preserve both data similarities and topology
of classes. Supervised mappings are expected to help the user to understand the
underlying original class struc... |
1203.1483 | Eduard Gabriel B\u{a}z\u{a}van | Eduard Gabriel B\u{a}z\u{a}van, Fuxin Li and Cristian Sminchisescu | Learning Random Kernel Approximations for Object Recognition | null | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Approximations based on random Fourier features have recently emerged as an
efficient and formally consistent methodology to design large-scale kernel
machines. By expressing the kernel as a Fourier expansion, features are
generated based on a finite set of random basis projections, sampled from the
Fourier transform... | [
{
"version": "v1",
"created": "Wed, 7 Mar 2012 14:33:26 GMT"
}
] | 2012-03-08T00:00:00 | [
[
"Băzăvan",
"Eduard Gabriel",
""
],
[
"Li",
"Fuxin",
""
],
[
"Sminchisescu",
"Cristian",
""
]
] | TITLE: Learning Random Kernel Approximations for Object Recognition
ABSTRACT: Approximations based on random Fourier features have recently emerged as an
efficient and formally consistent methodology to design large-scale kernel
machines. By expressing the kernel as a Fourier expansion, features are
generated based... |
1203.1502 | Romain Giot | Romain Giot (GREYC), Christophe Rosenberger (GREYC), Bernadette
Dorizzi (SAMOVAR) | Performance Evaluation of Biometric Template Update | International Biometric Performance Testing Conference 2012,
Gaithersburg, MD, USA : United States (2012) | null | null | null | cs.OH cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Template update allows to modify the biometric reference of a user while he
uses the biometric system. With such kind of mechanism we expect the biometric
system uses always an up to date representation of the user, by capturing his
intra-class (temporary or permanent) variability. Although several studies
exist in t... | [
{
"version": "v1",
"created": "Mon, 27 Feb 2012 16:07:47 GMT"
}
] | 2012-03-08T00:00:00 | [
[
"Giot",
"Romain",
"",
"GREYC"
],
[
"Rosenberger",
"Christophe",
"",
"GREYC"
],
[
"Dorizzi",
"Bernadette",
"",
"SAMOVAR"
]
] | TITLE: Performance Evaluation of Biometric Template Update
ABSTRACT: Template update allows to modify the biometric reference of a user while he
uses the biometric system. With such kind of mechanism we expect the biometric
system uses always an up to date representation of the user, by capturing his
intra-class (t... |
1203.1105 | Xiao-Ke Xu | Xiao-Ke Xu, Jian-Bo Wang, Ye Wu, Michael Small | Pairwise interaction pattern in the weighted communication network | 7 pages, 9 figures | null | null | null | physics.soc-ph cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Although recent studies show that both topological structures and human
dynamics can strongly affect information spreading on social networks, the
complicated interplay of the two significant factors has not yet been clearly
described. In this work, we find a strong pairwise interaction based on
analyzing the weighte... | [
{
"version": "v1",
"created": "Tue, 6 Mar 2012 05:55:24 GMT"
}
] | 2012-03-07T00:00:00 | [
[
"Xu",
"Xiao-Ke",
""
],
[
"Wang",
"Jian-Bo",
""
],
[
"Wu",
"Ye",
""
],
[
"Small",
"Michael",
""
]
] | TITLE: Pairwise interaction pattern in the weighted communication network
ABSTRACT: Although recent studies show that both topological structures and human
dynamics can strongly affect information spreading on social networks, the
complicated interplay of the two significant factors has not yet been clearly
describ... |
1202.6078 | Avishek Saha | Hal Daume III, Jeff M. Phillips, Avishek Saha, Suresh
Venkatasubramanian | Protocols for Learning Classifiers on Distributed Data | 19 pages, 12 figures, accepted at AISTATS 2012 | null | null | null | stat.ML cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of learning classifiers for labeled data that has
been distributed across several nodes. Our goal is to find a single classifier,
with small approximation error, across all datasets while minimizing the
communication between nodes. This setting models real-world communication
bottlenecks in th... | [
{
"version": "v1",
"created": "Mon, 27 Feb 2012 21:33:32 GMT"
}
] | 2012-03-06T00:00:00 | [
[
"Daume",
"Hal",
"III"
],
[
"Phillips",
"Jeff M.",
""
],
[
"Saha",
"Avishek",
""
],
[
"Venkatasubramanian",
"Suresh",
""
]
] | TITLE: Protocols for Learning Classifiers on Distributed Data
ABSTRACT: We consider the problem of learning classifiers for labeled data that has
been distributed across several nodes. Our goal is to find a single classifier,
with small approximation error, across all datasets while minimizing the
communication bet... |
1203.0488 | Shu Kong | Shu Kong and Donghui Wang | Multi-Level Feature Descriptor for Robust Texture Classification via
Locality-Constrained Collaborative Strategy | null | null | null | null | cs.CV cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces a simple but highly efficient ensemble for robust
texture classification, which can effectively deal with translation, scale and
changes of significant viewpoint problems. The proposed method first inherits
the spirit of spatial pyramid matching model (SPM), which is popular for
encoding spatial... | [
{
"version": "v1",
"created": "Fri, 2 Mar 2012 15:15:50 GMT"
}
] | 2012-03-06T00:00:00 | [
[
"Kong",
"Shu",
""
],
[
"Wang",
"Donghui",
""
]
] | TITLE: Multi-Level Feature Descriptor for Robust Texture Classification via
Locality-Constrained Collaborative Strategy
ABSTRACT: This paper introduces a simple but highly efficient ensemble for robust
texture classification, which can effectively deal with translation, scale and
changes of significant viewpoint ... |
1003.0146 | Lihong Li | Lihong Li, Wei Chu, John Langford, Robert E. Schapire | A Contextual-Bandit Approach to Personalized News Article Recommendation | 10 pages, 5 figures | Presented at the Nineteenth International Conference on World Wide
Web (WWW 2010), Raleigh, NC, USA, 2010 | 10.1145/1772690.1772758 | null | cs.LG cs.AI cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Personalized web services strive to adapt their services (advertisements,
news articles, etc) to individual users by making use of both content and user
information. Despite a few recent advances, this problem remains challenging
for at least two reasons. First, web service is featured with dynamically
changing pools... | [
{
"version": "v1",
"created": "Sun, 28 Feb 2010 02:18:59 GMT"
},
{
"version": "v2",
"created": "Thu, 1 Mar 2012 23:49:42 GMT"
}
] | 2012-03-05T00:00:00 | [
[
"Li",
"Lihong",
""
],
[
"Chu",
"Wei",
""
],
[
"Langford",
"John",
""
],
[
"Schapire",
"Robert E.",
""
]
] | TITLE: A Contextual-Bandit Approach to Personalized News Article Recommendation
ABSTRACT: Personalized web services strive to adapt their services (advertisements,
news articles, etc) to individual users by making use of both content and user
information. Despite a few recent advances, this problem remains challeng... |
1203.0058 | Bo Zhao | Bo Zhao, Benjamin I. P. Rubinstein, Jim Gemmell, Jiawei Han | A Bayesian Approach to Discovering Truth from Conflicting Sources for
Data Integration | VLDB2012 | Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 6, pp.
550-561 (2012) | null | null | cs.DB cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In practical data integration systems, it is common for the data sources
being integrated to provide conflicting information about the same entity.
Consequently, a major challenge for data integration is to derive the most
complete and accurate integrated records from diverse and sometimes conflicting
sources. We ter... | [
{
"version": "v1",
"created": "Thu, 1 Mar 2012 00:17:31 GMT"
}
] | 2012-03-05T00:00:00 | [
[
"Zhao",
"Bo",
""
],
[
"Rubinstein",
"Benjamin I. P.",
""
],
[
"Gemmell",
"Jim",
""
],
[
"Han",
"Jiawei",
""
]
] | TITLE: A Bayesian Approach to Discovering Truth from Conflicting Sources for
Data Integration
ABSTRACT: In practical data integration systems, it is common for the data sources
being integrated to provide conflicting information about the same entity.
Consequently, a major challenge for data integration is to der... |
1108.5668 | Gabriel Dulac-Arnold | Gabriel Dulac-Arnold, Ludovic Denoyer, Philippe Preux and Patrick
Gallinari | Datum-Wise Classification: A Sequential Approach to Sparsity | ECML2011 | Lecture Notes in Computer Science, 2011, Volume 6911/2011, 375-390 | 10.1007/978-3-642-23780-5_34 | null | cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a novel classification technique whose aim is to select an
appropriate representation for each datapoint, in contrast to the usual
approach of selecting a representation encompassing the whole dataset. This
datum-wise representation is found by using a sparsity inducing empirical risk,
which is a relaxatio... | [
{
"version": "v1",
"created": "Mon, 29 Aug 2011 17:46:08 GMT"
}
] | 2012-03-02T00:00:00 | [
[
"Dulac-Arnold",
"Gabriel",
""
],
[
"Denoyer",
"Ludovic",
""
],
[
"Preux",
"Philippe",
""
],
[
"Gallinari",
"Patrick",
""
]
] | TITLE: Datum-Wise Classification: A Sequential Approach to Sparsity
ABSTRACT: We propose a novel classification technique whose aim is to select an
appropriate representation for each datapoint, in contrast to the usual
approach of selecting a representation encompassing the whole dataset. This
datum-wise represent... |
1203.0060 | Albert Angel | Albert Angel, Nick Koudas, Nikos Sarkas, Divesh Srivastava | Dense Subgraph Maintenance under Streaming Edge Weight Updates for
Real-time Story Identification | VLDB2012 | Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 6, pp.
574-585 (2012) | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent years have witnessed an unprecedented proliferation of social media.
People around the globe author, every day, millions of blog posts, social
network status updates, etc. This rich stream of information can be used to
identify, on an ongoing basis, emerging stories, and events that capture
popular attention. ... | [
{
"version": "v1",
"created": "Thu, 1 Mar 2012 00:17:48 GMT"
}
] | 2012-03-02T00:00:00 | [
[
"Angel",
"Albert",
""
],
[
"Koudas",
"Nick",
""
],
[
"Sarkas",
"Nikos",
""
],
[
"Srivastava",
"Divesh",
""
]
] | TITLE: Dense Subgraph Maintenance under Streaming Edge Weight Updates for
Real-time Story Identification
ABSTRACT: Recent years have witnessed an unprecedented proliferation of social media.
People around the globe author, every day, millions of blog posts, social
network status updates, etc. This rich stream of ... |
1202.6136 | Dohy Hong | Dohy Hong | D-iteration: evaluation of the update algorithm | 5 pages | null | null | null | cs.DM math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The aim of this paper is to analyse the gain of the update algorithm
associated to the recently proposed D-iteration: the D-iteration is a fluid
diffusion based new iterative method. It exploits a simple intuitive
decomposition of the product matrix-vector as elementary operations of fluid
diffusion (forward scheme) ... | [
{
"version": "v1",
"created": "Tue, 28 Feb 2012 07:04:11 GMT"
}
] | 2012-02-29T00:00:00 | [
[
"Hong",
"Dohy",
""
]
] | TITLE: D-iteration: evaluation of the update algorithm
ABSTRACT: The aim of this paper is to analyse the gain of the update algorithm
associated to the recently proposed D-iteration: the D-iteration is a fluid
diffusion based new iterative method. It exploits a simple intuitive
decomposition of the product matrix-v... |
1202.6168 | Dohy Hong | Dohy Hong | D-iteration: Evaluation of the Asynchronous Distributed Computation | 8 pages | null | null | null | math.NA cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The aim of this paper is to present a first evaluation of the potential of an
asynchronous distributed computation associated to the recently proposed
approach, D-iteration: the D-iteration is a fluid diffusion based iterative
method, which has the advantage of being natively distributive. It exploits a
simple intuit... | [
{
"version": "v1",
"created": "Tue, 28 Feb 2012 10:27:46 GMT"
}
] | 2012-02-29T00:00:00 | [
[
"Hong",
"Dohy",
""
]
] | TITLE: D-iteration: Evaluation of the Asynchronous Distributed Computation
ABSTRACT: The aim of this paper is to present a first evaluation of the potential of an
asynchronous distributed computation associated to the recently proposed
approach, D-iteration: the D-iteration is a fluid diffusion based iterative
meth... |
1202.5713 | Michalis Potamias | Michalis Potamias | The warm-start bias of Yelp ratings | 5 pages, 5 figures | null | null | null | cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Yelp ratings are often viewed as a reputation metric for local businesses. In
this paper we study how Yelp ratings evolve over time. Our main finding is that
on average the first ratings that businesses receive overestimate their
eventual reputation. In particular, the first review that a business receives
in our dat... | [
{
"version": "v1",
"created": "Sun, 26 Feb 2012 01:42:57 GMT"
}
] | 2012-02-28T00:00:00 | [
[
"Potamias",
"Michalis",
""
]
] | TITLE: The warm-start bias of Yelp ratings
ABSTRACT: Yelp ratings are often viewed as a reputation metric for local businesses. In
this paper we study how Yelp ratings evolve over time. Our main finding is that
on average the first ratings that businesses receive overestimate their
eventual reputation. In particula... |
1002.1880 | Florian Sikora | Sylvain Guillemot, Florian Sikora | Finding and counting vertex-colored subtrees | Conference version in International Symposium on Mathematical
Foundations of Computer Science (MFCS), Brno : Czech Republic (2010) Journal
Version in Algorithmica | null | 10.1007/s00453-011-9600-8 | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The problems studied in this article originate from the Graph Motif problem
introduced by Lacroix et al. in the context of biological networks. The problem
is to decide if a vertex-colored graph has a connected subgraph whose colors
equal a given multiset of colors $M$. It is a graph pattern-matching problem
variant,... | [
{
"version": "v1",
"created": "Tue, 9 Feb 2010 15:19:54 GMT"
},
{
"version": "v2",
"created": "Mon, 10 May 2010 12:18:20 GMT"
},
{
"version": "v3",
"created": "Tue, 15 Jun 2010 07:42:54 GMT"
},
{
"version": "v4",
"created": "Fri, 24 Feb 2012 15:35:28 GMT"
}
] | 2012-02-27T00:00:00 | [
[
"Guillemot",
"Sylvain",
""
],
[
"Sikora",
"Florian",
""
]
] | TITLE: Finding and counting vertex-colored subtrees
ABSTRACT: The problems studied in this article originate from the Graph Motif problem
introduced by Lacroix et al. in the context of biological networks. The problem
is to decide if a vertex-colored graph has a connected subgraph whose colors
equal a given multise... |
1202.5477 | Arkaitz Zubiaga | Arkaitz Zubiaga and Raquel Mart\'inez and V\'ictor Fresno | Analyzing Tag Distributions in Folksonomies for Resource Classification | null | KSEM 2011, 5th International Conference on Knowledge Science,
Engineering and Management | null | null | cs.DL cs.IR | http://creativecommons.org/licenses/by-nc-sa/3.0/ | Recent research has shown the usefulness of social tags as a data source to
feed resource classification. Little is known about the effect of settings on
folksonomies created on social tagging systems. In this work, we consider the
settings of social tagging systems to further understand tag distributions in
folksono... | [
{
"version": "v1",
"created": "Thu, 23 Feb 2012 18:36:06 GMT"
}
] | 2012-02-27T00:00:00 | [
[
"Zubiaga",
"Arkaitz",
""
],
[
"Martínez",
"Raquel",
""
],
[
"Fresno",
"Víctor",
""
]
] | TITLE: Analyzing Tag Distributions in Folksonomies for Resource Classification
ABSTRACT: Recent research has shown the usefulness of social tags as a data source to
feed resource classification. Little is known about the effect of settings on
folksonomies created on social tagging systems. In this work, we consider... |
1202.4805 | Joseph Pfeiffer III | Joseph J. Pfeiffer III, Timothy La Fond, Sebastian Moreno, Jennifer
Neville | Fast Generation of Large Scale Social Networks with Clustering | 11 pages | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A key challenge within the social network literature is the problem of
network generation - that is, how can we create synthetic networks that match
characteristics traditionally found in most real world networks? Important
characteristics that are present in social networks include a power law degree
distribution, s... | [
{
"version": "v1",
"created": "Wed, 22 Feb 2012 01:35:16 GMT"
}
] | 2012-02-23T00:00:00 | [
[
"Pfeiffer",
"Joseph J.",
"III"
],
[
"La Fond",
"Timothy",
""
],
[
"Moreno",
"Sebastian",
""
],
[
"Neville",
"Jennifer",
""
]
] | TITLE: Fast Generation of Large Scale Social Networks with Clustering
ABSTRACT: A key challenge within the social network literature is the problem of
network generation - that is, how can we create synthetic networks that match
characteristics traditionally found in most real world networks? Important
characterist... |
1201.3133 | Odemir Bruno PhD | Jo\~ao Batista Florindo, Odemir Martinez Bruno | Fractal Descriptors in the Fourier Domain Applied to Color Texture
Analysis | Chaos, Volume 21, Issue 4, 2011 | null | 10.1063/1.3650233 | null | physics.data-an cs.CV math.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The present work proposes the development of a novel method to provide
descriptors for colored texture images. The method consists in two steps. In
the first, we apply a linear transform in the color space of the image aiming
at highlighting spatial structuring relations among the color of pixels. In a
second moment,... | [
{
"version": "v1",
"created": "Sun, 15 Jan 2012 22:33:43 GMT"
},
{
"version": "v2",
"created": "Mon, 20 Feb 2012 01:20:34 GMT"
}
] | 2012-02-21T00:00:00 | [
[
"Florindo",
"João Batista",
""
],
[
"Bruno",
"Odemir Martinez",
""
]
] | TITLE: Fractal Descriptors in the Fourier Domain Applied to Color Texture
Analysis
ABSTRACT: The present work proposes the development of a novel method to provide
descriptors for colored texture images. The method consists in two steps. In
the first, we apply a linear transform in the color space of the image ai... |
1201.4292 | John Whitbeck | John Whitbeck, Yoann Lopez, Jeremie Leguay, Vania Conan, Marcelo Dias
de Amorim | Push-and-Track: Saving Infrastructure Bandwidth Through Opportunistic
Forwarding | Accepted for publication in the Pervasive and Mobile Computing
journal | null | 10.1016/j.pmcj.2012.02.001 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Major wireless operators are nowadays facing network capacity issues in
striving to meet the growing demands of mobile users. At the same time,
3G-enabled devices increasingly benefit from ad hoc radio connectivity (e.g.,
Wi-Fi). In this context of hybrid connectivity, we propose Push-and-track, a
content dissemina- ... | [
{
"version": "v1",
"created": "Fri, 20 Jan 2012 13:53:37 GMT"
},
{
"version": "v2",
"created": "Tue, 7 Feb 2012 10:26:19 GMT"
},
{
"version": "v3",
"created": "Sat, 18 Feb 2012 14:15:51 GMT"
}
] | 2012-02-21T00:00:00 | [
[
"Whitbeck",
"John",
""
],
[
"Lopez",
"Yoann",
""
],
[
"Leguay",
"Jeremie",
""
],
[
"Conan",
"Vania",
""
],
[
"de Amorim",
"Marcelo Dias",
""
]
] | TITLE: Push-and-Track: Saving Infrastructure Bandwidth Through Opportunistic
Forwarding
ABSTRACT: Major wireless operators are nowadays facing network capacity issues in
striving to meet the growing demands of mobile users. At the same time,
3G-enabled devices increasingly benefit from ad hoc radio connectivity (... |
1202.3702 | Avleen S. Bijral | Avleen S. Bijral, Nathan Ratliff, Nathan Srebro | Semi-supervised Learning with Density Based Distances | null | null | null | UAI-P-2011-PG-43-50 | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a simple, yet effective, approach to Semi-Supervised Learning. Our
approach is based on estimating density-based distances (DBD) using a shortest
path calculation on a graph. These Graph-DBD estimates can then be used in any
distance-based supervised learning method, such as Nearest Neighbor methods and
SV... | [
{
"version": "v1",
"created": "Tue, 14 Feb 2012 16:41:17 GMT"
}
] | 2012-02-20T00:00:00 | [
[
"Bijral",
"Avleen S.",
""
],
[
"Ratliff",
"Nathan",
""
],
[
"Srebro",
"Nathan",
""
]
] | TITLE: Semi-supervised Learning with Density Based Distances
ABSTRACT: We present a simple, yet effective, approach to Semi-Supervised Learning. Our
approach is based on estimating density-based distances (DBD) using a shortest
path calculation on a graph. These Graph-DBD estimates can then be used in any
distance-... |
1202.3722 | Inmar Givoni | Inmar Givoni, Clement Chung, Brendan J. Frey | Hierarchical Affinity Propagation | null | null | null | UAI-P-2011-PG-238-246 | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Affinity propagation is an exemplar-based clustering algorithm that finds a
set of data-points that best exemplify the data, and associates each datapoint
with one exemplar. We extend affinity propagation in a principled way to solve
the hierarchical clustering problem, which arises in a variety of domains
including ... | [
{
"version": "v1",
"created": "Tue, 14 Feb 2012 16:41:17 GMT"
}
] | 2012-02-20T00:00:00 | [
[
"Givoni",
"Inmar",
""
],
[
"Chung",
"Clement",
""
],
[
"Frey",
"Brendan J.",
""
]
] | TITLE: Hierarchical Affinity Propagation
ABSTRACT: Affinity propagation is an exemplar-based clustering algorithm that finds a
set of data-points that best exemplify the data, and associates each datapoint
with one exemplar. We extend affinity propagation in a principled way to solve
the hierarchical clustering pro... |
1202.3769 | Feng Yan | Feng Yan, Zenglin Xu, Yuan (Alan) Qi | Sparse matrix-variate Gaussian process blockmodels for network modeling | null | null | null | UAI-P-2011-PG-745-752 | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We face network data from various sources, such as protein interactions and
online social networks. A critical problem is to model network interactions and
identify latent groups of network nodes. This problem is challenging due to
many reasons. For example, the network nodes are interdependent instead of
independent... | [
{
"version": "v1",
"created": "Tue, 14 Feb 2012 16:41:17 GMT"
}
] | 2012-02-20T00:00:00 | [
[
"Yan",
"Feng",
"",
"Alan"
],
[
"Xu",
"Zenglin",
"",
"Alan"
],
[
"Yuan",
"",
"",
"Alan"
],
[
"Qi",
"",
""
]
] | TITLE: Sparse matrix-variate Gaussian process blockmodels for network modeling
ABSTRACT: We face network data from various sources, such as protein interactions and
online social networks. A critical problem is to model network interactions and
identify latent groups of network nodes. This problem is challenging du... |
1202.3770 | Jian-Bo Yang | Jian-Bo Yang, Ivor W. Tsang | Hierarchical Maximum Margin Learning for Multi-Class Classification | null | null | null | UAI-P-2011-PG-753-760 | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Due to myriads of classes, designing accurate and efficient classifiers
becomes very challenging for multi-class classification. Recent research has
shown that class structure learning can greatly facilitate multi-class
learning. In this paper, we propose a novel method to learn the class structure
for multi-class cl... | [
{
"version": "v1",
"created": "Tue, 14 Feb 2012 16:41:17 GMT"
}
] | 2012-02-20T00:00:00 | [
[
"Yang",
"Jian-Bo",
""
],
[
"Tsang",
"Ivor W.",
""
]
] | TITLE: Hierarchical Maximum Margin Learning for Multi-Class Classification
ABSTRACT: Due to myriads of classes, designing accurate and efficient classifiers
becomes very challenging for multi-class classification. Recent research has
shown that class structure learning can greatly facilitate multi-class
learning. I... |
1202.3776 | Xinhua Zhang | Xinhua Zhang, Ankan Saha, S. V.N. Vishwanatan | Smoothing Multivariate Performance Measures | null | null | null | UAI-P-2011-PG-814-821 | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A Support Vector Method for multivariate performance measures was recently
introduced by Joachims (2005). The underlying optimization problem is currently
solved using cutting plane methods such as SVM-Perf and BMRM. One can show that
these algorithms converge to an eta accurate solution in O(1/Lambda*e)
iterations, ... | [
{
"version": "v1",
"created": "Tue, 14 Feb 2012 16:41:17 GMT"
}
] | 2012-02-20T00:00:00 | [
[
"Zhang",
"Xinhua",
""
],
[
"Saha",
"Ankan",
""
],
[
"Vishwanatan",
"S. V. N.",
""
]
] | TITLE: Smoothing Multivariate Performance Measures
ABSTRACT: A Support Vector Method for multivariate performance measures was recently
introduced by Joachims (2005). The underlying optimization problem is currently
solved using cutting plane methods such as SVM-Perf and BMRM. One can show that
these algorithms con... |
1104.0729 | Afshin Rostamizadeh | Afshin Rostamizadeh, Alekh Agarwal, Peter Bartlett | Online and Batch Learning Algorithms for Data with Missing Features | null | 27th Conference on Uncertainty in Artificial Intelligence (UAI
2011) | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce new online and batch algorithms that are robust to data with
missing features, a situation that arises in many practical applications. In
the online setup, we allow for the comparison hypothesis to change as a
function of the subset of features that is observed on any given round,
extending the standard ... | [
{
"version": "v1",
"created": "Tue, 5 Apr 2011 04:28:51 GMT"
},
{
"version": "v2",
"created": "Mon, 2 May 2011 05:24:55 GMT"
},
{
"version": "v3",
"created": "Sat, 21 May 2011 18:17:23 GMT"
},
{
"version": "v4",
"created": "Thu, 16 Jun 2011 15:40:28 GMT"
}
] | 2012-02-19T00:00:00 | [
[
"Rostamizadeh",
"Afshin",
""
],
[
"Agarwal",
"Alekh",
""
],
[
"Bartlett",
"Peter",
""
]
] | TITLE: Online and Batch Learning Algorithms for Data with Missing Features
ABSTRACT: We introduce new online and batch algorithms that are robust to data with
missing features, a situation that arises in many practical applications. In
the online setup, we allow for the comparison hypothesis to change as a
function... |
1202.3619 | Yamir Moreno Vega | J. Sanz, E.Cozzo, J. Borge-Holthoefer, and Y. Moreno | Topological effects of data incompleteness of gene regulatory networks | Supplementary Material is available on request | null | null | null | physics.bio-ph physics.soc-ph q-bio.MN | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The topological analysis of biological networks has been a prolific topic in
network science during the last decade. A persistent problem with this approach
is the inherent uncertainty and noisy nature of the data. One of the cases in
which this situation is more marked is that of transcriptional regulatory
networks ... | [
{
"version": "v1",
"created": "Thu, 16 Feb 2012 15:30:32 GMT"
}
] | 2012-02-17T00:00:00 | [
[
"Sanz",
"J.",
""
],
[
"Cozzo",
"E.",
""
],
[
"Borge-Holthoefer",
"J.",
""
],
[
"Moreno",
"Y.",
""
]
] | TITLE: Topological effects of data incompleteness of gene regulatory networks
ABSTRACT: The topological analysis of biological networks has been a prolific topic in
network science during the last decade. A persistent problem with this approach
is the inherent uncertainty and noisy nature of the data. One of the ca... |
1202.2368 | Afzal Godil | Sarah Tang and Afzal Godil | An evaluation of local shape descriptors for 3D shape retrieval | IS&T/SPIE Electronic Imaging 2012, Proceedings Vol. 8290
Three-Dimensional Image Processing (3DIP) and Applications II, Atilla M.
Baskurt; Robert Sitnik, Editors, 82900N Dates: Tuesday-Thursday 24 - 26
January 2012, Paper 8290-22 | null | 10.1117/12.912153 | Paper 8290-22, Proceedings Vol. 8290 | cs.CV cs.CG cs.DL cs.IR cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As the usage of 3D models increases, so does the importance of developing
accurate 3D shape retrieval algorithms. A common approach is to calculate a
shape descriptor for each object, which can then be compared to determine two
objects' similarity. However, these descriptors are often evaluated
independently and on d... | [
{
"version": "v1",
"created": "Fri, 10 Feb 2012 21:02:39 GMT"
}
] | 2012-02-14T00:00:00 | [
[
"Tang",
"Sarah",
""
],
[
"Godil",
"Afzal",
""
]
] | TITLE: An evaluation of local shape descriptors for 3D shape retrieval
ABSTRACT: As the usage of 3D models increases, so does the importance of developing
accurate 3D shape retrieval algorithms. A common approach is to calculate a
shape descriptor for each object, which can then be compared to determine two
objects... |
1202.2449 | Salah A. Aly | Moataz M. Abdelwahab, Salah A. Aly, Islam Yousry | Efficient Web-based Facial Recognition System Employing 2DHOG | null | null | null | null | cs.CV cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, a system for facial recognition to identify missing and found
people in Hajj and Umrah is described as a web portal. Explicitly, we present a
novel algorithm for recognition and classifications of facial images based on
applying 2DPCA to a 2D representation of the Histogram of oriented gradients
(2D-HO... | [
{
"version": "v1",
"created": "Sat, 11 Feb 2012 15:24:18 GMT"
}
] | 2012-02-14T00:00:00 | [
[
"Abdelwahab",
"Moataz M.",
""
],
[
"Aly",
"Salah A.",
""
],
[
"Yousry",
"Islam",
""
]
] | TITLE: Efficient Web-based Facial Recognition System Employing 2DHOG
ABSTRACT: In this paper, a system for facial recognition to identify missing and found
people in Hajj and Umrah is described as a web portal. Explicitly, we present a
novel algorithm for recognition and classifications of facial images based on
ap... |
1112.2459 | Alireza Abbasi | Alireza Abbasi, Liaquat Hossain | Hybrid Centrality Measures for Binary and Weighted Networks | a short version accepted in the 3rd workshop on Complex Network [Full
Paper submitted to JASIST in April 2011] | null | null | null | physics.soc-ph cs.DL cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Existing centrality measures for social network analysis suggest the
im-portance of an actor and give consideration to actor's given structural
position in a network. These existing measures suggest specific attribute of an
actor (i.e., popularity, accessibility, and brokerage behavior). In this study,
we propose new... | [
{
"version": "v1",
"created": "Mon, 12 Dec 2011 07:19:26 GMT"
},
{
"version": "v2",
"created": "Mon, 16 Jan 2012 15:22:11 GMT"
},
{
"version": "v3",
"created": "Sat, 21 Jan 2012 04:53:33 GMT"
},
{
"version": "v4",
"created": "Fri, 10 Feb 2012 04:29:14 GMT"
}
] | 2012-02-13T00:00:00 | [
[
"Abbasi",
"Alireza",
""
],
[
"Hossain",
"Liaquat",
""
]
] | TITLE: Hybrid Centrality Measures for Binary and Weighted Networks
ABSTRACT: Existing centrality measures for social network analysis suggest the
im-portance of an actor and give consideration to actor's given structural
position in a network. These existing measures suggest specific attribute of an
actor (i.e., po... |
1201.5871 | Patrick Perry | Patrick O. Perry, Patrick J. Wolfe | Null models for network data | 12 pages, 2 figures; submitted for publication | null | null | null | math.ST cs.SI stat.ME stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The analysis of datasets taking the form of simple, undirected graphs
continues to gain in importance across a variety of disciplines. Two choices of
null model, the logistic-linear model and the implicit log-linear model, have
come into common use for analyzing such network data, in part because each
accounts for th... | [
{
"version": "v1",
"created": "Fri, 27 Jan 2012 19:30:46 GMT"
}
] | 2012-02-13T00:00:00 | [
[
"Perry",
"Patrick O.",
""
],
[
"Wolfe",
"Patrick J.",
""
]
] | TITLE: Null models for network data
ABSTRACT: The analysis of datasets taking the form of simple, undirected graphs
continues to gain in importance across a variety of disciplines. Two choices of
null model, the logistic-linear model and the implicit log-linear model, have
come into common use for analyzing such ne... |
1202.2153 | Everthon Valadao | Everthon Valadao, Dorgival Guedes, Ricardo Duarte | Caracteriza\c{c}\~ao de tempos de ida-e-volta na Internet | null | Revista Brasileira de Redes de Computadores e Sistemas
Distribu\'idos, v. 3, p. 21-34, 2010 | null | null | cs.NI cs.DC | http://creativecommons.org/licenses/by-nc-sa/3.0/ | Round-trip times (RTTs) are an important metric for the operation of many
applications in the Internet. For instance, they are taken into account when
choosing servers or peers in streaming systems, and they impact the operation
of fault detectors and congestion control algorithms. Therefore, detailed
knowledge about... | [
{
"version": "v1",
"created": "Thu, 9 Feb 2012 23:50:42 GMT"
}
] | 2012-02-13T00:00:00 | [
[
"Valadao",
"Everthon",
""
],
[
"Guedes",
"Dorgival",
""
],
[
"Duarte",
"Ricardo",
""
]
] | TITLE: Caracteriza\c{c}\~ao de tempos de ida-e-volta na Internet
ABSTRACT: Round-trip times (RTTs) are an important metric for the operation of many
applications in the Internet. For instance, they are taken into account when
choosing servers or peers in streaming systems, and they impact the operation
of fault det... |
1202.1990 | Tapobrata Lahiri | Upendra Kumar, Tapobrata Lahiri and Manoj Kumar Pal | Non-parametric convolution based image-segmentation of ill-posed objects
applying context window approach | 10 pages, 7 figures, 4 tables, not published anywhere | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Context-dependence in human cognition process is a well-established fact.
Following this, we introduced the image segmentation method that can use
context to classify a pixel on the basis of its membership to a particular
object-class of the concerned image. In the broad methodological steps, each
pixel was defined b... | [
{
"version": "v1",
"created": "Thu, 9 Feb 2012 14:02:26 GMT"
}
] | 2012-02-10T00:00:00 | [
[
"Kumar",
"Upendra",
""
],
[
"Lahiri",
"Tapobrata",
""
],
[
"Pal",
"Manoj Kumar",
""
]
] | TITLE: Non-parametric convolution based image-segmentation of ill-posed objects
applying context window approach
ABSTRACT: Context-dependence in human cognition process is a well-established fact.
Following this, we introduced the image segmentation method that can use
context to classify a pixel on the basis of ... |
1202.1587 | Karteeka Pavan Kanadam | K. Karteeka Pavan, Allam Appa Rao, A. V. Dattatreya Rao | Automatic Clustering with Single Optimal Solution | 13 pages,4 Tables, 3 figures | Computer Engineering and Intelligent Systems, 2011, vol no.2 no.4
pp149-161 | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Determining optimal number of clusters in a dataset is a challenging task.
Though some methods are available, there is no algorithm that produces unique
clustering solution. The paper proposes an Automatic Merging for Single Optimal
Solution (AMSOS) which aims to generate unique and nearly optimal clusters for
the gi... | [
{
"version": "v1",
"created": "Wed, 8 Feb 2012 03:26:01 GMT"
}
] | 2012-02-09T00:00:00 | [
[
"Pavan",
"K. Karteeka",
""
],
[
"Rao",
"Allam Appa",
""
],
[
"Rao",
"A. V. Dattatreya",
""
]
] | TITLE: Automatic Clustering with Single Optimal Solution
ABSTRACT: Determining optimal number of clusters in a dataset is a challenging task.
Though some methods are available, there is no algorithm that produces unique
clustering solution. The paper proposes an Automatic Merging for Single Optimal
Solution (AMSOS)... |
1202.1656 | Holger Kienle | Holger M. Kienle | Open Data: Reverse Engineering and Maintenance Perspective | 7 pages, 6 figures | null | null | null | cs.SE cs.DL cs.IR | http://creativecommons.org/licenses/by/3.0/ | Open data is an emerging paradigm to share large and diverse datasets --
primarily from governmental agencies, but also from other organizations -- with
the goal to enable the exploitation of the data for societal, academic, and
commercial gains. There are now already many datasets available with diverse
characterist... | [
{
"version": "v1",
"created": "Wed, 8 Feb 2012 11:08:37 GMT"
}
] | 2012-02-09T00:00:00 | [
[
"Kienle",
"Holger M.",
""
]
] | TITLE: Open Data: Reverse Engineering and Maintenance Perspective
ABSTRACT: Open data is an emerging paradigm to share large and diverse datasets --
primarily from governmental agencies, but also from other organizations -- with
the goal to enable the exploitation of the data for societal, academic, and
commercial ... |
1202.0940 | Alex James Dr | Alex Pappachen James and Akshay Maan | Improving feature selection algorithms using normalised feature
histograms | null | Electronics Letters,47, 8, 490-491, 2011 | 10.1049/el.2010.3672 | null | cs.AI cs.CV | http://creativecommons.org/licenses/by-nc-sa/3.0/ | The proposed feature selection method builds a histogram of the most stable
features from random subsets of a training set and ranks the features based on
a classifier based cross-validation. This approach reduces the instability of
features obtained by conventional feature selection methods that occur with
variation... | [
{
"version": "v1",
"created": "Sun, 5 Feb 2012 04:37:40 GMT"
}
] | 2012-02-07T00:00:00 | [
[
"James",
"Alex Pappachen",
""
],
[
"Maan",
"Akshay",
""
]
] | TITLE: Improving feature selection algorithms using normalised feature
histograms
ABSTRACT: The proposed feature selection method builds a histogram of the most stable
features from random subsets of a training set and ranks the features based on
a classifier based cross-validation. This approach reduces the inst... |
1201.6569 | Robert Fink | Robert Fink, Larisa Han, Dan Olteanu | Aggregation in Probabilistic Databases via Knowledge Compilation | VLDB2012 | Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 5, pp.
490-501 (2012) | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a query evaluation technique for positive relational
algebra queries with aggregates on a representation system for probabilistic
data based on the algebraic structures of semiring and semimodule. The core of
our evaluation technique is a procedure that compiles semimodule and semiring
expressions... | [
{
"version": "v1",
"created": "Tue, 31 Jan 2012 15:10:34 GMT"
}
] | 2012-02-01T00:00:00 | [
[
"Fink",
"Robert",
""
],
[
"Han",
"Larisa",
""
],
[
"Olteanu",
"Dan",
""
]
] | TITLE: Aggregation in Probabilistic Databases via Knowledge Compilation
ABSTRACT: This paper presents a query evaluation technique for positive relational
algebra queries with aggregates on a representation system for probabilistic
data based on the algebraic structures of semiring and semimodule. The core of
our e... |
1104.0186 | Diego Garlaschelli | Luca Valori, Francesco Picciolo, Agnes Allansdottir, Diego
Garlaschelli | Reconciling long-term cultural diversity and short-term collective
social behavior | null | PNAS vol. 109, no. 4, pp. 1068-1073 (2012) | 10.1073/pnas.1109514109 | null | physics.soc-ph cs.SI physics.comp-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An outstanding open problem is whether collective social phenomena occurring
over short timescales can systematically reduce cultural heterogeneity in the
long run, and whether offline and online human interactions contribute
differently to the process. Theoretical models suggest that short-term
collective behavior a... | [
{
"version": "v1",
"created": "Fri, 1 Apr 2011 14:35:27 GMT"
}
] | 2012-01-31T00:00:00 | [
[
"Valori",
"Luca",
""
],
[
"Picciolo",
"Francesco",
""
],
[
"Allansdottir",
"Agnes",
""
],
[
"Garlaschelli",
"Diego",
""
]
] | TITLE: Reconciling long-term cultural diversity and short-term collective
social behavior
ABSTRACT: An outstanding open problem is whether collective social phenomena occurring
over short timescales can systematically reduce cultural heterogeneity in the
long run, and whether offline and online human interactions... |
1108.2820 | Marina Sapir | Marina Sapir | Ensemble Risk Modeling Method for Robust Learning on Scarce Data | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In medical risk modeling, typical data are "scarce": they have relatively
small number of training instances (N), censoring, and high dimensionality (M).
We show that the problem may be effectively simplified by reducing it to
bipartite ranking, and introduce new bipartite ranking algorithm, Smooth Rank,
for robust l... | [
{
"version": "v1",
"created": "Sat, 13 Aug 2011 20:47:30 GMT"
},
{
"version": "v2",
"created": "Sat, 28 Jan 2012 07:51:50 GMT"
}
] | 2012-01-31T00:00:00 | [
[
"Sapir",
"Marina",
""
]
] | TITLE: Ensemble Risk Modeling Method for Robust Learning on Scarce Data
ABSTRACT: In medical risk modeling, typical data are "scarce": they have relatively
small number of training instances (N), censoring, and high dimensionality (M).
We show that the problem may be effectively simplified by reducing it to
biparti... |
1201.4597 | Odemir Bruno PhD | Jo\~ao Batista Florindo, Odemir Martinez Bruno | Fractal Descriptors Based on Fourier Spectrum Applied to Texture
Analysis | null | null | null | null | physics.data-an cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work proposes the development and study of a novel technique for the
generation of fractal descriptors used in texture analysis. The novel
descriptors are obtained from a multiscale transform applied to the Fourier
technique of fractal dimension calculus. The power spectrum of the Fourier
transform of the image ... | [
{
"version": "v1",
"created": "Sun, 22 Jan 2012 20:43:50 GMT"
}
] | 2012-01-24T00:00:00 | [
[
"Florindo",
"João Batista",
""
],
[
"Bruno",
"Odemir Martinez",
""
]
] | TITLE: Fractal Descriptors Based on Fourier Spectrum Applied to Texture
Analysis
ABSTRACT: This work proposes the development and study of a novel technique for the
generation of fractal descriptors used in texture analysis. The novel
descriptors are obtained from a multiscale transform applied to the Fourier
tec... |
1201.4714 | Huyen Do | Huyen Do, Alexandros Kalousis, Jun Wang and Adam Woznica | A metric learning perspective of SVM: on the relation of SVM and LMNN | To appear in AISTATS 2012 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Support Vector Machines, SVMs, and the Large Margin Nearest Neighbor
algorithm, LMNN, are two very popular learning algorithms with quite different
learning biases. In this paper we bring them into a unified view and show that
they have a much stronger relation than what is commonly thought. We analyze
SVMs from a me... | [
{
"version": "v1",
"created": "Mon, 23 Jan 2012 13:48:33 GMT"
}
] | 2012-01-24T00:00:00 | [
[
"Do",
"Huyen",
""
],
[
"Kalousis",
"Alexandros",
""
],
[
"Wang",
"Jun",
""
],
[
"Woznica",
"Adam",
""
]
] | TITLE: A metric learning perspective of SVM: on the relation of SVM and LMNN
ABSTRACT: Support Vector Machines, SVMs, and the Large Margin Nearest Neighbor
algorithm, LMNN, are two very popular learning algorithms with quite different
learning biases. In this paper we bring them into a unified view and show that
th... |
1201.4301 | Chitra Kiran N | Chitra Kiran N., G. Narendra Kumar | A Robust Client Verification in cloud enabled m-Commerce using Gaining
Protocol | null | IJCSI International Journal of Computer Science Issues, Vol. 8,
Issue 6, No 2, November 2011 ISSN (Online): 1694-0814 | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The proposed system highlights a novel approach of exclusive verification
process using gain protocol for ensuring security among both the parties
(client-service provider) in m-commerce application with cloud enabled service.
The proposed system is based on the potential to verify the clients with
trusted hand held ... | [
{
"version": "v1",
"created": "Fri, 20 Jan 2012 14:21:15 GMT"
}
] | 2012-01-23T00:00:00 | [
[
"N.",
"Chitra Kiran",
""
],
[
"Kumar",
"G. Narendra",
""
]
] | TITLE: A Robust Client Verification in cloud enabled m-Commerce using Gaining
Protocol
ABSTRACT: The proposed system highlights a novel approach of exclusive verification
process using gain protocol for ensuring security among both the parties
(client-service provider) in m-commerce application with cloud enabled... |
1201.4139 | Odemir Bruno PhD | Bruno Brandoli Machado, Wesley Nunes Gon\c{c}alves, Odemir Martinez
Bruno | Image decomposition with anisotropic diffusion applied to leaf-texture
analysis | Annals of Workshop of Computer Vision 2011 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Texture analysis is an important field of investigation that has received a
great deal of interest from computer vision community. In this paper, we
propose a novel approach for texture modeling based on partial differential
equation (PDE). Each image $f$ is decomposed into a family of derived
sub-images. $f$ is spli... | [
{
"version": "v1",
"created": "Thu, 19 Jan 2012 18:39:41 GMT"
}
] | 2012-01-20T00:00:00 | [
[
"Machado",
"Bruno Brandoli",
""
],
[
"Gonçalves",
"Wesley Nunes",
""
],
[
"Bruno",
"Odemir Martinez",
""
]
] | TITLE: Image decomposition with anisotropic diffusion applied to leaf-texture
analysis
ABSTRACT: Texture analysis is an important field of investigation that has received a
great deal of interest from computer vision community. In this paper, we
propose a novel approach for texture modeling based on partial diffe... |
1201.3900 | Massimiliano Dal Mas | Massimiliano Dal Mas | Elasticity on Ontology Matching of Folksodriven Structure Network | *** This paper has been accepted to the 4th Asian Conference on
Intelligent Information and Database Systems (ACIIDS 2012) - Kaohsiung Taiwan
R.O.C., 19-21 March 2012 *** 9 pages, 4 figures; for details see:
http://www.maxdalmas.com | null | null | null | cs.DL cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Nowadays folksonomy tags are used not just for personal organization, but for
communication and sharing between people sharing their own local interests. In
this paper is considered the new concept structure called "Folksodriven" to
represent folksonomies. The Folksodriven Structure Network (FSN) was thought as
folks... | [
{
"version": "v1",
"created": "Wed, 18 Jan 2012 20:24:35 GMT"
}
] | 2012-01-19T00:00:00 | [
[
"Mas",
"Massimiliano Dal",
""
]
] | TITLE: Elasticity on Ontology Matching of Folksodriven Structure Network
ABSTRACT: Nowadays folksonomy tags are used not just for personal organization, but for
communication and sharing between people sharing their own local interests. In
this paper is considered the new concept structure called "Folksodriven" to
... |
1201.3458 | Jeffrey Yu | Di Wu, Yiping Ke, Jeffrey Xu Yu, Zheng Liu | Detecting Priming News Events | null | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study a problem of detecting priming events based on a time series index
and an evolving document stream. We define a priming event as an event which
triggers abnormal movements of the time series index, i.e., the Iraq war with
respect to the president approval index of President Bush. Existing solutions
either fo... | [
{
"version": "v1",
"created": "Tue, 17 Jan 2012 08:59:57 GMT"
}
] | 2012-01-18T00:00:00 | [
[
"Wu",
"Di",
""
],
[
"Ke",
"Yiping",
""
],
[
"Yu",
"Jeffrey Xu",
""
],
[
"Liu",
"Zheng",
""
]
] | TITLE: Detecting Priming News Events
ABSTRACT: We study a problem of detecting priming events based on a time series index
and an evolving document stream. We define a priming event as an event which
triggers abnormal movements of the time series index, i.e., the Iraq war with
respect to the president approval inde... |
1108.6296 | Feng Yan | Zenglin Xu, Feng Yan, Yuan (Alan) Qi | Infinite Tucker Decomposition: Nonparametric Bayesian Models for
Multiway Data Analysis | null | null | null | null | cs.LG cs.NA | http://creativecommons.org/licenses/by-nc-sa/3.0/ | Tensor decomposition is a powerful computational tool for multiway data
analysis. Many popular tensor decomposition approaches---such as the Tucker
decomposition and CANDECOMP/PARAFAC (CP)---amount to multi-linear
factorization. They are insufficient to model (i) complex interactions between
data entities, (ii) vario... | [
{
"version": "v1",
"created": "Wed, 31 Aug 2011 17:36:26 GMT"
},
{
"version": "v2",
"created": "Sat, 14 Jan 2012 16:11:56 GMT"
}
] | 2012-01-17T00:00:00 | [
[
"Xu",
"Zenglin",
"",
"Alan"
],
[
"Yan",
"Feng",
"",
"Alan"
],
[
"Yuan",
"",
"",
"Alan"
],
[
"Qi",
"",
""
]
] | TITLE: Infinite Tucker Decomposition: Nonparametric Bayesian Models for
Multiway Data Analysis
ABSTRACT: Tensor decomposition is a powerful computational tool for multiway data
analysis. Many popular tensor decomposition approaches---such as the Tucker
decomposition and CANDECOMP/PARAFAC (CP)---amount to multi-li... |
1201.3116 | Odemir Bruno PhD | Jo\~ao Batista Florindo, M\'ario de Castro, Odemir Martinez Bruno | Enhancing Volumetric Bouligand-Minkowski Fractal Descriptors by using
Functional Data Analysis | null | International Journal of Modern Physics C, Volume: 22, Issue:
9(2011) pp. 929-952 | 10.1142/S0129183111016701 | null | cs.CV physics.data-an | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work proposes and study the concept of Functional Data Analysis
transform, applying it to the performance improving of volumetric
Bouligand-Minkowski fractal descriptors. The proposed transform consists
essentially in changing the descriptors originally defined in the space of the
calculus of fractal dimension i... | [
{
"version": "v1",
"created": "Sun, 15 Jan 2012 19:38:48 GMT"
}
] | 2012-01-17T00:00:00 | [
[
"Florindo",
"João Batista",
""
],
[
"de Castro",
"Mário",
""
],
[
"Bruno",
"Odemir Martinez",
""
]
] | TITLE: Enhancing Volumetric Bouligand-Minkowski Fractal Descriptors by using
Functional Data Analysis
ABSTRACT: This work proposes and study the concept of Functional Data Analysis
transform, applying it to the performance improving of volumetric
Bouligand-Minkowski fractal descriptors. The proposed transform con... |
1201.3292 | M\'arton Karsai | Kun Zhao, M\'arton Karsai and Ginestra Bianconi | Entropy of dynamical social networks | null | PLoS ONE 6(12): e28116 (2011) | 10.1371/journal.pone.0028116 | null | physics.soc-ph cond-mat.stat-mech cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Human dynamical social networks encode information and are highly adaptive.
To characterize the information encoded in the fast dynamics of social
interactions, here we introduce the entropy of dynamical social networks. By
analysing a large dataset of phone-call interactions we show evidence that the
dynamical socia... | [
{
"version": "v1",
"created": "Mon, 16 Jan 2012 15:50:39 GMT"
}
] | 2012-01-17T00:00:00 | [
[
"Zhao",
"Kun",
""
],
[
"Karsai",
"Márton",
""
],
[
"Bianconi",
"Ginestra",
""
]
] | TITLE: Entropy of dynamical social networks
ABSTRACT: Human dynamical social networks encode information and are highly adaptive.
To characterize the information encoded in the fast dynamics of social
interactions, here we introduce the entropy of dynamical social networks. By
analysing a large dataset of phone-cal... |
1201.2416 | Pierre Machart | Pierre Machart (LIF), Thomas Peel (LIF, LATP), Liva Ralaivola (LIF),
Sandrine Anthoine (LATP), Herv\'e Glotin (LSIS) | Stochastic Low-Rank Kernel Learning for Regression | International Conference on Machine Learning (ICML'11), Bellevue
(Washington) : United States (2011) | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a novel approach to learn a kernel-based regression function. It
is based on the useof conical combinations of data-based parameterized kernels
and on a new stochastic convex optimization procedure of which we establish
convergence guarantees. The overall learning procedure has the nice properties
that a) ... | [
{
"version": "v1",
"created": "Wed, 11 Jan 2012 21:03:55 GMT"
}
] | 2012-01-13T00:00:00 | [
[
"Machart",
"Pierre",
"",
"LIF"
],
[
"Peel",
"Thomas",
"",
"LIF, LATP"
],
[
"Ralaivola",
"Liva",
"",
"LIF"
],
[
"Anthoine",
"Sandrine",
"",
"LATP"
],
[
"Glotin",
"Hervé",
"",
"LSIS"
]
] | TITLE: Stochastic Low-Rank Kernel Learning for Regression
ABSTRACT: We present a novel approach to learn a kernel-based regression function. It
is based on the useof conical combinations of data-based parameterized kernels
and on a new stochastic convex optimization procedure of which we establish
convergence guara... |
1201.2173 | Gholamreza Bahmanyar | Davar Giveki, Hamid Salimi, GholamReza Bahmanyar, Younes Khademian | Automatic Detection of Diabetes Diagnosis using Feature Weighted Support
Vector Machines based on Mutual Information and Modified Cuckoo Search | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Diabetes is a major health problem in both developing and developed countries
and its incidence is rising dramatically. In this study, we investigate a novel
automatic approach to diagnose Diabetes disease based on Feature Weighted
Support Vector Machines (FW-SVMs) and Modified Cuckoo Search (MCS). The
proposed model... | [
{
"version": "v1",
"created": "Tue, 10 Jan 2012 11:03:42 GMT"
}
] | 2012-01-12T00:00:00 | [
[
"Giveki",
"Davar",
""
],
[
"Salimi",
"Hamid",
""
],
[
"Bahmanyar",
"GholamReza",
""
],
[
"Khademian",
"Younes",
""
]
] | TITLE: Automatic Detection of Diabetes Diagnosis using Feature Weighted Support
Vector Machines based on Mutual Information and Modified Cuckoo Search
ABSTRACT: Diabetes is a major health problem in both developing and developed countries
and its incidence is rising dramatically. In this study, we investigate a n... |
1201.2025 | Mohsen Zare Baghbidi | Mohsen Zare Baghbidi, Kamal Jamshidi, Ahmad Reza Naghsh Nilchi and
Saeid Homayouni | Improvement of Anomoly Detection Algorithms in Hyperspectral Images
using Discrete Wavelet Transform | 13 pages, 9 figures, printed in Signal & Image Processing : An
International Journal (SIPIJ) | Signal & Image Processing : An International Journal (SIPIJ), Vol.
2, No. 4, 2011,13-25 | 10.5121/sipij.2011.2402 | null | cs.OH | http://creativecommons.org/licenses/by/3.0/ | Recently anomaly detection (AD) has become an important application for
target detection in hyperspectral remotely sensed images. In many applications,
in addition to high accuracy of detection we need a fast and reliable algorithm
as well. This paper presents a novel method to improve the performance of
current AD a... | [
{
"version": "v1",
"created": "Tue, 10 Jan 2012 11:29:02 GMT"
}
] | 2012-01-11T00:00:00 | [
[
"Baghbidi",
"Mohsen Zare",
""
],
[
"Jamshidi",
"Kamal",
""
],
[
"Nilchi",
"Ahmad Reza Naghsh",
""
],
[
"Homayouni",
"Saeid",
""
]
] | TITLE: Improvement of Anomoly Detection Algorithms in Hyperspectral Images
using Discrete Wavelet Transform
ABSTRACT: Recently anomaly detection (AD) has become an important application for
target detection in hyperspectral remotely sensed images. In many applications,
in addition to high accuracy of detection we... |
1201.2073 | Rafi Muhammad | Mehwish Aziz, Muhammad Rafi | Pbm: A new dataset for blog mining | 6; Internet and Web Engineering from: International Conference on
Computer Engineering and Technology, 3rd (ICCET 2011) | null | null | null | cs.AI cs.CL cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Text mining is becoming vital as Web 2.0 offers collaborative content
creation and sharing. Now Researchers have growing interest in text mining
methods for discovering knowledge. Text mining researchers come from variety of
areas like: Natural Language Processing, Computational Linguistic, Machine
Learning, and Stat... | [
{
"version": "v1",
"created": "Tue, 10 Jan 2012 15:18:38 GMT"
}
] | 2012-01-11T00:00:00 | [
[
"Aziz",
"Mehwish",
""
],
[
"Rafi",
"Muhammad",
""
]
] | TITLE: Pbm: A new dataset for blog mining
ABSTRACT: Text mining is becoming vital as Web 2.0 offers collaborative content
creation and sharing. Now Researchers have growing interest in text mining
methods for discovering knowledge. Text mining researchers come from variety of
areas like: Natural Language Processing... |
1201.1512 | Jim Ferry | James P. Ferry and J. Oren Bumgarner | Community detection and tracking on networks from a data fusion
perspective | 40 pages, 11 figures | null | null | null | cs.SI math.PR physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Community structure in networks has been investigated from many viewpoints,
usually with the same end result: a community detection algorithm of some kind.
Recent research offers methods for combining the results of such algorithms
into timelines of community evolution. This paper investigates community
detection and... | [
{
"version": "v1",
"created": "Fri, 6 Jan 2012 22:08:32 GMT"
}
] | 2012-01-10T00:00:00 | [
[
"Ferry",
"James P.",
""
],
[
"Bumgarner",
"J. Oren",
""
]
] | TITLE: Community detection and tracking on networks from a data fusion
perspective
ABSTRACT: Community structure in networks has been investigated from many viewpoints,
usually with the same end result: a community detection algorithm of some kind.
Recent research offers methods for combining the results of such ... |
1201.1450 | Casey Bennett | Casey Bennett | The Interaction of Entropy-Based Discretization and Sample Size: An
Empirical Study | null | null | null | null | stat.ML cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An empirical investigation of the interaction of sample size and
discretization - in this case the entropy-based method CAIM (Class-Attribute
Interdependence Maximization) - was undertaken to evaluate the impact and
potential bias introduced into data mining performance metrics due to variation
in sample size as it i... | [
{
"version": "v1",
"created": "Fri, 6 Jan 2012 16:45:57 GMT"
}
] | 2012-01-09T00:00:00 | [
[
"Bennett",
"Casey",
""
]
] | TITLE: The Interaction of Entropy-Based Discretization and Sample Size: An
Empirical Study
ABSTRACT: An empirical investigation of the interaction of sample size and
discretization - in this case the entropy-based method CAIM (Class-Attribute
Interdependence Maximization) - was undertaken to evaluate the impact a... |
0907.5155 | Ching-an Hsiao | C. A. Hsiao | On Classification from Outlier View | Conclusion renewed; IAENG International Journal of Computer Science,
Volume 37, Issue 4, Nov, 2010 | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Classification is the basis of cognition. Unlike other solutions, this study
approaches it from the view of outliers. We present an expanding algorithm to
detect outliers in univariate datasets, together with the underlying
foundation. The expanding algorithm runs in a holistic way, making it a rather
robust solution... | [
{
"version": "v1",
"created": "Wed, 29 Jul 2009 15:47:33 GMT"
},
{
"version": "v2",
"created": "Fri, 31 Jul 2009 14:17:30 GMT"
},
{
"version": "v3",
"created": "Fri, 24 Jun 2011 13:53:49 GMT"
},
{
"version": "v4",
"created": "Mon, 2 Jan 2012 15:19:41 GMT"
}
] | 2012-01-04T00:00:00 | [
[
"Hsiao",
"C. A.",
""
]
] | TITLE: On Classification from Outlier View
ABSTRACT: Classification is the basis of cognition. Unlike other solutions, this study
approaches it from the view of outliers. We present an expanding algorithm to
detect outliers in univariate datasets, together with the underlying
foundation. The expanding algorithm run... |
1108.1170 | Martin Jaggi | Martin Jaggi | Convex Optimization without Projection Steps | null | null | null | null | math.OC cs.AI cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For the general problem of minimizing a convex function over a compact convex
domain, we will investigate a simple iterative approximation algorithm based on
the method by Frank & Wolfe 1956, that does not need projection steps in order
to stay inside the optimization domain. Instead of a projection step, the
lineari... | [
{
"version": "v1",
"created": "Thu, 4 Aug 2011 19:15:04 GMT"
},
{
"version": "v2",
"created": "Tue, 16 Aug 2011 22:11:51 GMT"
},
{
"version": "v3",
"created": "Wed, 7 Sep 2011 22:56:49 GMT"
},
{
"version": "v4",
"created": "Mon, 19 Sep 2011 16:42:01 GMT"
},
{
"ver... | 2011-12-30T00:00:00 | [
[
"Jaggi",
"Martin",
""
]
] | TITLE: Convex Optimization without Projection Steps
ABSTRACT: For the general problem of minimizing a convex function over a compact convex
domain, we will investigate a simple iterative approximation algorithm based on
the method by Frank & Wolfe 1956, that does not need projection steps in order
to stay inside th... |
1112.6219 | Rafi Muhammad | Muhammad Rafi, M. Shahid Shaikh, Amir Farooq | Document Clustering based on Topic Maps | null | International Journal of Computer Applications 12(1):32-36,
December 2010 | 10.5120/1640-2204 | null | cs.IR cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Importance of document clustering is now widely acknowledged by researchers
for better management, smart navigation, efficient filtering, and concise
summarization of large collection of documents like World Wide Web (WWW). The
next challenge lies in semantically performing clustering based on the semantic
contents o... | [
{
"version": "v1",
"created": "Thu, 29 Dec 2011 04:15:48 GMT"
}
] | 2011-12-30T00:00:00 | [
[
"Rafi",
"Muhammad",
""
],
[
"Shaikh",
"M. Shahid",
""
],
[
"Farooq",
"Amir",
""
]
] | TITLE: Document Clustering based on Topic Maps
ABSTRACT: Importance of document clustering is now widely acknowledged by researchers
for better management, smart navigation, efficient filtering, and concise
summarization of large collection of documents like World Wide Web (WWW). The
next challenge lies in semantic... |
physics/0512147 | Domenico Patella | Paolo Mauriello and Domenico Patella | Introduction to tensorial resistivity probability tomography | 8 pages, 7 figures | Progress In Electromagnetics Research B, vol. 8, 129-146, 2008 | 10.2528/PIERB08051604 | null | physics.geo-ph physics.data-an | null | The probability tomography approach developed for the scalar resistivity
method is here extended to the 2D tensorial apparent resistivity acquisition
mode. The rotational invariant derived from the trace of the apparent
resistivity tensor is considered, since it gives on the datum plane anomalies
confined above the b... | [
{
"version": "v1",
"created": "Thu, 15 Dec 2005 23:59:23 GMT"
}
] | 2011-12-30T00:00:00 | [
[
"Mauriello",
"Paolo",
""
],
[
"Patella",
"Domenico",
""
]
] | TITLE: Introduction to tensorial resistivity probability tomography
ABSTRACT: The probability tomography approach developed for the scalar resistivity
method is here extended to the 2D tensorial apparent resistivity acquisition
mode. The rotational invariant derived from the trace of the apparent
resistivity tensor... |
physics/0602056 | Domenico Patella | Paolo Mauriello and Domenico Patella | Imaging polar and dipolar sources of geophysical anomalies by
probability tomography. Part I: theory and synthetic examples | 6 pages, 3 figures | Progress In Electromagnetics Research, vol. 87, 63-88, 2008 | 10.2528/PIER08092201 | null | physics.geo-ph physics.data-an | null | We develop the theory of a generalized probability tomography method to image
source poles and dipoles of a geophysical vector or scalar field dataset. The
purpose of the new generalized method is to improve the resolution power of
buried geophysical targets, using probability as a suitable paradigm allowing
all poss... | [
{
"version": "v1",
"created": "Wed, 8 Feb 2006 23:52:31 GMT"
}
] | 2011-12-30T00:00:00 | [
[
"Mauriello",
"Paolo",
""
],
[
"Patella",
"Domenico",
""
]
] | TITLE: Imaging polar and dipolar sources of geophysical anomalies by
probability tomography. Part I: theory and synthetic examples
ABSTRACT: We develop the theory of a generalized probability tomography method to image
source poles and dipoles of a geophysical vector or scalar field dataset. The
purpose of the ne... |
physics/0602057 | Domenico Patella | Paolo Mauriello and Domenico Patella | Imaging polar and dipolar sources of geophysical anomalies by
probability tomography. Part II: Application to the Vesuvius volcanic area | 7 pages, 10 figures | Progress In Electromagnetics Research, vol. 87, 63-88, 2008 | 10.2528/PIER08092201 | null | physics.geo-ph | null | In the previous part I, we have developed the generalized theory of the
probability tomography method to image polar and dipolar sources of a vector or
scalar geophysical anomaly field. The purpose of the new method was to improve
the core-and-boundary resolution of the most probable buried sources of the
anomalies d... | [
{
"version": "v1",
"created": "Thu, 9 Feb 2006 01:01:52 GMT"
}
] | 2011-12-30T00:00:00 | [
[
"Mauriello",
"Paolo",
""
],
[
"Patella",
"Domenico",
""
]
] | TITLE: Imaging polar and dipolar sources of geophysical anomalies by
probability tomography. Part II: Application to the Vesuvius volcanic area
ABSTRACT: In the previous part I, we have developed the generalized theory of the
probability tomography method to image polar and dipolar sources of a vector or
scalar g... |
1112.5215 | Dacheng Tao | Tianyi Zhou and Dacheng Tao | Bilateral Random Projections | 17 pages, 3 figures, technical report | null | null | null | stat.ML cs.DS | http://creativecommons.org/licenses/by-nc-sa/3.0/ | Low-rank structure have been profoundly studied in data mining and machine
learning. In this paper, we show a dense matrix $X$'s low-rank approximation
can be rapidly built from its left and right random projections $Y_1=XA_1$ and
$Y_2=X^TA_2$, or bilateral random projection (BRP). We then show power scheme
can furth... | [
{
"version": "v1",
"created": "Thu, 22 Dec 2011 01:16:20 GMT"
}
] | 2011-12-23T00:00:00 | [
[
"Zhou",
"Tianyi",
""
],
[
"Tao",
"Dacheng",
""
]
] | TITLE: Bilateral Random Projections
ABSTRACT: Low-rank structure have been profoundly studied in data mining and machine
learning. In this paper, we show a dense matrix $X$'s low-rank approximation
can be rapidly built from its left and right random projections $Y_1=XA_1$ and
$Y_2=X^TA_2$, or bilateral random proje... |
1112.5238 | Vinita Suyal | Vinita Suyal, Awadhesh Prasad, Harinder P. Singh | Symbolic analysis of slow solar wind data using rank order statistics | 10 pages, 7 figures, 1 table | Planetary and Space Science, S.N0. 0032-0633, 2011 | 10.1016/j.pss.2011.12.007 | null | astro-ph.SR physics.space-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We analyze time series data of the fluctuations of slow solar wind velocity
using rank order statistics. We selected a total of 18 datasets measured by the
Helios spacecraft at a distance of 0.32 AU from the sun in the inner
heliosphere. The datasets correspond to the years 1975-1982 and cover the end
of the solar ac... | [
{
"version": "v1",
"created": "Thu, 22 Dec 2011 06:05:45 GMT"
}
] | 2011-12-23T00:00:00 | [
[
"Suyal",
"Vinita",
""
],
[
"Prasad",
"Awadhesh",
""
],
[
"Singh",
"Harinder P.",
""
]
] | TITLE: Symbolic analysis of slow solar wind data using rank order statistics
ABSTRACT: We analyze time series data of the fluctuations of slow solar wind velocity
using rank order statistics. We selected a total of 18 datasets measured by the
Helios spacecraft at a distance of 0.32 AU from the sun in the inner
heli... |
1103.2756 | Xinmei Tian | Xinmei Tian and Dacheng Tao and Yong Rui | Sparse Transfer Learning for Interactive Video Search Reranking | 17 pages | null | 10.1145/0000000.0000000 | null | cs.IR cs.CV cs.MM stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Visual reranking is effective to improve the performance of the text-based
video search. However, existing reranking algorithms can only achieve limited
improvement because of the well-known semantic gap between low level visual
features and high level semantic concepts. In this paper, we adopt interactive
video sear... | [
{
"version": "v1",
"created": "Mon, 14 Mar 2011 19:48:20 GMT"
},
{
"version": "v2",
"created": "Tue, 15 Mar 2011 03:49:33 GMT"
},
{
"version": "v3",
"created": "Wed, 21 Dec 2011 00:12:42 GMT"
}
] | 2011-12-22T00:00:00 | [
[
"Tian",
"Xinmei",
""
],
[
"Tao",
"Dacheng",
""
],
[
"Rui",
"Yong",
""
]
] | TITLE: Sparse Transfer Learning for Interactive Video Search Reranking
ABSTRACT: Visual reranking is effective to improve the performance of the text-based
video search. However, existing reranking algorithms can only achieve limited
improvement because of the well-known semantic gap between low level visual
featur... |
1109.1852 | Bernardo Huberman | Chunyan Wang and Bernardo A. Huberman | Long Trend Dynamics in Social Media | null | null | null | null | physics.soc-ph cs.CY cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A main characteristic of social media is that its diverse content, copiously
generated by both standard outlets and general users, constantly competes for
the scarce attention of large audiences. Out of this flood of information some
topics manage to get enough attention to become the most popular ones and thus
to be... | [
{
"version": "v1",
"created": "Thu, 8 Sep 2011 22:15:08 GMT"
},
{
"version": "v2",
"created": "Tue, 20 Dec 2011 19:37:24 GMT"
}
] | 2011-12-21T00:00:00 | [
[
"Wang",
"Chunyan",
""
],
[
"Huberman",
"Bernardo A.",
""
]
] | TITLE: Long Trend Dynamics in Social Media
ABSTRACT: A main characteristic of social media is that its diverse content, copiously
generated by both standard outlets and general users, constantly competes for
the scarce attention of large audiences. Out of this flood of information some
topics manage to get enough a... |
1112.4607 | Arash Afkanpour | Arash Afkanpour and Csaba Szepesvari and Michael Bowling | Alignment Based Kernel Learning with a Continuous Set of Base Kernels | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The success of kernel-based learning methods depend on the choice of kernel.
Recently, kernel learning methods have been proposed that use data to select
the most appropriate kernel, usually by combining a set of base kernels. We
introduce a new algorithm for kernel learning that combines a {\em continuous
set of bas... | [
{
"version": "v1",
"created": "Tue, 20 Dec 2011 08:52:56 GMT"
}
] | 2011-12-21T00:00:00 | [
[
"Afkanpour",
"Arash",
""
],
[
"Szepesvari",
"Csaba",
""
],
[
"Bowling",
"Michael",
""
]
] | TITLE: Alignment Based Kernel Learning with a Continuous Set of Base Kernels
ABSTRACT: The success of kernel-based learning methods depend on the choice of kernel.
Recently, kernel learning methods have been proposed that use data to select
the most appropriate kernel, usually by combining a set of base kernels. We... |
1112.4020 | Andri Mirzal | Andri Mirzal | Clustering and Latent Semantic Indexing Aspects of the Nonnegative
Matrix Factorization | 28 pages, 5 figures | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-sa/3.0/ | This paper provides a theoretical support for clustering aspect of the
nonnegative matrix factorization (NMF). By utilizing the Karush-Kuhn-Tucker
optimality conditions, we show that NMF objective is equivalent to graph
clustering objective, so clustering aspect of the NMF has a solid
justification. Different from pr... | [
{
"version": "v1",
"created": "Sat, 17 Dec 2011 03:57:06 GMT"
}
] | 2011-12-20T00:00:00 | [
[
"Mirzal",
"Andri",
""
]
] | TITLE: Clustering and Latent Semantic Indexing Aspects of the Nonnegative
Matrix Factorization
ABSTRACT: This paper provides a theoretical support for clustering aspect of the
nonnegative matrix factorization (NMF). By utilizing the Karush-Kuhn-Tucker
optimality conditions, we show that NMF objective is equivalen... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.