Skip to main content
Powered by ShareScore

Find research datasets worth reusing

Search datasets from major research repositories and use ShareScore to quickly assess how well each record supports discovery, access, and reuse.

5,153

datasets available to search

ShareScore release 0.9.0

Reset

Dataset results

5,153 results for “Genetic data”

Learn how ShareScore rates datasets ↗
zenodo40/100

Fig. 6 in Morphological and genetic data suggest a complex pattern of inter-island colonisation and differentiation for mining bees (Hymenoptera: Anthophila: Andrena) on the Macaronesian Islands

Fig. 6 Correlation of genetic distance (ΦST) and A squared Mahalanobis distance of morphometric data (r2= 0.18) and B Euclidian distance of qualitative morphological data (r2= 0.12)

opencc-by-4.0Nov 2021View details →
zenodo40/100

Fig. 1 in Morphological and genetic data suggest a complex pattern of inter-island colonisation and differentiation for mining bees (Hymenoptera: Anthophila: Andrena) on the Macaronesian Islands

Fig. 1 Location of the Azores, the Archipelago of Madeira, the Selvagens Islands, the Canary Islands, and Cape Verde (a). Close view to the islands of the Madeira Archipelago (b) and the Western Canary Islands (below, right) (c). Tenerife is characterised by the regions of Anaga, Teno, Las Cañadas/Teide, and Dorsal Rift. The taxa of the A. wollastoni group (Kratochwil, 2020) and the centres of their distri-

opencc-by-4.0Nov 2021View details →
zenodo40/100

BRAIN Journal-High Performance Data mining by Genetic Neural Network-Figure 8 . The Comparision of Run Times

<p>That is distinct that dynamic mutation rate or reduction idea for mutation operator is more<br> better of fixed rate. In fact obtain to high accuracy is result of our idea for mutation operator.<br> The number of hidden layer neurone is important problem for NN. The natural selection by<br> GA help finding the number of hidden layer neurone and it progress on duration generations.<br> The structured model of GANN finds better answer than NN but with much run time in<br> simulation. The learning of GA is much better than NN with back propagation because BP is a<br> method based on gradient descend and local optimum is a serious risk for that.<br> We hope that the number of training samples is more accurate without error, the new<br> algorithm is better. Tests show that the combination of genetic algorithms and neural networks to an<br> acceptable level solves the problem of overfitting.</p>

opencc-by-4.0Oct 2013View details →
zenodo40/100

BRAIN Journal-High Performance Data mining by Genetic Neural Network-Figure 7 . Test Accuracy with prograess generation

<p>In the training phase, the neural network weights errors are minimized and network design<br> problem which the objective function to an acceptable level. In test step we have better results<br> because weights of neural network are adjusted by genetic algorithm and back propagation method.<br> Of course achievement to accuracy with 83.5% is reason using of good feature with minimum error.</p>

opencc-by-4.0Oct 2013View details →
zenodo40/100

BRAIN Journal-High Performance Data mining by Genetic Neural Network-Figure 6. Training Accuracy with prograess generation

<p>There are many features will reduce the efficiency of the algorithm and its complexity.<br> Among the methods for selecting the appropriate features, the algorithm is a GA.<br> One of the important parameters for testing methods is accuracy rate on progress generation.<br> In fact accuracy is reverse error in algorithm results. As reader can compare the results of our paper<br> with another works. Figure 4 show that accuracy present for Training step. We achieve to best<br> answers of 800 generation to after generation.</p>

opencc-by-4.0Oct 2013View details →
zenodo40/100

BRAIN Journal-High Performance Data mining by Genetic Neural Network-Figure 4. Structural Crossover

<p>Guided crossover operator is based on the two point separation from parents are selected<br> Left and right parts of them are related to each other by the condition to be meaningful With this<br> new child of his parents is that. But a new generation of the random choice to have reached this<br> stage. The crossover rate is fixed for our algorithm.</p>

opencc-by-4.0Oct 2013View details →
zenodo40/100

BRAIN Journal-High Performance Data mining by Genetic Neural Network-Figure 5. Insertion and Deletion Hidden Layer in NN

<p>Change in NN structure is other method that we used to optimization of solution[18].<br> Insertion a hidden layer caused to mutation operator is much natural. As connection with father and<br> mother nodes is easily[20],[21]. Weights of node and errors automatically calculated.<br> For each stage of the implementation of the mutation operator in genetic algorithms, neural<br> networks, only one of the nodes in the hidden layer is selected and inserted. These layers are<br> inserted on condition that the definition does not harm the network structure and the action is<br> meaningful. As an added layer can adjust the weights and the connection to the parent node of a network<br> layer to be removed.</p>

opencc-by-4.0Oct 2013View details →
zenodo40/100

BRAIN Journal-High Performance Data mining by Genetic Neural Network-Figure 3. The Structure of Neural Network

<p>A neural network (NN), in the case of artificial neurons called artificial neural<br> network (ANN) or simulated neural network (SNN), is an interconnected group of natural<br> or artificial neurons that uses a mathematical or computational model for information<br> processing based on a connectionist approach to computation. In most cases an ANN is an adaptive<br> system that changes its structure based on external or internal information that flows through the<br> network[9].<br> In more practical terms neural networks are nonlinear statistical data modelling or decision<br> making tools. They can be used to model complex relationships between inputs and outputs or<br> to find patterns in data.<br> Two neurons neural network active in memory (ON or 1) or disable (Off or 0), and each<br> edge (synapses or connections between nodes) is a weight. Edges with positive weight, stimulate or<br> activate next active node, and edges with negative weight, disable or inhibit the next connected<br> node (if it is active) ones.</p>

opencc-by-4.0Oct 2013View details →
zenodo40/100

Data on Direct-to-Consumer Genetic Testing and DNA testing companies

<p>This table was compiled between 2011 and 2018. It is a list of companies offering direct-to-consumer DNA tests over the internet. It is primarily&nbsp;concerned with direct-to-consumer genetic testing companies operating currently and also includes those, which are no longer operating. The&nbsp;table briefly summarizes the services offered by each company and gives the company&rsquo;s location.</p> <p>I am continuing to update this list, so it is a work in progress, it does include some companies that advertise their services to physicians and&nbsp;some companies may have altered their offerings. Further updates will be provided later in 2018. I have added a shorter table at the end of&nbsp;relevant other companies. I hope to make a searchable database of a revised version of the document available through my website in the future.</p> <p>This work is being released for informational and educational purposes and should not be used for commercial purposes.</p> <p>Please refer to my website for further updates&nbsp;<a href="http://www.andelkamphillips.com">http://www.andelkamphillips.com</a></p>

opencc-by-4.0Feb 2018View details →
zenodo40/100

Microsat Data for 'Simulated Disperser Analysis: determining the number of loci required to genetically identify dispersers'

<p>Microsattelite data from 94 samples (<em>Stunus vulgaris</em>) from 3 populations and including 29 loci.&nbsp;Used in the paper&nbsp;&#39;Simulated Disperser Analysis: determining the number of loci required to genetically identify dispersers&#39;.&nbsp;</p>

opencc-by-4.0Mar 2018View details →
zenodo40/100

A Genetic Algorithm Approach to Regenerate Image from a Reduce Scaled Image Using Bit Data Count-In Figure 15 we were able to generate the symbol H without any help from a small image we used only for row and column data

<p>In Figure 15 we were able to generate the symbol H without any help from a small image we used only for row and column data.</p>

opencc-by-4.0Apr 2018View details →
zenodo40/100

A Genetic Algorithm Approach to Regenerate Image from a Reduce Scaled Image Using Bit Data Count-Figure 14. Symbol 8 regeneration

<p>As we can see, here we were able to recover the lost middle portion of character &lsquo;A&rsquo; using our genetic algorithm. If we can apply some noise filtering technique, the result would be far better. In figure 14, 15 there are another two examples.</p>

opencc-by-4.0Apr 2018View details →
zenodo40/100

A Genetic Algorithm Approach to Regenerate Image from a Reduce Scaled Image Using Bit Data Count-Figure 11. Initial population

<p>In figure 11 it is the initial population showed and figure 12 the population started to change and figure 13 we reached a convergence.</p>

opencc-by-4.0Apr 2018View details →
zenodo40/100

A Genetic Algorithm Approach to Regenerate Image from a Reduce Scaled Image Using Bit Data Count-Figure 10. Block example

<p>First, we have to convert the pixelated small image to the original size image, and then divide these into the blocks as it done in extraction time. Then we have to add or subtract random bits from each of these blocks to equal each block hamming bit to original hamming bit number. And then GA is applied to match these randomness to original image hamming bits in per row and column. In figure 10 there is a 4-block example which regenerates randomly using total block bit count. Now we will try to match their row and column bits of information with the extracted data which is described in later section.</p>

opencc-by-4.0Apr 2018View details →
zenodo40/100

A Genetic Algorithm Approach to Regenerate Image from a Reduce Scaled Image Using Bit Data Count-Figure 6. Methodology

<p>Our method will first resize the image using normal image resizing option provided by operating system or standard library and attach the extra 2 array of data which contains no of 1 in original image in each row and column. Also, the total no of 1 in that image will be present too.</p>

opencc-by-4.0Apr 2018View details →
zenodo40/100

A Genetic Algorithm Approach to Regenerate Image from a Reduce Scaled Image Using Bit Data Count-Figure 16. Failed Generations

<p>For some images there is a chance to get stuck where fitness function maxed, but we are not near to the original image like in figure 16, both row and column fitness matched. But image lost a key portion from original image, in these cases we should increase the weight of fitness function Fx(X), which will solve the issue.</p>

opencc-by-4.0Apr 2018View details →
zenodo40/100

A Genetic Algorithm Approach to Regenerate Image from a Reduce Scaled Image Using Bit Data Count-Figure 2. Image stored in cloud each year (Perret, 2017)

<p>Currently, 4.7 trillion of photos are saved in the cloud (Perret, 2017). And only a few percentage are called to use again. So less used files can be stores in a compression technique which can save more space than time and make the cloud system faster as memory redundancy time will be reduced.</p>

opencc-by-4.0Apr 2018View details →
zenodo40/100

A Genetic Algorithm Approach to Regenerate Image from a Reduce Scaled Image Using Bit Data Count-Figure 1. Photo amount by year (Perret, 2017)

<p>Revolution of a portable camera with computer started to produce an exponential rate of media files, and users are sharing these files with everyone. &nbsp;So, using the cloud to store images is becoming a favorite choice for users. But cloud does not only store huge files which are approximately 1.2 trillion in 2017 (Perret, 2017), it also has to transfer these files to a different network to serve users. To reduce load, the cloud system started to use different compression algorithm. These algorithms have a tradeoff between time and space. Most of these have better time complexity than space. But as the cloud has powerful and distributed computing power, it may be better to focus on saving space. As data transfer takes more time than processing same data in the cloud. A perfect use case is a mobile sending the large image to the cloud takes more data transfer time than the compression and decompression process in the cloud. So, in this age of the distributed computer, it is better to reduce size as computation time is less important than network data transfer time.</p>

opencc-by-4.0Apr 2018View details →
zenodo40/100

A Genetic Algorithm Approach to Regenerate Image from a Reduce Scaled Image Using Bit Data Count-Figure 9. Resized image and extracted data for a 100*100 size image

<p>For the extraction, our goal is to divide an image into smaller blocks and keep the row and column data for these blocks. But for our experiment we used a single block, which means taking the full image as a single block. For bigger image we should always divide the image in separate blocks and work on them par rally. As in figure 8, after extracting the data we can add the row and column bits information in the resized image or saved in a separate file. For proof of concept we saved it in a text file. And later that file is used to feed GA to make the fitness function, in figure 9 an extraction has been shown. In upper and side textbox containing the information which later is saved in a text file.</p>

opencc-by-4.0Apr 2018View details →
zenodo40/100

A Genetic Algorithm Approach to Regenerate Image from a Reduce Scaled Image Using Bit Data Count-Figure 7. Basic Methodology

<p>As in figure 7 we are storing the extra data which is look like figure 8. Where a 20*20 size image of alphabet &lsquo;A&rsquo; data has been stored. When we regenerate image, we are using these data.</p>

opencc-by-4.0Apr 2018View details →

ScienceDex guides

Understand access before you commit

These curated guides explain access requirements, typical timelines, costs, and reuse considerations for widely used research datasets.

Compare curated datasets

Allen Brain Atlas

Allen Brain Atlas is an Allen Institute collection of brain map atlases, datasets, APIs, and analysis tools covering mouse, human, and non-human primate brain resources.

allen-brain-atlas
neuroscienceopenDocumentation, web resources, and API references are available online.
Last verified 2026-04-30Open record

Annotated Behaviour and Observability Dataset (ABODe)

ABODe is a University of Edinburgh DataShare dataset for behavior classification in group-housed mice using home-cage video, identities, bounding boxes, ground-plate positions, and annotator labels.

abode-home-cage
behavioral-neuroscienceopenThe DataShare record exposes download links for annotations, documentation, license text, and the zipped per-snippet data directory.
Last verified 2026-04-30Open record

DANDI Archive for NWB datasets

DANDI is a BRAIN Initiative archive for publishing and sharing neurophysiology data, including electrophysiology, optophysiology, and behavioral data packaged as NWB and related standards.

dandi-nwb
electrophysiologyopenPublished Dandiset metadata and archive endpoints are available through the production DANDI API.
Last verified 2026-04-30Open record

International Brain Laboratory public data

The International Brain Laboratory public data releases expose standardized mouse decision-making experiments, including Neuropixels recordings, widefield calcium imaging, behavior, and session metadata accessed through the ONE API.

ibl
behavioral-neuroscienceopenPublic sessions can be searched and loaded from the IBL public data server through ONE.
Last verified 2026-04-29Open record

OpenNeuro

OpenNeuro is a free, open platform for sharing neuroimaging datasets, with public search, dataset pages, and download paths for web, S3, DataLad, and the OpenNeuro CLI.

openneuro
neuroscienceopenPublished datasets are available on demand over the internet.
Last verified 2026-04-29Open record