Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan C. Bioch
Person information
- affiliation: Erasmus University, Rotterdam, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[p1]Jan C. Bioch, Yves Crama, Peter L. Hammer:
Decomposition of Boolean Functions. Boolean Models and Methods 2010: 39-76
2000 – 2009
- 2008
- [j8]Patrick J. F. Groenen
, Georgi I. Nalbantov, Jan C. Bioch:
SVM-Maj: a majorization approach to linear support vector machines with different hinge errors. Adv. Data Anal. Classif. 2(1): 17-43 (2008) - 2006
- [c11]Georgi I. Nalbantov, Jan C. Bioch, Patrick J. F. Groenen:
Classification with Support Hyperplanes. ECML 2006: 703-710 - [c10]Patrick J. F. Groenen, Georgi I. Nalbantov, J. Cor Bioch:
Nonlinear Support Vector Machines Through Iterative Majorization and I-Splines. GfKl 2006: 149-161 - 2005
- [j7]Jan C. Bioch:
The complexity of modular decomposition of Boolean functions. Discret. Appl. Math. 149(1-3): 1-13 (2005) - [c9]Viara Popova, Jan C. Bioch:
Monotone Classification by Function Decomposition. Discovery Science 2005: 203-214 - [c8]Georgi I. Nalbantov, Jan C. Bioch, Patrick J. F. Groenen:
Solving and Interpreting Binary Classification Problems in Marketing with SVMs. GfKl 2005: 566-573 - 2000
- [j6]Rob Potharst, Jan C. Bioch:
Decision trees for ordinal classification. Intell. Data Anal. 4(2): 97-111 (2000) - [c7]Jan C. Bioch, Viara Popova:
Rough Sets and Ordinal Classification. ALT 2000: 291-305
1990 – 1999
- 1999
- [j5]Jan C. Bioch, Toshihide Ibaraki, Kazuhisa Makino:
Minimum Self-dual Decompositions of Positive Dual-minor Boolean Functions. Discret. Appl. Math. 96-97: 307-326 (1999) - [c6]Rob Potharst, Jan C. Bioch:
A Decision Tree Algorithm for Ordinal Classification. IDA 1999: 187-198 - 1998
- [j4]Jan C. Bioch:
Dualization, Decision Lists and Identification of Monotone Discrete Functions. Ann. Math. Artif. Intell. 24(1-4): 69-91 (1998) - 1997
- [c5]Jan C. Bioch, Onno van der Meer, Rob Potharst:
Bivariate Decision Trees. PKDD 1997: 232-242 - 1996
- [c4]Jan C. Bioch, Onno van der Meer, Rob Potharst:
Classification using Bayesian neural nets. ICNN 1996: 1488-1493 - 1995
- [j3]Jan C. Bioch, Toshihide Ibaraki:
Decompositions of positive self-dual boolean functions. Discret. Math. 140(1-3): 23-46 (1995) - [j2]Jan C. Bioch, Toshihide Ibaraki:
Complexity of Identification and Dualization of Positive Boolean Functions. Inf. Comput. 123(1): 50-63 (1995) - [j1]Jan C. Bioch, Toshihide Ibaraki:
Generating and Approximating Nondominated Coteries. IEEE Trans. Parallel Distributed Syst. 6(9): 905-914 (1995) - [c3]Jan van den Berg, Jan C. Bioch:
Some theorems concerning the free energy of (un)constrained stochastic hopfield neural networks. EuroCOLT 1995: 298-312 - [c2]Jan C. Bioch, Robert Carsouw, Rob Potharst:
On the mapping of linear classification trees onto one-hidden-layer neural nets. ICNN 1995: 1739-1743 - 1990
- [c1]Aart Joppe, Helmut R. A. Cardon, Jan C. Bioch:
A neural network for solving the travelling salesman problem on the basis of city adjacency in the tour. IJCNN 1990: 961-964
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
